|
130
|
Abstract Syntax and Variable Binding
– Marcelo Fiore
- 1999
|
|
90
|
Semantical analysis of higher-order abstract syntax
– M Hofmann
|
|
142
|
Nominal Logic: A First Order Theory of Names and Binding
– Andrew M. Pitts
- 2001
|
|
117
|
Primitive Recursion for Higher-Order Abstract Syntax
– Joëlle Despeyroux, Frank Pfenning
- 1997
|
|
81
|
A Metalanguage for Programming with Bound Names Modulo Renaming
– Andrew M. Pitts, Murdoch J. Gabbay
- 2000
|
|
269
|
Higher-order abstract syntax
– Frank Pfenning, Conal Elliott
- 1988
|
|
33
|
An extension to ML to handle bound variables in data structures
– Dale Miller
- 1990
|
|
136
|
de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem
– N G
- 1972
|
|
699
|
A calculus for cryptographic protocols: The spi calculus
– Martin Abadi, Andrew D. Gordon
- 1999
|
|
49
|
Five axioms of alpha-conversion
– Andrew D. Gordon, Tom Melham
- 1996
|
|
174
|
A new approach to abstract syntax with variable binding
– Murdoch J. Gabbay, Andrew M. Pitts
- 2002
|
|
634
|
A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
- 1993
|
|
15
|
A theory of inductive definitions with α-equivalence: Semantics, implementation, programming language
– M J Gabbay
- 2000
|
|
103
|
An algorithm for testing conversion in type theory
– Thierry Coquand
- 1990
|
|
84
|
Reasoning with higher-order abstract syntax in a logical framework
– R McDowell, D Miller
- 2002
|
|
725
|
Mobile ambients
– Luca Cardelli, Andrew D. Gordon
- 1998
|
|
573
|
The Definition of Standard ML (Revised
– Robin Milner, Mads Tofte, Robert Harper, David MacQueen
- 1997
|
|
32
|
A Spatial Logic for Concurrency
– L Caires, L Cardelli
|
|
3
|
A Theory of Inductive De with -Equivalence: Semantics, Implementation, Programming Language
– M J Gabbay
- 2000
|
