Refinement Types for Logical Frameworks (1993)

by Frank Pfenning
Venue:Informal Proceedings of the Workshop on Types for Proofs and Programs
Citations:38 - 8 self

Active Bibliography

2 Unification in a λ-Calculus with Intersection Types – Michael Kohlhase, Frank Pfenning
Refinement Types for Logical Frameworks – William Lovas, Karl Crary - 2010
203 A Linear Logical Framework – Iliano Cervesato, Frank Pfenning - 1996
25 Practical Refinement-Type Checking – Rowan Davies, Frank Pfenning - 1997
34 Intersection Types and Bounded Polymorphism – Benjamin C. Pierce - 1996
64 Programming with Intersection Types and Bounded Polymorphism – Benjamin C. Pierce - 1991
28 An Empirical Study of the Runtime Behavior of Higher-Order Logic Programs – Spiro Michaylov, Frank Pfenning - 1992
33 A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework – Frank Pfenning - 1992
7 Elf: A Meta-Language for Deductive Systems (System Description) – Frank Pfenning - 1994
32 Implementing the Meta-Theory of Deductive Systems – Frank Pfenning, Ekkehard Rohwedder - 1992
6 Representing Proof Transformations for Program Optimization – Penny Anderson - 1994
15 A Structural Proof of Cut Elimination and Its Representation in a Logical Framework – Frank Pfenning - 1994
10 Elimination of Negation in a Logical Framework – Alberto Momigliano - 2000
Elaborating Intersection and Union Types – Joshua Dunfield
52 Intersection Type Assignment Systems – Steffen Van Bakel - 1995
7 Combining two forms of type refinements – Joshua Dunfield - 2002
31 Tridirectional Typechecking – Joshua Dunfield, Frank Pfenning - 2004
3 Program Extraction in a Logical Framework Setting – Penny Anderson - 1994
3 A Computational Meta Logic for the Horn Fragment of LF – Carsten Schürmann - 1995