The essence of compiling with continuations
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
In order to simplify the compilation process, many compilers for higher-order languages use the continuation-passing style (CPS) transformation in a first phase to generate an intermediate representation of the source program. The salient aspect of this intermediate form is that all procedures take an argument that represents the rest of the computation (the “continuation”). Since the nai¨ve CPS transformation considerably increases the size of programs, CPS compilers perform reductions to produce a more compact intermediate representation. Although often implemented as a part of the CPS transformation, this step is conceptually a second phase. Finally, code generators for typical CPS compilers treat continuations specially in order to optimize the interpretation of continuation parameters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,480
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
Appel, A. W. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511609619 · Cited by 824
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
(2014) · The Theory of Models · doi:10.1016/b978-0-7204-2233-7.50001-0 · Cited by 622
The revised report on the syntactic theories of sequential control and state
Felleisen, M., & Hieb, R. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90014-7 · Cited by 523
Self-citationRepresenting Control: a Study of the CPS Transformation
Danvy, O., & Filinski, A. (1992) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001535 · Cited by 352
Control operators, the SECD-machine, and the λ-calculus.
Felleisen, M., & Friedman, D. P. (1987) · Cited by 340
Self-citationAppel, A. W., & MacQueen, D. B. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-54444-5_83 · Cited by 242
Improving binding times without explicit CPS-conversion
Bondorf, A. (1992) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/141471.141483 · Cited by 111
Cited by
TIL: a type-directed optimizing compiler for ML
Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., & Lee, P. (1996) · Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation · doi:10.1145/231379.231414 · Cited by 317
Essentials of programming languages
(2008) · Choice Reviews Online · doi:10.5860/choice.46-1527 · Cited by 316
Lightweight modular staging: a pragmatic approach to runtime code generation and compiled DSLs
Rompf, T., & Odersky, M. (2010) · Proceedings of the ninth international conference on Generative programming and component engineering · doi:10.1145/1868294.1868314 · Cited by 277
Information flow inference for ML
Pottier, F., & Simonet, V. (2003) · ACM Transactions on Programming Languages and Systems · doi:10.1145/596980.596983 · Cited by 262
Plotkin, G., & Pretnar, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00590-9_7 · Cited by 225
Metadata
- Authors
- Flanagan, C., Sabry, A., Duba, B. F., & Felleisen, M.
- Venue
- Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
- Publisher
- ACM
- Published
- 1993-06
- Pages
- 237-247
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2073904768
- Cited by
- 534
- References
- 9
- FWCI
- 10.20
- Type
- conference paper
- 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
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.