Amy Felty  Home/Search
Context Related
| belllabs.com/dist/felty/lf91.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/~fp/lfsbib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Various languages have been proposed as specification languages for representing a wide variety of logics. The development of typed -calculi has been one approach toward this goal. The logical framework (LF), a -calculus with dependent types is one example of such a language. A small subset of intuitionistic logic with quantification over the simply typed -calculus has also been proposed as a framework for specifying general logics. The logic of hereditary Harrop formulas with quantification at ... (Update)
Context of citations to this paper: More
.... ning a type theory by a typed operational semantics goes back to the Automath languages [dB93] and has been applied to LF by Felty [Fel91]. Our canonical formulation signi cantly extends and streamlines the ideas behind Felty s canonical LF and its extension to LLF [CP98] the...
...inherent in CLF make it impossible to generate proofs of A A or to compose proofs of A B and B C in any other way. With one exception [Fel91], prior presentations of LF and LLF have been based on a syntax in which not every term is canonical. A diculty is that equality...
Cited by: More
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (Correct)
A concurrent logical framework I: Judgments and.. - Watkins, Cervesato.. (2003) (Correct)
A Concurrent Logical Framework: the - Propositional Fragment Kevin (Correct)
Similar documents (at the sentence level):
18.3%: Proceedings Of The First Workshop On Logical Frameworks - Huet, (eds.) (1990) (Correct)
Active bibliography (related documents): More All
0.6: A Logic Programming Approach to Implementing Higher-Order Term.. - Felty (1992) (Correct)
0.4: Proof-search in Type-theoretic Languages: An Introduction - Galmiche, Pym (2000) (Correct)
0.2: Implementing Tactics and Tacticals in a Higher-Order Logic.. - Amy Felty (1993) (Correct)
Similar documents based on text: More All
0.1: Intuitionistic Implication and Resolution - Hui-Bon-Hoa (Correct)
0.1: A Proof Procedure for the Logic of Hereditary Harrop Formulas - Nadathur (1993) (Correct)
0.1: Proofs as Computations in Linear Logic - Delzanno, Martelli (2000) (Correct)
Related documents from co-citation: More All
11: A framework for defining logics - Harper, Honsell et al. - 1987
9: Logical frameworks - Pfenning - 2000
9: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
BibTeX entry: (Update)
Amy Felty. Encoding dependent types in an intuitionistic logic. In G'erard Huet and Gordon D. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991. http://citeseer.ist.psu.edu/felty91encoding.html More
@inproceedings{ felty91encoding,
author = "Amy Felty",
title = "Encoding Dependent Types in an Intuitionistic Logic",
booktitle = "Logical Frameworks",
publisher = "Cambridge University Press",
editor = "G\'{e}rard Huet and Gordon D. Plotkin",
pages = "214--251",
year = "1991",
url = "citeseer.ist.psu.edu/felty91encoding.html" }
Citations (may not include all citations):434 A framework for defining logics - Harper, Honsell et al. - 1989
434 A framework for defining logics - Harper, Honsell et al. - 1987
419 A formulation of the simple theory of types (context) - Church - 1940 DBLP
340 Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. ACM DBLP
266 Information and Computation (context) - Coquand, Huet et al. - 1988
174 A unification algorithm for typed -calculus (context) - Huet - 1975
166 An overview of Prolog (context) - Nadathur, Miller - 1988
129 The foundation of a generic theorem prover - Paulson - 1989
75 Using typed lambda calculus to implement formal systems on a.. - Avron, Honsell et al. - 1987 ACM DBLP
54 Specifying and Implementing Theorem Provers in a Higher-Orde.. (context) - Felty - 1989
50 Higher-order horn clauses - Nadathur, Miller - 1990
46 Specifying theorem provers in a higher-order logic programmi.. (context) - Felty, Miller - 1988 ACM DBLP
43 A survey of the project AUTOMATH (context) - deBruijn - 1980
28 Encoding a dependent-type -calculus in a logic programming l.. (context) - Felty, Miller - 1990
16 Introduction to Combinatory Logic and Lambda Calculus (context) - Hindley, Seldin - 1986
10 Studies in Proof Theory Lecture Notes (context) - Martin-Lof, Theory - 1984
3 Resolution and type theory (context) - Helmink - 1990 ACM DBLP
2 A meta language for type checking and inference: An extended.. (context) - Felty, Miller - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~fp/lfs-bib.html): More
How to Believe a Machine-Checked Proof - Pollack (1996) (Correct)
The Calculus of Algebraic Constructions - Blanqui, Jouannaud, Okada (1999) (Correct)
F1.059e+06>The Journal of Functional and Logic.. - Volume Article April (1999) (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