Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-16T23:35:17.556Z Has data issue: false hasContentIssue false
  • English
  • Français

CPS in little pieces: composing partial continuations

Published online by Cambridge University Press:  13 November 2002

DANIEL P. FRIEDMAN  and
AMR SABRY
DANIEL P. FRIEDMAN
Affiliation:
Computer Science Department, Indiana University, Bloomington, IN 47405, USA
AMR SABRY
Affiliation:
Computer Science Department, Indiana University, Bloomington, IN 47405, USA
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.

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
Journal of Functional Programming , Volume 12 , Issue 6 , November 2002 , pp. 617 - 622
Copyright
© 2002 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.