The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Representing Control: a Study of the CPS Transformation
Abstract
This paper investigates the transformation of λ ν-terms into continuation-passing style (CPS). We show that by appropriate η-expansion of Fisher and Plotkin's two-pass equational specification of the CPS transform, we can obtain a static and context-free separation of the result terms into “essential” and “administrative” constructs. Interpreting the former as syntax builders and the latter as directly executable code, We obtain a simple and efficient one-pass transformation algorithm, easily extended to conditional expressions, recursive definitions, and similar constructs. This new transformation algorithm leads to a simpler proof of Plotkin's simulation and indifference results. We go on to show how CPS-based control operators similar to, more general then, Scheme's call/cc can be naturally accommodated by the new transformation algorithm. To demonstrate the expressive power of these operators, we use them to present an equivalent but even more concise formulation of the efficient CPS transformation algorithm. Finally, we relate the fundamental ideas underlying this derivation to similar concepts from other work on program manipulation; we derive a one-pass CPS transformation of λ n-terms; and we outline some promising areas for future research.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
Call-by-name, call-by-value and the λ-calculus
Plotkin, G. D. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90017-1 · Cited by 1,154
Computational lambda-calculus and monads
Moggi, E. (2003) · [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science · doi:10.1109/lics.1989.39155 · Cited by 842
Appel, A. W. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609619 · Cited by 824
Danvy, O., & Filinski, A. (1990) · Proceedings of the 1990 ACM conference on LISP and functional programming · doi:10.1145/91556.91622 · Cited by 403
Self-citationThe icon programming language: an overview
Griswold, R. E., Hanson, D. R., & Korb, J. T. (1979) · ACM SIGPLAN Notices · doi:10.1145/988078.988082 · Cited by 250
Mix: A self-applicable partial evaluator for experiments in compiler generation
Jones, N. D., Sestoft, P., & Søndergaard, H. (1989) · Lisp and Symbolic Computation · doi:10.1007/bf01806312 · Cited by 250
Automatic autoprojection of recursive equations with global variables and abstract data types
Bondorf, A., & Olivier Danvy, A. (1991) · Science of Computer Programming · doi:10.1016/0167-6423(91)90002-f · Cited by 154
Two-level semantics and abstract interpretation
Nielson, F. (1989) · Theoretical Computer Science · doi:10.1016/0304-3975(89)90091-1 · Cited by 81
Abstract continuations: a mathematical semantics for handling full jumps
Felleisen, M., Wand, M., Friedman, D. P., & Duba, B. F. (1988) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/62678.62684 · Cited by 80
Cited by
Appel, A. W. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609619 · Cited by 824
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Essentials of programming languages
(2008) · Choice Reviews Online · doi:10.5860/choice.46-1527 · Cited by 316
York, B. N., Loeb, S., & Doss, C. (2019) · Journal of Human Resources · doi:10.3368/jhr.54.3.0517-8756r · Cited by 155
Demystifying differentiable programming: shift/reset the penultimate backpropagator
Wang, F., Zheng, D., Decker, J., Wu, X., Essertel, G. M., & Rompf, T. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3341700 · Cited by 59
Metadata
- Authors
- Danvy, O., & Filinski, A.
- Venue
- Mathematical Structures in Computer Science
- Publisher
- Cambridge University Press (CUP)
- Published
- 1992-12
- Volume
- 2
- Issue
- 4
- Pages
- 361-391
- ISSN
- 0960-1295 (ISSN-L)
- 1469-8072
- OpenAlex
- W1999336811
- Cited by
- 352
- References
- 10
- FWCI
- 11.18
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Representing Control: a Study of the CPS Transformation. https://app.cochat.ai/papers/10.1017/s0960129500001535
- The paper
- Danvy, O., & Filinski, A. (1992). Representing Control: a Study of the CPS Transformation. Mathematical Structures in Computer Science. https://doi.org/10.1017/s0960129500001535
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.