Frank Pfenning. An implementation of the Elf core language in Standard ML. Available via ftp over the Internet, September 1991. Send mail to elf-request@cs.cmu.edu for further information.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Processing with ForML is efficient, allowing its use in an interactive environment, and its formatting language can express common formating demands directly and easily, while relying on perspicuous and usable concepts. It has been successfully employed as the formatting tool for the Elf language [4]. In the next section we describe the primitives provided by ForML to build formats and how they affect the final output. SML program text will be set in teletype font, and we also assume that the Formatter structure has been opened, making its primitives directly available. 1 Future versions ....

Frank Pfenning. An implementation of the Elf core language in Standard ML. Available via ftp over the Internet, September 1991. Send mail to elf-request@cs.cmu.edu for further information.

No context found.

Frank Pfenning. An implementation of the Elf core language in Standard ML. Available via ftp over the Internet, September 1991. Send mail to elf-request@cs.cmu.edu for further information.

No context found.

Frank Pfenning. An implementation of the Elf core language in Standard ML. Available via ftp over the Internet, September 1991. Send mail to elf-request@cs.cmu.edu for further information.

....from the field of inductive theorem proving. This would mean that an Elf theorem prover would try to synthesize an appropriate deduction transformation, such as tr or cps above. We currently have a small prototype implementation of schema checking as an extension of the current Elf core language [22]. Several further verifications of standard meta theorems in logic and computer science using the methods described here are subject of current work. 3 We omit from this discussion the unit refinements for the different cases of cps that are needed in other parts of the proof. ....

Frank Pfenning. An implementation of the Elf core language in Standard ML. Available via ftp over the Internet, September 1991. Send mail to elf-request@cs.cmu.edu for further information.

....and its implementation in Elf can be obtained from [HHP, Pfe91b] Elf is a logic programming language based on the LF type theory, although in this report we deemphasize the operational aspects of Elf. All the Elf code in this report has been type checked and executed in the current implementation [Pfe91a]. 1 If the Elf implementation of the proof is ignored, this report can also be read as a detailed, informal proof of the Church Rosser theorem using the method of parallel reductions due to Tait and Martin Lof. The methodology for the representation of meta theorems (such as the Church Rosser ....

Frank Pfenning. An implementation of the Elf core language in Standard ML. Available via ftp over the Internet, September 1991. Send mail to elf-request@cs.cmu.edu for further information.

No context found.

Frank Pfenning. An implementation of the Elf core language in Standard ML. Available via ftp over the Internet, September 1991. Send mail to elfrequest @cs.cmu.edu for further information.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC