Download:
|
by Frank Pfenning
Informal Proceedings of the Workshop on Types for Proofs and Programs
http://pecan.srv.cs.cmu.edu/afs/cs.cmu.edu/user/fp/www/papers/rlf93.ps.gz
Add To MetaCart
Abstract:
We propose a refinement of the type theory underlying the LF logical framework by a form of subtypes and intersection types. This refinement preserves desirable features of LF, such as decidability of type-checking, and at the same time considerably simplifies the representations of many deductive systems. A subtheory can be applied directly to hereditary Harrop formulas which form the basis of Prolog and Isabelle. 1
Citations
|
530
|
A framework for defining logics
– Harper, Honsell, et al.
- 1993
|
|
332
|
Uniform proofs as a foundation for logic programming
– Miller, Nadathur, et al.
- 1991
|
|
182
|
Logic programming in the LF logical framework
– Pfenning
- 1991
|
|
127
|
Refinement types for ML
– Freeman, Pfenning
- 1991
|
|
104
|
Preliminary design of the programming language Forsythe
– Reynolds
- 1988
|
|
70
|
Programming with Intersection Types and Bounded Polymorphism
– Pierce
- 1991
|
|
61
|
Logic Programming over Polymorphically Order-Sorted Types
– Smolka
- 1989
|
|
54
|
Unification and anti-unification in the Calculus of Constructions
– Pfenning
- 1991
|
|
50
|
Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language
– Felty
- 1989
|
|
44
|
Natural semantics and some of its meta-theory in Elf
– Michaylov, Pfenning
- 1991
|
|
44
|
Computational Aspects of an Order-Sorted Logic with Term Declarations
– Schmidt-Schau
- 1989
|
|
42
|
Functional characters of solvable terms. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik
– Coppo, Dezani-Ciancaglini, et al.
- 1981
|
|
36
|
Compiler verification in LF
– Hannan, Pfenning
- 1992
|
|
32
|
A complete type inference algorithm for simple intersection types.In
– Coppo, Giannini
- 1992
|
|
29
|
T.: Isabelle tutorial and user’s manual
– Paulson, Nipkow
- 1990
|
|
25
|
The Church-Rosser property for fij-reduction in typed -calculi
– Geuvers
- 1992
|
|
24
|
Representing Logics in Type Theory
– Gardner
- 1992
|
|
24
|
The Coherence of Languages with Intersection Types
– Reynolds
- 1991
|
|
22
|
A module system for a programming language based on the LF logical framework
– Harper, Pfenning
- 1992
|
|
18
|
union and intersection types for program extraction
– Singleton
- 1991
|
|
11
|
Unification in order-sorted type theory
– Kohlhase
- 1992
|
|
11
|
Computational Aspects of an Order-Sorted Logic with Term Declarations
– Schmidt-Schauß
- 1989
|
|
10
|
Unification in a -calculus with Intersection Types
– Kohlhase, Pfenning
- 1993
|
|
10
|
Reduction and unification in lambda calculi with subtypes
– Nipkow, Qian
- 1992
|
|
8
|
The Church-Rosser property for βη-reduction in typed λ-calculi
– Geuvers
- 1992
|
|
7
|
The strength of the subset type in Martin-Lof's type theory
– Salvesen, Smith
- 1988
|
|
6
|
Order-sorted type theory I: Unification
– Kohlhase
- 1991
|
|
4
|
Unification in a λ-calculus with intersection types
– Kohlhase, Pfenning
- 1993
|
