89 search results - page 2 / 18 » Abstract Syntax and Variable Binding |
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...
CL
2000
Springer
13 years 9 months ago
2000
Springer
ACTAC
2002
13 years 4 months ago
2002
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
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...
TLCA
2009
Springer
13 years 11 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...