Frank Pfenning  Home/Search
Context Related
| cmu.edu/afs/cs/user/fp/p...lics89.ps.gz cmu.edu/~fp/papers/lics89.ps.gz cmu.edu/user/fp/www/pape...lics89.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/afs/cs/user/fp/public/... (more) From: cmu.edu/afs/cs/user/fp/...lfsbib (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem provers, proof transformers, or type inference programs for programming languages with complex type systems. Elf unifies logic definition (in the style of LF, the Edinburgh Logical Framework) with logic programming (in the style of Prolog). It achieves this unification by giving types an operational interpretation, much the... (Update)
Similar documents based on text: More All
0.5: Logic Programming in the LF Logical Framework - Pfenning (1991) (Correct)
0.5: ElfRW: A Tool for Higher-Order Dependently Typed Rewriting.. - Gehrke (1997) (Correct)
0.5: Program Extraction in a Logical Framework Setting - Anderson (1994) (Correct)
Related documents from co-citation: More All
38: A framework for defining logics - Harper, Honsell et al. - 1987
25: An overview of prolog (context) - Nadathur, Miller - 1988
19: A formulation of the simple theory of types (context) - Church - 1940
BibTeX entry: (Update)
Pfenning, F. ELF: A language for logic definition and verified metaprogramming. In Proceedings Symposium on Logic in Computer Science (Washington, D.C., 1989), IEEE Computer Society Press, pp. 313--323. http://citeseer.ist.psu.edu/pfenning89elf.html More
@inproceedings{ pfenning89elf,
author = "Frank Pfenning",
title = "{Elf}: {A} Language for Logic Definition and Verified Meta-Programming",
booktitle = "Fourth Annual Symposium on Logic in Computer Science",
publisher = "IEEE Computer Society Press",
address = "Pacific Grove, California",
pages = "313--322",
year = "1989",
url = "citeseer.ist.psu.edu/pfenning89elf.html" }
Citations (may not include all citations):505 Implementing Mathematics with the Nuprl Proof Development Sy.. - Constable - 1986
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1988
266 Information and Computation (context) - Coquand, Huet et al. - 1988
221 Constraint logic programming (context) - Jaffar, Lassez - 1987
172 Higher-order abstract syntax (context) - Pfenning, Elliott - 1988
166 An overview of Prolog (context) - Nadathur, Miller - 1988
149 A logical analysis of modules for logic programming (context) - Miller - 1988
96 A survey of the project Automath (context) - de Bruijn - 1980
75 Using Typed Lambda Calculus to Implement Formal Systems on a.. - Avron, Honsell et al. - 1987
54 Partial polymorphic type inference and higher-order unificat.. (context) - Pfenning - 1988
46 Specifying theorem provers in a higher-order logic programmi.. (context) - Felty, Miller - 1988
45 HOL: A Machine Oriented Formulation of Higher-order Logic - Gordon - 1985
41 Computational metatheory in Nuprl (context) - Howe - 1988
26 Hereditary Harrop formulas and uniform proof systems (context) - Miller, Nadathur et al. - 1987
21 Formalized metareasoning in type theory (context) - Knoblock, Constable - 1986
15 Higher-order unification with dependent types (context) - Elliott - 1989
14 Springer-Verlag LNCS (context) - Gordon, Milner et al. - 1979
12 The Representation of Logics in Higher-Order Logic (context) - Paulson - 1987
11 Writing programs that construct proofs (context) - Constable, Knoblock et al. - 1984
7 Some applications of Gentzen's proof theory in automated ded.. (context) - Beeson - 1988
6 Strong normalization for typed terms with surjective pairing (context) - Troelstra - 1986
3 Unification under mixed prefixes (context) - Miller - 1987
2 Implementing Theorem Provers in Logic Programming (context) - Felty - 1987
1 Department of Computer Science (context) - Griffin, for et al. - 1987
1 A metalanguage for type checking and inference (context) - Felty, Miller - 1988
1 Structure and representation in the Edinburgh logical framew.. (context) - Harper, Sannella et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/afs/cs/user/fp/public/elf-papers/): More
Implementing the Meta-Theory of Deductive Systems - Pfenning, Rohwedder (1992) (Correct)
Unification in a lambda-Calculus with Intersection Types - Kohlhase, Pfenning (Correct)
Higher-order Unification with Dependent Function Types - Elliott (1989) (Correct)
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