The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstracting control
Open accessAbstract
The last few years have seen a renewed interest in continuations for expressing advanced control structures in programming languages, and new models such as Abstract Continuations have been proposed to capture these dimensions. This article investigates an alternative formulation, exploiting the latent expressive power of the standard continuation-passing style (CPS) instead of introducing yet other new concepts. We build on a single foundation: abstracting control as a hierarchy of continuations, each one modeling a specific language feature as acting on nested evaluation contexts.
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
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
Definitional interpreters for higher-order programming languages
Reynolds, J. C. (1972) · Proceedings of the ACM annual conference on - ACM '72 · doi:10.1145/800194.805852 · Cited by 669
Revised 3 report on the algorithmic language scheme
Rees, J., & Clinger, W. (1986) · ACM SIGPLAN Notices · doi:10.1145/15042.15043 · Cited by 509
The theory and practice of first-class prompts
Felleisen, M. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73576 · Cited by 292
On the relation between direct and continuation semantics
Reynolds, J. C. (1974) · Lecture notes in computer science · doi:10.1007/3-540-06841-4_57 · Cited by 121
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
The mystery of the tower revealed: A nonreflective description of the reflective tower
Wand, M., & Friedman, D. P. (1988) · LISP and Symbolic Computation · doi:10.1007/bf01806174 · Cited by 79
Declarative continuations: An investigation of duality in programming language semantics
Filinski, A. (2005) · Springer eBooks · doi:10.1007/bfb0018355 · Cited by 60
Self-citation
Cited by
Representing Control: a Study of the CPS Transformation
Danvy, O., & Filinski, A. (1992) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001535 · Cited by 352
Self-citationDemystifying 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
Abstraction-safe effect handlers via tunneling
Zhang, Y., & Myers, A. C. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3290318 · Cited by 45
No value restriction is needed for algebraic effects and handlers
KAMMAR, O., & PRETNAR, M. (2017) · Journal of Functional Programming · doi:10.1017/s0956796816000320 · Cited by 22
Handling Polymorphic Algebraic Effects
Sekiyama, T., & Igarashi, A. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-17184-1_13 · Cited by 9
Metadata
- Authors
- Danvy, O., & Filinski, A.
- Venue
- Proceedings of the 1990 ACM conference on LISP and functional programming
- Publisher
- ACM
- Published
- 1990-05
- Pages
- 151-160
- OpenAlex
- W2293168108
- Cited by
- 403
- References
- 11
- Type
- conference abstract
- Language
- en
- Open access
- gold
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: Abstracting control. https://app.cochat.ai/papers/10.1145/91556.91622
- The paper
- Danvy, O., & Filinski, A. (1990). Abstracting control. Proceedings of the 1990 ACM conference on LISP and functional programming. https://doi.org/10.1145/91556.91622
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.