Some lambda calculus and type theory formalized (1999)

by James Mckinna , Robert Pollack
Venue:Journal of Automated Reasoning
Citations:52 - 7 self

Documents Related by Co-Citation

207 A new approach to abstract syntax with variable binding – Murdoch J. Gabbay, Andrew M. Pitts - 2002
80 Nominal techniques in Isabelle/HOL – Christian Urban - 2005
314 System Description: Twelf --- A Meta-Logical Framework for Deductive Systems – Frank Pfenning, Carsten Schurmann - 1999
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
145 A New Approach to Abstract Syntax Involving Binders – Murdoch Gabbay, Andrew Pitts - 1999
20 André Hirschowitz. Higher-order abstract syntax in Coq – Joëlle Despeyroux, Amy P Felty - 1995
301 Higher-order abstract syntax – Frank Pfenning, Conal Elliott
154 de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem – N G - 1972
51 Five axioms of alpha-conversion – Andrew D. Gordon, Tom Melham - 1996
39 More Church-Rosser Proofs (in Isabelle/HOL) – Tobias Nipkow - 1996
161 Nominal Logic: A First Order Theory of Names and Binding – Andrew M. Pitts - 2001
695 A Framework for Defining Logics – Robert Harper , Furio Honsell, Gordon Plotkin - 1993
123 Primitive Recursion for Higher-Order Abstract Syntax – Joëlle Despeyroux, Frank Pfenning - 1997
96 Semantical analysis of higher-order abstract syntax – M Hofmann - 1999
37 A mechanical proof of the Church-Rosser theorem – N Shankar - 1988
107 An algorithm for testing conversion in type theory – T Coquand - 1991
136 Mechanized metatheory for the masses: The POPLmark challenge – Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Stephanie Weirich, Steve Zdancewic - 2005
466 Interactive Theorem Proving and Program Development, Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series – Yves Bertot, Pierre Castéran - 2004
33 Combining higher order abstract syntax with tactical theorem proving and (co)induction – S. J. Ambler, R. L. Crole, A. Momigliano - 2002