A dynamic extent control operator for partial continuations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A dynamic extent control operator for partial continuations

Full text

Pdf (930 KB)

Source

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

Orlando, Florida, United States

Pages: 174 - 184

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

Christian Queinnec	École Polytechnique & INRIA-Rocquencourt and LIX, ÉÉcole Polytechnique, 91128 Palaiseau Cedex, France
Bernard Serpette	École Polytechnique & INRIA-Rocquencourt and LIX, Ecole Polytechnique, 91128 Palaiseau Cedex, France

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): 21, Citation Count: 13

Additional Information:

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/99583.99610 What is a DOI?

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.

	Clinger 88	Will Clinger , Anne Hartheimer , Eric Ost, Implementation strategies for continuations, Proceedings of the 1988 ACM conference on LISP and functional programming, p.124-131, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62692]
	Danvy 87	O. Danvy, Memory allocation and higher-order functions, Papers of the Symposium on Interpreters and interpretive techniques, p.241-252, June 24-26, 1987, St. Paul, Minnesota, United States
	Danvy & Filinski 89	Olivier Danvy, Andrzej Filinski, A Functional Abstraction of Typed Contexts, DIKU report 89/12, DIKU, University of Copenhagen, Denmark, August 1989.
	Danvy & Filinski 90	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 [doi>10.1145/91556.91622]
	Felleisen & Wand & Friedman & Duba 88	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 [doi>10.1145/62678.62684]
	Felleisen 88	M. Felleisen, The theory and practice of first-class prompts, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.180-190, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73576]
	Friedman & Wand 84	Daniel P. Friedman , Mitchell Wand, Reification: Reflection without metaphysics, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.348-355, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802051]
	Gabriel 89	Richard P. Gabriel, Using CLOS-like Concepts in a Prototyping System, Common Lisp Object System Workshop, OOPSLA '89, October 1989.
	Hanson 90	Chris Hanson, Efficient stack allocation for tail-recursive languages, Proceedings of the 1990 ACM conference on LISP and functional programming, p.106-118, June 27-29, 1990, Nice, France [doi>10.1145/91556.91603]
	Haynes & Friedman 87a	Christopher T. Haynes , Daniel P. Friedman, Abstracting timed preemption with engines, Computer Languages, v.12 n.2, p.109-121, Aug. 1987 [doi>10.1016/0096-0551(87)90003-8]
	Haynes & Friedman 87b	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]
	Hieb & Dybvig & Bruggeman 90	R. Hieb , R. Kent Dybvig , Carl Bruggeman, Representing control in the presence of first-class continuations, Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, p.66-77, June 1990, White Plains, New York, United States
	Hieb & Dybvig 90b	R. Hieb , R. Kent Dybvig, Continuations and concurrency, Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming, p.128-136, March 14-16, 1990, Seattle, Washington, United States
	Johnson 87	G. F. Johnson, GL—a denotational testbed with continuations and partial continuations as first-class objects, Papers of the Symposium on Interpreters and interpretive techniques, p.165-176, June 24-26, 1987, St. Paul, Minnesota, United States
	Johnson & Duggan 88	G. F. Johnson , D. Duggan, Stores and partial continuations as first-class objects in a language and its environment, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.158-168, January 10-13, 1988, San Diego, California, United States [doi>10.1145/73560.73574]
	Rees & Clinger 86	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]
	Saint-James 84	Emmanuel Saint-James, Recursion is more efficient than iteration, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.228-234, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802039]
	Schmidt 86	David A. Schmidt, Denotational semantics: a methodology for language development, William C. Brown Publishers, Dubuque, IA, 1986
	Sitaram & Felleisen 90	Dorai Staram , Matthias Felleisen, Control delimiters and their hierarchies, Lisp and Symbolic Computation, v.3 n.1, p.67-99, Jan. 1990 [doi>10.1007/BF01806126]
	Steele 90	Guy L. Steele, Jr., Common LISP: the language (2nd ed.), Digital Press, Newton, MA, 1990
	Stoy 77	Joseph E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge, MA, 1977
	Wand 80	Mitchell Wand, Continuation-based multiprocessing, Proceedings of the 1980 ACM conference on LISP and functional programming, p.19-28, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802786]

CITED BY 13

	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
	Dorai Sitaram, Handling control, ACM SIGPLAN Notices, v.28 n.6, p.147-155, June 1993
	Olivier Danvy , Julia L. Lawall, Back to direct style II: first-class continuations, ACM SIGPLAN Lisp Pointers, v.V n.1, p.299-310, Jan. 1992
	Yukiyoshi Kameyama , Masahito Hasegawa, A sound and complete axiomatization of delimited continuations, ACM SIGPLAN Notices, v.38 n.9, p.177-188, September 2003
	Luc Moreau , Daniel Ribbens, Sound rules for parallel evaluation of a functional language callcc, Proceedings of the conference on Functional programming languages and computer architecture, p.125-135, June 09-11, 1993, Copenhagen, Denmark
	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
	Chung-Chieh Shan, A static simulation of dynamic delimited control, Higher-Order and Symbolic Computation, v.20 n.4, p.371-401, December 2007
	Sanjeev Kumar , Carl Bruggeman , R. Kent Dybvig, Threads Yield Continuations, Lisp and Symbolic Computation, v.10 n.3, p.223-236, May 1998
	Christian Queinnec, A library of high level control operators, ACM SIGPLAN Lisp Pointers, v.VI n.4, p.11-26, Oct.-Dec. 1993
	Luc Moreau, A Syntactic Theory of Dynamic Binding, Higher-Order and Symbolic Computation, v.11 n.3, p.233-279, 1998
	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
	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