No CrossRef data available.
Article contents
CPS in little pieces: composing partial continuations
Published online by Cambridge University Press: 13 November 2002
Abstract
This paper presents a new two-stage CPS algorithm. The first stage plants trivial partial continuations via a recursive-descent traversal and the second stage is a rewrite system that transforms all nontail calls into tail calls. The algorithm combines the metaphors of the Plotkin-style CPS transformation along with reduction in the λ-calculus.
- Type
- THEORETICAL PEARL
- Information
- Copyright
- © 2002 Cambridge University Press
Discussions
No Discussions have been published for this article.