The theory and practice of first-class prompts

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The theory and practice of first-class prompts

Full text

Pdf (1.12 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

San Diego, California, United States

Pages: 180 - 190

Year of Publication: 1988

ISBN:0-89791-252-7

Author

Mattias Felleisen

Indiana University, Computer Science Department, Lindley Hall 101, Bloomington, IN

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 42, Citation Count: 62

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/73560.73576 What is a DOI?

ABSTRACT

An analysis of the &lgr;ugr;-C-calculus and its problematic relationship to operational equivalence leads to a new control facility: the prompt-application. With the introduction of prompt-applications, the control calculus becomes a traditional calculus all of whose equations imply operational equivalence. In addition, prompt-applications enhance the expressiveness and efficiency of the language. We illustrate the latter claim with examples from such distinct areas as systems programming and tree processing.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BARENDREGT, H.P. The Lambda Calculus: Its Syntax and Semantics. rev. ed. Studies in Logic and the Foundations of Mathematics 103. North- Holland, Amsterdam, 1984.
	2	Matthias Felleisen, The calculi of lambda-nu-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages, 1987
	3	FELLEISEN, M., D.P. FRIEDMAN, B. DUBA, AND J. MEKrtILL. Beyond continuations. Technical Report No 216, Indiana University Computer Science Department, 1987.
	4	M. Felleisen , D. P. Friedman , E. Kohlbecker , B. Duba, A syntactic theory of sequential control, Theoretical Computer Science, v.52 n.3, p.205-237, June 1987 [doi>10.1016/0304-3975(87)90109-5]
	5	Christopher T. Haynes , Daniel P. Friedman, Embedding continuations in procedural objects, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.4, p.582-598, Oct. 1987 [doi>10.1145/29873.30392]
	6	HANSON, C., ,}. LAMPING. Dynamic binding in Scheme, unpublished manuscript, 1984, MIT.
	7	G. F. Johnson, GL—a denotational testbed with continuations and partial continuations as first-class objects, ACM SIGPLAN Notices, v.22 n.7, p.165-176, July 1987
	8	P. J. Landin, The next 700 programming languages, Communications of the ACM, v.9 n.3, p.157-166, March 1966 [doi>10.1145/365230.365257]
	9	LANDIN, P.J. The mechanical evaluation of expressions. Compu~. J. 6(4), 1964, 308-320.
	10	John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962
	11	PLOTKIN, G.D. Call-by-name, call-by-value, and the A-calculus. Theor. Comput. Sci. 1, 1975, 125-159.
	12	J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
	13	John C. Reynolds, Definitional interpreters for higher-order programming languages, Proceedings of the ACM annual conference, p.717-740, August 01-01, 1972, Boston, Massachusetts, United States [doi>10.1145/800194.805852]
	14	Guy L. Steele, Jr., Common LISP: the language, Digital Press, Newton, MA, 1984

CITED BY 62

	Edoardo Biagioni , Ken Cline , Peter Lee , Chris Okasaki , Chris Stone, Safe-for-Space Threads in Standard ML, Higher-Order and Symbolic Computation, v.11 n.2, p.209-225, September 1998
	Kenichi Asai, Online partial evaluation for shift and reset, ACM SIGPLAN Notices, v.37 n.3, p.19-30, March 2002
	Robert Muller, M-LISP: a representation-independent dialect of LISP with reduction semantics, ACM Transactions on Programming Languages and Systems (TOPLAS), v.14 n.4, p.589-616, Oct. 1992
	Haim Kaplan , Robert E. Tarjan, Purely functional representations of catenable sorted lists, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.202-211, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	Bruce Duba , Robert Harper , David MacQueen, Typing first-class continuations in ML, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.163-173, January 21-23, 1991, Orlando, Florida, United States
	Morry Katz , Daniel Weise, Continuing into the future: on the interaction of futures and first-class continuations, Proceedings of the 1990 ACM conference on LISP and functional programming, p.176-184, June 27-29, 1990, Nice, France
	Robert Cartwright , Matthias Felleisen, Observable sequentiality and full abstraction, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.328-342, January 19-22, 1992, Albuquerque, New Mexico, United States
	Jon G. Riecke , Ramesh Viswanathan, Isolating side effects in sequential languages, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-12, January 23-25, 1995, San Francisco, California, United States
	Dorai Sitaram, Handling control, ACM SIGPLAN Notices, v.28 n.6, p.147-155, June 1993
	R. Hieb , R. Kent Dybvig, Continuations and concurrency, ACM SIGPLAN Notices, v.25 n.3, p.128-136, Mar. 1990
	Olivier Danvy , Andrzej Filinski, Abstracting control, Proceedings of the 1990 ACM conference on LISP and functional programming, p.151-160, June 27-29, 1990, Nice, France
	Haim Kaplan , Robert E. Tarjan, Purely functional, real-time deques with catenation, Journal of the ACM (JACM), v.46 n.5, p.577-603, Sept. 1999
	Dorai Sitaram , Matthias Felleisen, Models of continuations without continuations, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.185-196, January 21-23, 1991, Orlando, Florida, United States
	Hayo Thielecke, From control effects to typed continuation passing, ACM SIGPLAN Notices, v.38 n.1, p.139-149, January 2003
	Privacy via subsumption, Information and Computation, v.172 n.1, p.2-28, January 10, 2002
	P. Jouvelot , D. K. Gifford, Reasoning about continuations with control effects, ACM SIGPLAN Notices, v.24 n.7, p.218-226, July 1989
	Julia L. Lawall , Olivier Danvy, Continuation-based partial evaluation, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.227-238, July-Sept. 1994
	Carl A. Gunter , Didier Rémy , Jon G. Riecke, A generalization of exceptions and control in ML-like languages, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.12-23, June 26-28, 1995, La Jolla, California, United States
	Andrzej Filinski, Representing monads, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.446-457, January 16-19, 1994, Portland, Oregon, United States
	Robert Muller, M-LISP: its natural semantics and equational logic, ACM SIGPLAN Notices, v.26 n.9, p.234-242, Sept. 1991
	Matthias Felleisen , Mitch Wand , Daniel Friedman , Bruce Duba, Abstract continuations: a mathematical semantics for handling full jumps, Proceedings of the 1988 ACM conference on LISP and functional programming, p.52-62, July 25-27, 1988, Snowbird, Utah, United States
	Christian Queinnec , Bernard Serpette, A dynamic extent control operator for partial continuations, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.174-184, January 21-23, 1991, Orlando, Florida, United States
	Martín Abadi , Anindya Banerjee , Nevin Heintze , Jon G. Riecke, A core calculus of dependency, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.147-160, January 20-22, 1999, San Antonio, Texas, United States
	Matthias Felleisen, &lgr;-V-CS: an extended &lgr;-calculus for scheme, Proceedings of the 1988 ACM conference on LISP and functional programming, p.72-85, July 25-27, 1988, Snowbird, Utah, United States
	Amos Fiat , Haim Kaplan, Making data structures confluently persistent, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.537-546, January 07-09, 2001, Washington, D.C., United States
	Nevin Heintze , Jon G. Riecke, The SLam calculus: programming with secrecy and integrity, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.365-377, January 19-21, 1998, San Diego, California, United States
	C.-H. L. Ong , C. A. Stewart, A Curry-Howard foundation for functional computation with control, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.215-227, January 15-17, 1997, Paris, France
	Olivier Danvy, Type-directed partial evaluation, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.242-257, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Jon G. Riecke, Delimiting the scope of effects, Proceedings of the conference on Functional programming languages and computer architecture, p.146-155, June 09-11, 1993, Copenhagen, Denmark
	Haim Kaplan , Robert E. Tarjan, Persistent lists with catenation via recursive slow-down, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.93-102, May 29-June 01, 1995, Las Vegas, Nevada, United States
	Martin Gasbichler , Michael Sperber, Final shift for call/cc:: direct implementation of shift and reset, ACM SIGPLAN Notices, v.37 n.9, p.271-282, September 2002
	Yukiyoshi Kameyama , Masahito Hasegawa, A sound and complete axiomatization of delimited continuations, ACM SIGPLAN Notices, v.38 n.9, p.177-188, September 2003
	Suresh Jagannathan, Metalevel building blocks for modular systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.456-492, May 1994
	Dorai Sitaram , Matthias Felleisen, Reasoning with continuations II: full abstraction for models of control, Proceedings of the 1990 ACM conference on LISP and functional programming, p.161-175, June 27-29, 1990, Nice, France
	Albert Meyer , Jon G. Riecke, Continuations may be unreasonable, Proceedings of the 1988 ACM conference on LISP and functional programming, p.63-71, July 25-27, 1988, Snowbird, Utah, United States
	Zena M. Ariola , Hugo Herbelin , Amr Sabry, A type-theoretic foundation of continuations and prompts, ACM SIGPLAN Notices, v.39 n.9, September 2004
	Tatsurou Sekiguchi , Takahiro Sakamoto , Akinori Yonezawa, Portable implementation of continuation operators in imperative languages by exception handling, Advances in exception handling techniques, Springer-Verlag New York, Inc., New York, NY, 2001
	Dariusz Biernacki , Olivier Danvy , Chung-chieh Shan, On the dynamic extent of delimited continuations, Information Processing Letters, v.96 n.1, p.7-17, 16 October 2005
	Dariusz Biernacki , Olivier Danvy , Chung-chieh Shan, On the static and dynamic extents of delimited continuations, Science of Computer Programming, v.60 n.3, p.274-297, May 2006
	Yukiyoshi Kameyama, Axioms for control operators in the CPS hierarchy, Higher-Order and Symbolic Computation, v.20 n.4, p.339-369, December 2007
	Zena M. Ariola , Hugo Herbelin , Amr Sabry, A proof-theoretic foundation of abortive continuations, Higher-Order and Symbolic Computation, v.20 n.4, p.403-429, December 2007
	Chung-Chieh Shan, A static simulation of dynamic delimited control, Higher-Order and Symbolic Computation, v.20 n.4, p.371-401, December 2007
	Oleg Kiselyov , Chung-chieh Shan , Amr Sabry, Delimited dynamic binding, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Andrzej Filinski, On the relations between monadic semantics, Theoretical Computer Science, v.375 n.1-3, p.41-75, May, 2007
	Avik Chaudhuri , Prasad Naldurg , Sriram Rajamani, A type system for data-flow integrity on windows vista, Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security, June 07-13, 2008, Tucson, AZ, USA
	Magorzata Biernacka , Olivier Danvy, A syntactic correspondence between context-sensitive calculi and abstract machines, Theoretical Computer Science, v.375 n.1-3, p.76-108, May, 2007
	Christopher J. Dutchyn, Specializing continuations a model for dynamic join points, Proceedings of the 6th workshop on Foundations of aspect-oriented languages, p.45-57, March 13-13, 2007, Vancouver, British Columbia, Canada
	Dariusz Biernacki , Olivier Danvy, THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control, Journal of Functional Programming, v.16 n.3, p.269-280, May 2006
	Sanjeev Kumar , Carl Bruggeman , R. Kent Dybvig, Threads Yield Continuations, Lisp and Symbolic Computation, v.10 n.3, p.223-236, May 1998
	Andrew W. Appel, Intensional equality ;=) for continuations, ACM SIGPLAN Notices, v.31 n.2, p.55-57, Feb. 1996
	Christian Queinnec, A library of high level control operators, ACM SIGPLAN Lisp Pointers, v.VI n.4, p.11-26, Oct.-Dec. 1993
	Olivier Danvy, On listing list prefixes, ACM SIGPLAN Lisp Pointers, v.2 n.3-4, p.42-47, January-June 1989
	Ana Lúcia De Moura , Roberto Ierusalimschy, Revisiting coroutines, ACM Transactions on Programming Languages and Systems (TOPLAS), v.31 n.2, p.1-31, February 2009
	David Herman, Functional pearl: the great escape or, how to jump the border without getting caught, ACM SIGPLAN Notices, v.42 n.9, September 2007
	Matthew Flatt , Gang Yu , Robert Bruce Findler , Matthias Felleisen, Adding delimited and composable control to a production programming environment, ACM SIGPLAN Notices, v.42 n.9, September 2007
	Hugo Herbelin , Silvia Ghilezan, An approach to call-by-name delimited continuations, ACM SIGPLAN Notices, v.43 n.1, January 2008
	Zena m. Ariola , Hugo Herbelin, Control reduction theories: The benefit of structural substitution, Journal of Functional Programming, v.18 n.3, p.373-419, May 2008
	Avik Chaudhuri , Prasad Naldurg , Sriram Rajamani, A type system for data-flow integrity on Windows Vista, ACM SIGPLAN Notices, v.43 n.12, December 2008
	Jérémy Buisson , Fabien Dagnat, Introspecting continuations in order to update active code, Proceedings of the 1st International Workshop on Hot Topics in Software Upgrades, October 20-20, 2008, Nashville, Tennessee
	Ronald Garcia , Andrew Lumsdaine , Amr Sabry, Lazy evaluation and delimited control, Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, January 21-23, 2009, Savannah, GA, USA
	Olivier Danvy , Kevin Millikin, Refunctionalization at work, Science of Computer Programming, v.74 n.8, p.534-549, June, 2009
	Małgorzata Biernacka , Dariusz Biernacki, A Context-based Approach to Proving Termination of Evaluation, Electronic Notes in Theoretical Computer Science (ENTCS), 249, p.169-192, August, 2009