article

Free access

Representing control in the presence of one-shot continuations

Authors:

Carl Bruggeman,

Oscar Waddell, and

R. Kent DybvigAuthors Info & Claims

ACM SIGPLAN Notices, Volume 31, Issue 5

Pages 99 - 107

https://doi.org/10.1145/249069.231395

Published: 01 May 1996 Publication History

Abstract

Traditional first-class continuation mechanisms allow a captured continuation to be invoked multiple times. Many continuations, however, are invoked only once. This paper introduces one-shot continuations, shows how they interact with traditional multi-shot continuations, and describes a stack-based implementation of control that handles both one-shot and multi-shot continuations. The implementation eliminates the copying overhead for one-shot continuations that is inherent in multi-shot continuations.

References

[1]

Andrew W. Appel and David B. MacQueen. Standard ML of New Jersey. In Proceedings of the Third International Symposium on Programming Language Implementation and Logic Programming, pages 1-13, August 1991.

[2]

Andrew W. Appel and Zhong Shao. An empirical and analytical study of stack vs. heap cost for languages with closures. Technical Report CS-TR-450-94, Princeton University, March 1994. Revised version to appear in Journal of Functional Programming.

[3]

J. Michael Ashley and R. Kent Dybvig. An efficient implementation of multiple return values in scheme. In Proceedings o/the 199~ A CM Conference on Lisp and Functional Programming, pages 140-149, July 1994.

Digital Library

[4]

Robert G. Burger, Oscar Waddell, and R. Kent Dybvig. Register allocation using lazy saves, eager restores, and greedy shuffling, in Proceedings o/the SIGPLAN '95 Conference on Programming Language Design and Implementation, pages 130-138, June 1995.

Digital Library

[5]

William Clinger, Jonathan A. Rees, et al. The revised4 report on the algorithmic language Scheme. LiSP Pointers, 4(3), 1991.

Digital Library

[6]

William F. Clocksin and Christopher S. Mellish. Pro. gramming in Prolog. Springer-Verlag, second edition, 1984.

Digital Library

[7]

Christopher T. Haynes Daniel P. Friedman and Mitchell Wand. Obtaining coroutines with continuations. Computer Languages, 11(3/4):143-153, 1986.

Digital Library

[8]

R. Kent Dybvig. The Scheme Programming Language. Prentice Hall, second edition, 1996.

Digital Library

[9]

R. Kent Dybvig and Robert Hieb. Engines from continuations. Computer Languages, 14(2):109-123, 1989.

Digital Library

[10]

Mathias Felleisen. Transliterating Prolog into Scheme. Technical Report 182, Indiana University, October 1985.

[11]

Richard P. Gabriel. Performance and Evaluation of LISP Systems. MIT Press, Cambridge, MA, 1985.

Digital Library

[12]

Emden R. Gansner and John H. Reppy. A multithreaded higher-order user interface toolkit. In User Interface Software. John Wiley & Sons Ltd, 1993.

Digital Library

[13]

Paul Haahr. Montage: Breaking windowing into small pieces. In USENIX Summer Conference, pages 289- 297, Anaheim, June 1990.

[14]

Christopher T. Haynes. Logic continuations. LISP Pointers, pages 157-176, 1987.

Digital Library

[15]

Christopher T. Haynes and Daniel P. Friedman. Abstracting timed preemption with engines. Computer Languages, 12(2):109-121, 1987.

Digital Library

[16]

Robert Hieb, R. Kent Dybvig, and Carl Bruggeman. Representing control in the presence of first-class continuations. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation, pages 66-77, June 1990.

Digital Library

[17]

Robin Milner, Mads Tofte, and Robert Harper. The Definition o/Standard ML. MIT Press, Cambridge, 1990.

Digital Library

[18]

Simon L. Peyton-Jones. private communication, December 1991.

[19]

Simon L. Peyton-Jones and Jon Salkild. The spineless tagless G-machine. In Proceedings of the Fourth Conference on Functional Programming and Computer Architecture, pages 184-201, September 1989.

Digital Library

[20]

R. Pike. A concurrent window system. Computing Systems, 2(2):133-153, 89.

[21]

John H. Reppy. CML: A higher-order concurrent language. In Proceedings of the 8IGP~AN '9i Conference on Programming Language Design and implementation, pages 293-305, Toronto, June 1991.

Digital Library

[22]

Gerald J. Sussman and Guy L. Steele Jr. Scheme: An interpreter for extended lambda calculus. AI Memo 349, Massachusetts Institute of Technology Artificial Intelligence Lab, 1975.

Digital Library

[23]

Oscar WaddeU. The Scheme Widget Library User's Manual. indiana University, Bloomington, Indiana, 1995.

Cited By

Phipps-Costin LRossberg AGuha ALeijen DHillerström DSivaramakrishnan KPretnar MLindley S(2023)Continuing WebAssembly with Effect HandlersProceedings of the ACM on Programming Languages10.1145/36228147:OOPSLA2(460-485)Online publication date: 16-Oct-2023
https://doi.org/10.1145/3622814
Elizarov RBelyaev MAkhin MUsmanov IDe Meuter WBaniassad E(2021)Kotlin coroutines: design and implementationProceedings of the 2021 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software10.1145/3486607.3486751(68-84)Online publication date: 20-Oct-2021
https://dl.acm.org/doi/10.1145/3486607.3486751
Bao YWei GBračevac OJiang YHe QRompf T(2021)Reachability types: tracking aliasing and separation in higher-order functional programsProceedings of the ACM on Programming Languages10.1145/34855165:OOPSLA(1-32)Online publication date: 15-Oct-2021
https://dl.acm.org/doi/10.1145/3485516
Show More Cited By

Index Terms

Representing control in the presence of one-shot continuations
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
      1. Semantics
    2. General programming languages
      1. Language features
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Control primitives
    2. Program semantics
      1. Denotational semantics

Recommendations

Representing control in the presence of one-shot continuations
PLDI '96: Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation

Traditional first-class continuation mechanisms allow a captured continuation to be invoked multiple times. Many continuations, however, are invoked only once. This paper introduces one-shot continuations, shows how they interact with traditional multi-...
Read More
Continuations and concurrency

Continuations have proven to be useful for implementing a variety of control structures, including exception handling facilities and breadth-first searching algorithms. However, traditional continuations are not useful in the presence of concurrency, ...
Read More
Continuations and concurrency
PPOPP '90: Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming

Continuations have proven to be useful for implementing a variety of control structures, including exception handling facilities and breadth-first searching algorithms. However, traditional continuations are not useful in the presence of concurrency, ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 31, Issue 5

May 1996

300 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/249069

Editor:
Richard L. Wexelblat

Issue’s Table of Contents

PLDI '96: Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
May 1996
300 pages
ISBN:0897917952
DOI:10.1145/231379
Chairman:
Charles N. Fischer
Univ. of Wisconsin, Madison

Copyright © 1996 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1996

Published in SIGPLAN Volume 31, Issue 5

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
647
Total Downloads

Downloads (Last 12 months)130
Downloads (Last 6 weeks)32

Other Metrics

View Author Metrics

Citations

Cited By

Phipps-Costin LRossberg AGuha ALeijen DHillerström DSivaramakrishnan KPretnar MLindley S(2023)Continuing WebAssembly with Effect HandlersProceedings of the ACM on Programming Languages10.1145/36228147:OOPSLA2(460-485)Online publication date: 16-Oct-2023
https://doi.org/10.1145/3622814
Elizarov RBelyaev MAkhin MUsmanov IDe Meuter WBaniassad E(2021)Kotlin coroutines: design and implementationProceedings of the 2021 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software10.1145/3486607.3486751(68-84)Online publication date: 20-Oct-2021
https://dl.acm.org/doi/10.1145/3486607.3486751
Bao YWei GBračevac OJiang YHe QRompf T(2021)Reachability types: tracking aliasing and separation in higher-order functional programsProceedings of the ACM on Programming Languages10.1145/34855165:OOPSLA(1-32)Online publication date: 15-Oct-2021
https://dl.acm.org/doi/10.1145/3485516
Zyuzin NNanevski A(2021)Contextual modal types for algebraic effects and handlersProceedings of the ACM on Programming Languages10.1145/34735805:ICFP(1-29)Online publication date: 22-Aug-2021
https://doi.org/10.1145/3473580
SHIVKUMAR BMURPHY JZIAREK L(2021)Real-time MLton: A Standard ML runtime for real-time functional programsJournal of Functional Programming10.1017/S095679682100017431Online publication date: 31-Aug-2021
https://doi.org/10.1017/S0956796821000174
Farvardin KReppy JDonaldson ATorlak E(2020)From folklore to fact: comparing implementations of stacks and continuationsProceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3385412.3385994(75-90)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3385412.3385994
Kawahara SKameyama Y(2020)One-Shot Algebraic Effects as CoroutinesTrends in Functional Programming10.1007/978-3-030-57761-2_8(159-179)Online publication date: 18-Aug-2020
https://doi.org/10.1007/978-3-030-57761-2_8
Hillerström DLindley SChapman JSwierstra W(2016)Liberating effects with rows and handlersProceedings of the 1st International Workshop on Type-Driven Development10.1145/2976022.2976033(15-27)Online publication date: 18-Sep-2016
https://dl.acm.org/doi/10.1145/2976022.2976033
Zendra OJul EDucournau RGagnon EJones RKrintz CMulet PVitek J(2008)Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and SystemsObject-Oriented Technology. ECOOP 2007 Workshop Reader10.1007/978-3-540-78195-0_6(50-64)Online publication date: 2008
https://doi.org/10.1007/978-3-540-78195-0_6
Thielecke H(2003)From control effects to typed continuation passingACM SIGPLAN Notices10.1145/640128.60414438:1(139-149)Online publication date: 15-Jan-2003
https://dl.acm.org/doi/10.1145/640128.604144
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents