Combinators for program generation Export

@article{citeulike:300323, abstract = {We present a general method to transform a compositional specification of a specializer for a functional programming language into a set of combinators that can be used to perform the same specialization more efficiently. The main transformation steps are the transition to higher-order abstract syntax and untagging. All transformation steps are proved correct. The resulting combinators can be implemented in any functional language, typed or untyped, pure or impure. They may also be considered as forming a domain-specific language for meta-programming. We demonstrate the generality of the method by applying it to several specializers of increasing strength. We demonstrate its efficiency by comparing it with a traditional specialization system based on self-application.}, address = {New York, NY, USA}, author = {Thiemann, Peter}, citeulike-article-id = {300323}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=968555}, citeulike-linkout-1 = {http://dx.doi.org/10.1017/S0956796899003469}, doi = {10.1017/S0956796899003469}, issn = {0956-7968}, journal = {J. Funct. Program.}, keywords = {partialevaluation}, month = {September}, number = {5}, pages = {483--525}, posted-at = {2005-08-22 15:11:59}, priority = {2}, publisher = {Cambridge University Press}, title = {Combinators for program generation}, url = {http://dx.doi.org/10.1017/S0956796899003469}, volume = {9}, year = {1999} }

TY - JOUR ID - citeulike:300323 L3 - citeulike-article-id:300323 N2 - We present a general method to transform a compositional specification of a specializer for a functional programming language into a set of combinators that can be used to perform the same specialization more efficiently. The main transformation steps are the transition to higher-order abstract syntax and untagging. All transformation steps are proved correct. The resulting combinators can be implemented in any functional language, typed or untyped, pure or impure. They may also be considered as forming a domain-specific language for meta-programming. We demonstrate the generality of the method by applying it to several specializers of increasing strength. We demonstrate its efficiency by comparing it with a traditional specialization system based on self-application. IS - 5 JF - J. Funct. Program. SN - 0956-7968 AD - New York, NY, USA EP - 525 TI - Combinators for program generation PB - Cambridge University Press VL - 9 SP - 483 KW - partialevaluation AU - Thiemann, Peter PY - 1999/09// UR - http://dx.doi.org/10.1017/S0956796899003469 ER -