PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Functional programming and lambda calculus
Handbook of theoretical computer science (vol. B)
A theory of binding structures and applications to rewriting
Theoretical Computer Science
Types and programming languages
Types and programming languages
A Metalanguage for Programming with Bound Names Modulo Renaming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Explicit substitutions in the reduction of lambda terms
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
de Bruijn notation as a nested datatype
Journal of Functional Programming
Functional pearl: i am not a number--i am a free variable
Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Theoretical Computer Science
Scrap your nameplate: (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Ott: effective tool support for the working semanticist
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
A polynomial nominal unification algorithm
Theoretical Computer Science
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Ott: Effective tool support for the working semanticist
Journal of Functional Programming
Matching and alpha-equivalence check for nominal terms
Journal of Computer and System Sciences
Binding in Nominal Equational Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
General bindings and alpha-equivalence in nominal Isabelle
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Encoding Abstract Syntax Without Fresh Names
Journal of Automated Reasoning
| Hi-index | 0.00 |
C@aml is a tool that turns a so-called ''binding specification'' into an Objective Caml compilation unit. A binding specification resembles an algebraic data type declaration, but also includes information about names and binding. C@aml is meant to help writers of interpreters, compilers, or other programs-that-manipulate-programs deal with @a-conversion in a safe and concise style. This paper presents an overview of C@aml's binding specification language and of the code that C@aml produces.