|
117
|
Primitive Recursion for Higher-Order Abstract Syntax
– Joëlle Despeyroux, Frank Pfenning
- 1997
|
|
127
|
A New Approach to Abstract Syntax Involving Binders
– Murdoch Gabbay, Andrew Pitts
- 1999
|
|
278
|
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem
– N. G. De Bruijn
- 1972
|
|
130
|
Abstract Syntax and Variable Binding
– Marcelo Fiore
- 1999
|
|
174
|
A new approach to abstract syntax with variable binding
– Murdoch J. Gabbay, Andrew M. Pitts
- 2002
|
|
728
|
A formulation of the simple theory of types
– A Church
- 1940
|
|
269
|
Higher-order abstract syntax
– Frank Pfenning, Conal Elliott
- 1988
|
|
84
|
Reasoning with higher-order abstract syntax in a logical framework
– R McDowell, D Miller
- 2002
|
|
142
|
Nominal Logic: A First Order Theory of Names and Binding
– Andrew M. Pitts
- 2001
|
|
29
|
A mechanisation of name-carrying syntax up to alpha-conversion
– Andrew D Gordon
- 1994
|
|
110
|
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
|
|
34
|
More Church-Rosser Proofs (in Isabelle/HOL)
– Tobias Nipkow
- 1996
|
|
13
|
Recursive function definition for types with binders
– Michael Norrish
- 2004
|
|
258
|
Semantics of programming languages: structures and techniques
– C A Gunter
- 1992
|
|
90
|
Semantical analysis of higher-order abstract syntax
– M Hofmann
|
|
266
|
The Lambda Calculus: its syntax and semantics, volume 103 of Studies in logic and the foundations of mathematics
– Henk Barendregt
- 1985
|
|
36
|
A Mechanical Proof of the Church-Rosser Theorem
– N Shankar
- 1988
|
|
25
|
Substitution revisited
– A Stoughton
- 1988
|
|
51
|
Some lambda calculus and type theory formalized
– James Mckinna, Robert Pollack
- 1999
|
