Free Foil: Generating Efficient and Scope-Safe Abstract Syntax
Free Foil: Generating Efficient and Scope-Safe Abstract Syntax
Handling bound identifiers correctly and efficiently is critical in implementations of compilers, proof assistants, and theorem provers. When choosing a representation for abstract syntax with binders, implementors face a trade-off between type safety with intrinsic scoping, efficiency, and generality. The "foil" by Maclaurin, Radul, and Paszke combines an efficient implementation …