We describe motivation, design, use, and implementation of higher-order absrruct syntax as a central representation for programs, formulas, rules, and other syntactic objects in program manipulation and other formal systems where matching and substitution or unification are central operations. Higher-order abstract syntax incorporates name binding information in a uniform and language generic way. Thus it acts as a powerful link integrating diverse tools in such formal environments. We have implemented higher-order abstract syntax, a supporting matching and unification algorithm, and some clients in Common Lisp in the framework of the Ergo project at Carnegie Mellon University.
The basic principles of Higher-Order Abstract Syntax (HOAS) are presented in REF .
Higher-order abstract syntax
PLDI '88
Computer Science