Using circular programs for higher-order syntax: Functional pearl
Paper i 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

Författare

Emil Axelsson

Chalmers, Data- och informationsteknik, Programvaruteknik

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik

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

257-262

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1145/2500365.2500614

ISBN

9781450323260

Mer information

Skapat

2017-10-07