Documents Related by Co-Citation

695 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
36 An Extension to ML to Handle Bound Variables in Data Structures – Dale Miller - 1990
90 Reasoning with higher-order abstract syntax in a logical framework – Raymond C. Mcdowell, Dale A. Miller - 2002
845 A Formulation of the Simple Theory of Types – A Church - 1940
145 A New Approach to Abstract Syntax Involving Binders – Murdoch Gabbay, Andrew Pitts - 1999
96 Semantical analysis of higher-order abstract syntax – M Hofmann - 1999
215 A Linear Logical Framework – Iliano Cervesato, Frank Pfenning - 1996
41 Higher-order abstract syntax in Coq – Joëlle Despeyroux, Amy Felty, André Hirschowitz - 1995
301 Higher-order abstract syntax – Frank Pfenning, Conal Elliott
302 Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem – N. G. De Bruijn - 1972
107 An algorithm for testing conversion in type theory – T Coquand - 1991
265 Semantics of Programming Languages: Structures and Techniques. Foundations of Computing Series – C Gunter - 1992
162 Inductive Definitions in the System Coq Rules and Properties – Christine Paulin-Mohring - 1992
142 Abstract syntax and variable binding – M P Fiore, G D Plotkin, D Turi - 1999
22 Computation and deduction. Unpublished lecture notes – Frank Pfenning - 1994
61 Unification and Anti-Unification in the Calculus of Constructions – Frank Pfenning - 1991
560 Untersuchungen über das logische Schliessen. Mathematische Zeitschrift 39 – G Gentzen - 1935
88 A Metalanguage for Programming with Bound Names Modulo Renaming – Andrew M. Pitts, Murdoch J. Gabbay - 2000
80 Automating the Meta Theory of Deductive Systems – Carsten Schurmann, Dana Scott - 2000