Using circular programs for higher-order syntax: Functional pearl
Paper in proceeding, 2013

This pearl presents a novel technique for constructing a firstorder syntax tree directly from a higher-order interface. We exploit circular programming to generate names for new variables, resulting in a simple yet efficient method. Our motivating application is the design of embedded languages supporting variable binding, where it is convenient to use higher-order syntax when constructing programs, but firstorder syntax when processing or transforming programs.

Higher-order syntax

Embedded languages

Circular programming

Author

Emil Axelsson

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Koen Lindström Claessen

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

257-262
9781450323260 (ISBN)

Areas of Advance

Information and Communication Technology

Subject Categories

Computer and Information Science

DOI

10.1145/2500365.2500614

ISBN

9781450323260

More information

Created

10/7/2017