Cited By
View all- (2015)Combining deep and shallow embedding of domain-specific languagesComputer Languages, Systems and Structures10.1016/j.cl.2015.07.00344:PB(143-165)Online publication date: 1-Dec-2015
Using circular programs for higher-order syntax: functional pearl
Pages 257 - 262
Abstract
This pearl presents a novel technique for constructing a first-order 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 first-order syntax when processing or transforming programs.
References
[1]
E. Axelsson, K. Claessen, M. Sheeran, J. Svenningsson, D. Engdal, and A. Persson. The design and implementation of Feldspar. In Implementation and Application of Functional Languages, volume 6647 of LNCS, pages 121--136. Springer Berlin Heidelberg, 2011.
[2]
R. Bird. Using circular programs to eliminate multiple traversals of data. Acta Informatica, 21(3):239--250, 1984.
[3]
P. Bjesse, K. Claessen, M. Sheeran, and S. Singh. Lava: hardware design in Haskell. In Proceedings of the third ACM SIGPLAN international conference on Functional programming, ICFP '98, pages 174--184. ACM, 1998.
[4]
V. Capretta and A. P. Felty. Combining de Bruijn indices and higher-order abstract syntax in Coq. In Types for Proofs and Programs, volume 4502 of Lecture Notes in Computer Science, pages 63--77. Springer Berlin Heidelberg, 2007.
[5]
K. Claessen and D. Sands. Observable sharing for functional circuit description. In Advances in Computing Science, ASIAN'99, volume 1742 of LNCS, pages 62--73. Springer, 1999.
[6]
C. Elliott, S. Finne, and O. De Moor. Compiling embedded languages. Journal of Functional Programming, 13(3):455--481, May 2003.
[7]
A. Gill. Type-safe observable sharing in Haskell. In Proceedings of the 2nd ACM SIGPLAN symposium on Haskell, Haskell '09, pages 117--128. ACM, 2009.
[8]
G. Mainland and G. Morrisett. Nikola: embedding compiled GPU functions in Haskell. In Proceedings of the third ACM Haskell symposium on Haskell, Haskell '10, pages 67--78. ACM, 2010.
[9]
C. McBride. I am not a number, I am a classy hack. 2010. URL http://www.e-pig.org/epilogue/?p=773.
[10]
T. L. McDonell, M. M. Chakravarty, G. Keller, and B. Lippmeier. Optimising purely functional GPU programs. Accepted for publication at ICFP 2013.
[11]
F. Pfenning and C. Elliot. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, PLDI '88, pages 199--208. ACM, 1988.
[12]
J. Svensson, M. Sheeran, and K. Claessen. Obsidian: A domain specific embedded language for parallel programming of graphics processors. In Implementation and Application of Functional Languages, volume 5836 of LNCS, pages 156--173. Springer Berlin Heidelberg, 2011.
Index Terms
- Using circular programs for higher-order syntax: functional pearl
Recommendations
Using circular programs for higher-order syntax: functional pearl
ICFP '13This pearl presents a novel technique for constructing a first-order 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 ...
Concrete syntax for objects: domain-specific language embedding and assimilation without restrictions
OOPSLA '04Application programmer's interfaces give access to domain knowledge encapsulated in class libraries without providing the appropriate notation for expressing domain composition. Since object-oriented languages are designed for extensibility and reuse, ...
Tools and libraries to model and manipulate circular programs
PEPM '07: Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulationThis paper presents techniques to model circular lazy programs in a strict, purely functional setting. Circular lazy programs model any algorithm based on multiple traversals over a recursive data structure as a single traversal function. Such elegant ...
Comments
Information & Contributors
Information
Published In
September 2013
484 pages
September 2013457 pages
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
- SIGPLAN: ACM Special Interest Group on Programming Languages
- Northeastern University
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 September 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
ICFP'13
Sponsor:
ICFP'13: ACM SIGPLAN International Conference on Functional Programming
September 25 - 27, 2013
Massachusetts, Boston, USA
Acceptance Rates
ICFP '13 Paper Acceptance Rate 40 of 133 submissions, 30%;
Overall Acceptance Rate 333 of 1,064 submissions, 31%
Upcoming Conference
ICFP '25
- Sponsor:
- sigplan
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 210Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)1
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
Cited By
View all- (2015)Combining deep and shallow embedding of domain-specific languagesComputer Languages, Systems and Structures10.1016/j.cl.2015.07.00344:PB(143-165)Online publication date: 1-Dec-2015
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in