Optimizing structural recursion in functional programs

doi:10.1016/0096-0551(93)90004-K

Computer Languages

Volume 19, Issue 2, April 1993, Pages 91-103

https://doi.org/10.1016/0096-0551(93)90004-K Get rights and content

Abstract

An optimization technique for the implementation of functional languages with eager evaluation is described. Recursion is compiled into a variant of the Schorr-Waite algorithm that is fast and uses less stack space than a standard runtime stack implementation. Analysis techniques are provided to determine the safety of the optimization.

References (19)

B Courcelle et al.
Attribute grammars and recursive program schemes
Theoretical Comput. Sci.
(1982)
B Courcelle et al.
Attribute grammars and recursive program schemes
Theoretical Comput. Sci.
(1982)
J Engelfriet et al.
Macro tree transducers
J. Comput. Syst. Sci.
(1985)
H Vogler
Bottom-up computation of primitive recursive tree functions
J.A Goguen
Higher-order functions considered unnecessary for higher-order programming
H Klaeren
Ein algebraischer Ansatz zur Rekursionselimination. Habilitationsschrift
(1988)
H Klaeren et al.
Efficient implementation of an algebraic specification language
M Gordon et al.
A metalanguage for interactive proofs in LCF
L Cardelli
The functional abstract machine
D.E Knuth
Fundamental Algorithms, Vol. 1 of The Art of Computer Programming

There are more references available in the full text version of this article.

Cited by (0)

View full text

Optimizing structural recursion in functional programs

Abstract

Theoretical Comput. Sci.

Theoretical Comput. Sci.

J. Comput. Syst. Sci.

Ein algebraischer Ansatz zur Rekursionselimination. Habilitationsschrift

Efficient implementation of an algebraic specification language

A metalanguage for interactive proofs in LCF

The functional abstract machine

Fundamental Algorithms, Vol. 1 of The Art of Computer Programming