20 search results - page 2 / 4 » Functional Programming With Higher-order Abstract Syntax and... |
113
Voted
IGPL
2000
15 years 12 hour ago
2000
Abstract Neil Ghani Valeria de Paiva Eike Ritter The -calculus 1 adds explicit substitutions to the -calculus so as to provide a theoretical framework within which the implement...
110
Voted
CC
2003
Springer
15 years 5 months ago
2003
Springer
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
ICFP
2005
ACM
16 years 5 days 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...
114
Voted
ICFP
2005
ACM
16 years 5 days 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...
143
Voted
ICFP
2012
ACM
13 years 2 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...