Hostname: page-component-6bf8c574d5-b4m5d Total loading time: 0 Render date: 2025-02-17T12:52:36.021Z Has data issue: false hasContentIssue false
  • English
  • Français

Combinators for program generation

Published online by Cambridge University Press:  01 September 1999

PETER THIEMANN
PETER THIEMANN
Affiliation:
Institut für Informatik, Universität Freiburg, Universitätsgelände Flugplatz, D-79110 Freiburg, Germany (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Journal of Functional Programming , Volume 9 , Issue 5 , September 1999 , pp. 483 - 525
Copyright
© 1999 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.