Using circular programs for higher-order syntax (functional pearl)

DOI10.1145/2500365.2500614MaRDI QIDQ5244805zbMATH OpenOpenAlexFDO

Authors Emil Axelsson, Koen Claessen

Publication date 30 March 2015

Published in Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2500365.2500614

zbMATH Keywords

circular programmingembedded languageshigher-order syntax

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
• Practical Programming with Higher-Order Encodings and Dependent Types
• scientific article; zbMATH DE number 1696799
• Functional programming with higher-order abstract syntax and explicit substitutions
• Programs using syntax with first-class binders

Cited in

(3)

• Combining deep and shallow embedding of domain-specific languages
• Extending the loop language with higher-order procedural variables
• Functional PearlDeduction for functional programmers

This page was built for publication: Using circular programs for higher-order syntax (functional pearl)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244805)