Andrew W. Appel, Amy P. Felty  Home/Search
Context
Related
| belllabs.com/dist/fel...iclp99tr.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: belllabs.com/who/felty/bib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Prolog is known to be well-suited for expressing and implementing logics and inference systems. We show that lemmas and definitions in such logics can be implemented with a great economy of expression. We encode a polymorphic higher-order logic using the ML-style polymorphism of Prolog. The terms of the metalanguage (Prolog) can be used to express the statement of a lemma, and metalanguage type-checking can directly type-check the lemma. But to allow polymorphic lemmas requires either more... (Update)
Similar documents (at the sentence level):
62.7%: Lightweight Lemmas in lamba Prolog - Appel, Felty (1999) (Correct)
24.7%: Lightweight Lemmas in Lambda Prolog - Appel, Felty (1999) (Correct)
16.5%: Polymorphic Lemmas and Definitions in lambdaProlog and Twelf - Appel, Felty (Correct)
Active bibliography (related documents): More All
0.3: Higher-Order Rewriting with Dependent Types - Virga (1999) (Correct)
0.1: Implementation Considerations for Higher-Order Features in.. - Nadathur, Wilson (1993) (Correct)
0.1: A Treatment of Higher-Order Features in Logic Programming - Nadathur (2003) (Correct)
Similar documents based on text: More All
0.2: Dependent Types Ensure Partial Correctness of Theorem Provers - Appel, Felty (2002) (Correct)
0.2: Higher-Order Conditional Term Rewriting in the L lambda Logic.. - Felty (Correct)
0.1: Elf: A Language for Logic Definition and Verified Metaprogramming - Pfenning (1989) (Correct)
BibTeX entry: (Update)
@inproceedings{ appel99lightweight,
author = "Andrew W. Appel and Amy P. Felty",
title = "Lightweight Lemmas in Lambda Prolog",
booktitle = "Proceedings of the International Conference on Logic Programming ({ICLP}'99)",
publisher = "MIT Press",
address = "Las Cruces, New Mexico",
editor = "Danny De Schreye",
year = "1999",
url = "citeseer.ist.psu.edu/article/appel99lightweight.html" }
Citations (may not include all citations):566 Proof-carrying code - Necula - 1997
434 A framework for defining logics - Harper, Honsell et al. - 1993
343 Principal type-schemes for functional programs (context) - Damas, Milner - 1982
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
339 Efficient software-based fault isolation - Wahbe, Lucco et al. - 1993
266 Information and Computation (context) - Coquand, Huet et al. - 1988
251 A logic programming language with lambda-abstraction - Miller - 1991
221 Constraint logic programming (context) - Jaffar, Lassez - 1987
210 Logic programming in the LF logical framework - Pfenning - 1991
201 to typed assembly language (context) - Morrisett, Walker et al. - 1998
172 Higher-order abstract syntax (context) - Pfenning, Elliot - 1988
166 An overview of Prolog (context) - Nadathur, Miller - 1988
136 System description: Twelf --- a metalogical framework for de.. - Pfenning, Schurmann - 1999
72 Semantics and Pragmatics of the Lambda Calculus (context) - Wadsworth - 1971
57 Proof-carrying authentication - Appel, Felten - 1999
53 Implementing tactics and tacticals in a higher-order logic p.. - Felty - 1993
38 A representation of lambda terms suitable for operations on .. (context) - Nadathur, Wilson - 1990
31 A notation for lambda terms: A generalization of environment.. - Nadathur, Wilson - 1998
24 An algorithm for optimal lambda calculus reduction (context) - Lamping - 1990
23 The Optimal Implementation of Functional Programming Languag.. (context) - Asperti, Guerrini - 1998
21 Should your specification language be typed - Lamport, Paulson - 1999
18 The Type System of a Higher-Order Logic Programming Language - Nadathur, Pfenning - 1992
12 School of Computer Science (context) - Necula, Proofs et al. - 1998
10 personal communication (context) - Pfenning - 1999
3 Extending Twelf to rationals and beyond (context) - Virga - 1999
2 Polymorphic lemmas in LF and Prolog (context) - Appel, Felty - 1999
2 The Terzo implementation of Prolog (context) - Wickline - 1999
Documents on the same site (http://cm.bell-labs.com/who/felty/bib.html): More
Generalization and Reuse of Tactic Proofs - Felty, Howe (Correct)
Proving Properties About a Lazy Functional Language with the.. - Seaman, Felty (1993) (Correct)
Proof Search with Set Variable Instantiation in the Calculus of.. - Amy Felty (1996) (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