A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework (1992)

by Frank Pfenning
Citations:36 - 8 self

Active Bibliography

217 A Linear Logical Framework – Iliano Cervesato, Frank Pfenning - 1996
7 Elf: A Meta-Language for Deductive Systems (System Description) – Frank Pfenning - 1994
32 Mode and Termination Checking for Higher-Order Logic Programs – Ekkehard Rohwedder, Frank Pfenning - 1996
10 Elimination of Negation in a Logical Framework – Alberto Momigliano - 2000
3 Program Extraction in a Logical Framework Setting – Penny Anderson - 1994
28 An Empirical Study of the Runtime Behavior of Higher-Order Logic Programs – Spiro Michaylov, Frank Pfenning - 1992
6 Representing Proof Transformations for Program Optimization – Penny Anderson - 1994
59 From operational semantics to abstract machines – John Hannan, Dale Miller - 1992
3 Unification in a λ-Calculus with Intersection Types – Michael Kohlhase, Frank Pfenning
32 Implementing the Meta-Theory of Deductive Systems – Frank Pfenning, Ekkehard Rohwedder - 1992
30 Computation and Deduction – Frank Pfenning - 2001
A Little Goes a Long Way: A Simple Tool to Support Denotational Compiler-Correctness Proofs – Mitchell Wand, Mitchell W, Gregory T. Sullivan
33 A Linear Spine Calculus – Iliano Cervesato, Frank Pfenning - 2003
25 Extensions and Applications of Higher-order Unification – Conal M. Elliott - 1990
12 Mechanically Verifying the Correctness of an Offline Partial Evaluator – John Hatcliff - 1995
22 Higher-order abstract syntax with induction in Coq – Joelle Despeyroux, Andre Hirschowitz - 1994
43 Refinement Types for Logical Frameworks – Frank Pfenning - 1993
Separating Developments in λ-Calculus – Hongwei Xi - 1996
3 Object-Level Substitution, Unification And Generalization In Meta-Logic – Chuck C. Liang - 1995