20 search results - page 1 / 4 » Syntax for Free: Representing Syntax with Binding Using Para... |
TLCA
2009
Springer
13 years 11 months ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
LICS
2008
IEEE
13 years 10 months ago
2008
IEEE
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
IANDC
2007
13 years 4 months ago
2007
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names...
ICFP
2005
ACM
14 years 4 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
ICFP
2005
ACM
14 years 4 months ago
2005
ACM
Recent research has shown how boilerplate code, or repetitive code for traversing datatypes, can be eliminated using generic programming techniques already available within some i...