article · 2000

Automating Functional Program Transformation

Markus Mottl

Cited by 0Abstract and details only

Abstract

We present a framework for automatic program transformation of a strict and pure functional language with a well-defined semantics. It will be shown that such a framework can be implemented most declaratively and concisely in a recently developed higher-order logic programming language called LambdaProlog. The most important component of this framework is an efficient, always terminating partial evaluator that can handle higher-order functions and preserves the effect behaviour of programs by making use of monads, a construct which originated in category theory. This allows us to fully exploit the higher-order capabilities of the implementation language to reason about computations as required for partial evaluation. Due to this technique, the only factor that limits the optimisation power of the partial evaluator seems to be the generally undecidable problem of inferring termination behaviour of computations.

Cite this paper

APA 7

Mottl, M. (2000). Automating Functional Program Transformation.

MLA 9

Mottl, Markus. “Automating Functional Program Transformation.” 2000.

Chicago

Mottl, Markus. 2000. “Automating Functional Program Transformation.”

Harvard

Mottl, M. (2000) ‘Automating Functional Program Transformation’.

BibTeX

@article{mottl2000automating,
  title = {{Automating Functional Program Transformation}},
  author = {Mottl, Markus},
  year = {2000}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.