Constraining control

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Constraining control

Full text

Pdf (830 KB)

Source

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

New Orleans, Louisiana, United States

Pages: 245 - 254

Year of Publication: 1985

ISBN:0-89791-147-4

Authors

Daniel P. Friedman	Computer Science Department, Indiana University, Lindley Hall 101, Bloomington, IN
Christopher T. Haynes	Computer Science Department, Indiana University, Lindley Hall 101, Bloomington, IN

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 27, Citation Count: 20

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

ABSTRACT

Continuations, when available as first-class objects, provide a general control abstraction in programming languages. They liberate the programmer from specific control structures, increasing programming language extensibility. Such continuations may be extended by embedding them in functional objects. This technique is first used to restore a fluid environment when a continuation object is invoked. We then consider techniques for constraining the power of continuations in the interest of security and efficiency. Domain mechanisms, which create dynamic barriers for enclosing control, are implemented using fluids. Domains are then used to implement an unwind-protect facility in the presence of first-class continuations. Finally, we demonstrate two mechanisms, wind-unwind and dynamic-wind, that generalize unwind-protect.

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	Henry G. Baker, Jr., Shallow binding in Lisp 1.5, Communications of the ACM, v.21 n.7, p.565-569, July 1978 [doi>10.1145/359545.359566]
	2	[2] Burge, William H., Recursive Programming Techniques , Addison-Wealey, Reading MA, 1975.
	3	[3] Friedman, Daniel P., Christopher T. Haynes, and Eugene Kohlbecker, "Programming with Continuations," Program Transformation and Programming Environments , ed. P. Pepper, Springer-Verlag, 1984, pages 263-274.
	4	[4] Friedman, Daniel P., Christopher T. Haynes, Eugene Kohlbecker, and Mitchell Wand. "The Scheme 84 Reference Manual," Indiana University Computer Science Department Technical Report No. 153, May, 1984.
	5	[5] Hanson, Chris, and John Lamping, "Dynamic Binding in Scheme," unpublished manuscript, 1984.
	6	Christopher T. Haynes , Daniel P. Friedman, Engines build process abstractions, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.18-24, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802018]
	7	Christopher T. Haynes , Daniel P. Friedman , Mitchell Wand, Continuations and coroutines, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.293-298, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802046]
	8	[8] Hewitt, Carl, "Viewing control structures as patterns of passing messages," Artif. Intell. 8, 1977, pages 323- 363. Also in Winston and Brown [ed], Artificial Intel-Ligence: an MIT Perspective, MIT Press, 1979.
	9	P. J. Landin, Correspondence between ALGOL 60 and Church's Lambda-notation: part I, Communications of the ACM, v.8 n.2, p.89-101, Feb. 1965 [doi>10.1145/363744.363749]
	10	Jonathan A. Rees , Norman I. Adams IV, T: a dialect of Lisp or LAMBDA: The ultimate software tool, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.114-122, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802142]
	11	John C. Reynolds, G/EDANKEN—a simple typeless language based on the principle of completeness and the reference concept, Communications of the ACM, v.13 n.5, p.308-319, May 1970 [doi>10.1145/362349.362364]
	12	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]
	13	Guy Lewis Steele, Jr., Macaroni is better than spaghetti, Proceedings of the 1977 symposium on Artificial intelligence and programming languages, p.60-66, August 15-17, 1977
	14	Guy L. Steele, Jr., Common LISP: the language, Digital Press, Newton, MA, 1984
	15	[15] Sussman, Gerald Jay, and Drew Vincent McDermott, "From PLANNER to CONNIVER-A genetic approach", Proceedings of Joint Computer Conference 41, part II, AFIPS press, NJ, (1973) pages 1171-1179.
	16	Gerald J. Sussman , Guy L. Steele, Jr., An Interpreter for Extended Lambda Calculus, Massachusetts Institute of Technology, Cambridge, MA, 1975
	17	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 20

	Paul T. Graunke , Shriram Krishnamurthi, Advanced control flows for flexible graphical user interfaces: or, growing GUIs on trees or, bookmarking GUIs, Proceedings of the 24th International Conference on Software Engineering, May 19-25, 2002, Orlando, Florida
	P. Jouvelot , D. K. Gifford, Reasoning about continuations with control effects, ACM SIGPLAN Notices, v.24 n.7, p.218-226, July 1989
	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
	Nicholas Haines , Darrell Kindred , J. Gregory Morrisett , Scott M. Nettles , Jeannette M. Wing, Composing first-class transactions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.6, p.1719-1736, Nov. 1994
	David Kranz , Norman Adams , Richard Kelsey , Jonathan Rees , Paul Hudak , James Philbin, ORBIT: an optimizing compiler for scheme, ACM SIGPLAN Notices, v.21 n.7, p.219-233, July 1986
	Paul Hudak , Lauren Smith, Para-functional programming: a paradigm for programming multiprocessor systems, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.243-254, January 01, 1986, St. Petersburg Beach, Florida
	David Kranz , Richard Kelsey , Jonathan Rees , Paul Hudak , James Philbin , Norman Adams, Orbit: an optimizing compiler for scheme, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Chung-Chieh Shan, A static simulation of dynamic delimited control, Higher-Order and Symbolic Computation, v.20 n.4, p.371-401, December 2007
	Kristian Støvring , Soren B. Lassen, A complete, co-inductive syntactic theory of sequential control and state, ACM SIGPLAN Notices, v.42 n.1, January 2007
	Ozan S. Yigit, Readings in scheme, ACM SIGPLAN Lisp Pointers, v.2 n.1, p.56-61, July-August-September 1988
	Oleg Kiselyov , Chung-chieh Shan , Amr Sabry, Delimited dynamic binding, ACM SIGPLAN Notices, v.41 n.9, September 2006
	Mitchell Wand, Embedding type structure in semantics, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.1-6, January 14-16, 1985, New Orleans, Louisiana, United States
	H. Abelson , R. K. Dybvig , C. T. Haynes , G. J. Rozas , N. I. Adams, IV , D. P. Friedman , E. Kohlbecker , G. L. Steele, Jr. , D. H. Bartley , R. Halstead , D. Oxley , G. J. Sussman , G. Brooks , C. Hanson , K. M. Pitman , M. Wand , William Clinger , Jonathan Rees, Revised report on the algorithmic language scheme, ACM SIGPLAN Lisp Pointers, v.IV n.3, p.1-55, July, 1991
	J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986
	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
	O. Danvy, Memory allocation and higher-order functions, ACM SIGPLAN Notices, v.22 n.7, p.241-252, July 1987
	Josh Berdine , Peter O'hearn , Uday Reddy , Hayo Thielecke, Linear Continuation-Passing, Higher-Order and Symbolic Computation, v.15 n.2-3, p.181-208, September 2002
	Hayo Thielecke, Using a Continuation Twice and Its Implications for the Expressive Power of call/cc, Higher-Order and Symbolic Computation, v.12 n.1, p.47-73, April 1999
	William Clinger, The scheme environment: continuations, ACM SIGPLAN Lisp Pointers, v.1 n.2, p.22-28, June-July 1987
	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