|
|
Abstract Syntax with Variable Binding
– Murdoch J. Gabbay, Andrew M. Pitts
- 1999
|
|
127
|
A New Approach to Abstract Syntax Involving Binders
– Murdoch Gabbay, Andrew Pitts
- 1999
|
|
20
|
Focusing on binding and computation
– Daniel R. Licata, Noam Zeilberger, Robert Harper
- 2008
|
|
174
|
A new approach to abstract syntax with variable binding
– Murdoch J. Gabbay, Andrew M. Pitts
- 2002
|
|
31
|
Macros as multi-stage computations: Type-safe, generative, binding macros in MacroML
– Steve Ganz
- 2001
|
|
5
|
A Comparison of Formalizations of the Meta-Theory of a Language with Variable Bindings in Isabelle
– A. Momigliano, S. J. Ambler, R. L. Crole
- 2001
|
|
1
|
A First-Order Syntax for the pi-Calculus in Isabelle/HOL using Permutations
– Christine Röckl
|
|
142
|
Nominal Logic: A First Order Theory of Names and Binding
– Andrew M. Pitts
- 2001
|
|
3
|
Encoding Generic Judgments
– Dale Miller, Alwen Tiu, Ècole Polytechnique
- 2002
|
|
1
|
The Representational Adequacy of HYBRID
– R. L. Crole
|
|
11
|
Syntax for free: Representing syntax with binding using parametricity
– Robert Atkey
- 2009
|
|
46
|
Nominal Unification
– Christian Urban, Andrew Pitts, Murdoch Gabbay
- 2003
|
|
5
|
Staged Computation with Names and Necessity
– Aleksandar Nanevski, Frank Pfenning
- 2005
|
|
|
A Meta-Logical Framework Based on Regular Worlds
– Carsten Schürmann
- 2000
|
|
1
|
A temporal-logic approach to programming with dependent types and higher-order encodings
– Adam Poswolsky, Carsten Schürmann
- 2005
|
|
19
|
Recursion for Higher-Order Encodings
– Carsten Schürmann
|
|
23
|
The ∇-calculus. Functional programming with higher-order encodings
– Carsten Schürmann, Adam Poswolsky, Jeffrey Sarnat
- 2005
|
|
3
|
Nominal System T
– Andrew M. Pitts
- 2010
|
|
|
Structured Coalbegras and Minimal HD-Automata for the π-Calculus
– Ugo Montanari, Marco Pistore
- 2000
|
