Typing first-class continuations in ML

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Typing first-class continuations in ML

Full text

Pdf (1.03 MB)

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: 163 - 173

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

Bruce Duba	Rice University
Robert Harper	Carnegie Mellon University
David MacQueen	AT&T Bell Laboratories

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): 31, Citation Count: 24

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.99608 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.

	1	A. W. Appel , T. Jim, Continuation-passing, closure-passing style, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.293-302, January 11-13, 1989, Austin, Texas, United States [doi>10.1145/75277.75303]
	2	Andrew W. Appel and David MacQueen. Standard ML of New Jersey Reference Manual. (in preparation), 1990.
	3	Dominique Cl@ment, Jo~lle Despeyroux, Thierry Despeyroux, Laurent Hascoet, and Gilles Kahn. Natural semantics on the computer. Technical Report RR 416, INRIA, Sophia-Antipolis, France, June 1985.
	4	W Clinger , D P Friedman , M Wand, A scheme for a higher-level semantic algebra, Algebraic methods in semantics, Cambridge University Press, New York, NY, 1986
	5	Eric C. Cooper. An overview of the FOX project. Talk at Bell Laboratories, July 1990.
	6	R. K. Dybvig , R. Hieb, Engines from continuations, Computer Languages, v.14 n.2, p.109-123, Aug. 1989 [doi>10.1016/0096-0551(89)90018-0]
	7	Arthur Evans, Jr., PAL—a language designed for teaching programming linguistics, Proceedings of the 1968 23rd ACM national conference, p.395-403, August 27-29, 1968 [doi>10.1145/800186.810604]
	8	Matthias Felleisen. Transliterating Prolog into Scheme, Technical Report No. 182, Indiana University Computer Science Department, 1985.
	9	Matthias Felleisen, Daniel Friedman, Eugene Kohlbecker, and Bruce Duba. Reasoning with continuations. In First Symposium on Logic in Computer Science. IEEE, June 1986.
	10	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]
	11	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]
	12	Andrzej Filinski, Declarative Continuations: an Investigation of Duality in Programming Language Semantics, Category Theory and Computer Science, p.224-249, September 05-08, 1989
	13	Andrzej Filinski. Declarative continuations and categorical duality. Master's thesis, University of Copenhagen, Copenhagen, Denmark, August 1989. (DIKU Report 89/11).
	14	Daniel P. Friedman, Christopher T. Haynes, and Eugene Kohlbecker. Programming with continuations. Program Transformations and Programming Environments, edited by P. Pepper. Springer- Verlag, Heidelberg, 1985, 263-274.
	15	Timothy G. Griffin, A formulae-as-type notion of control, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.47-58, December 1989, San Francisco, California, United States [doi>10.1145/96709.96714]
	16	Christopher T Haynes , Daniel P Friedman , Mitchell Wand, Obtaining coroutines with continuations, Computer Languages, v.11 n.3-4, p.143-153, 1986 [doi>10.1016/0096-0551(86)90007-X]
	17	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]
	18	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]
	19	Christopher T. Haynes, Logic continuations, Journal of Logic Programming, v.4 n.2, p.157-176, June 1, 19876 [doi>10.1016/0743-1066(87)90016-1]
	20	J. Roger Hindley. The completeness theorem for typing )~ terms. Theoretical Computer Science, 22:127-134, 1983.
	21	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]
	22	Albert R. Meyer , Mitchell Wand, Continuation Semantics in Typed Lambda-Calculi (Summary), Proceedings of the Conference on Logic of Programs, p.219-224, June 17-19, 1985
	23	Robin Milner and Mads Tofte. Co-induction in relational semantics. Technical Report ECS-LFCS- 88-65, Laboratory for the Foundations of Computer Science, Edinburgh University, Edinburgh, October 1988.
	24	Robin Milner , Mads Tofte , Robert Harper, The definition of Standard ML, MIT Press, Cambridge, MA, 1990
	25	John C. Mitchell. Type systems for programming languages. Technical Report STAN-CS-89-1277, Stanford University, 1989.
	26	Gordon Plotkin. Lambda-definability in the full type hierarchy. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays in Comb# natory Logic, Lambda Calculus, and Formalism, pages 363-373. Academic Press, 1980.
	27	Gordon Plotkin. A structural approach to operational semantics. Technical Report DAIMI-FN-19, Computer Science Department, Aarhus University, 1981.
	28	Norman Ramsey. Concurrent programming in ML. Technical Report CS-TR-262-90, Computer Science Department, Princeton University, 1990.
	29	John H. Reppy, First-Class Synchronous Operations in Standard ML, Cornell University, Ithaca, NY, 1989
	30	John H. Reppy, Asynchronous Signals is Standard ML, Cornell University, Ithaca, NY, 1990
	31	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]
	32	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]
	33	John C. Reynolds, On the Relation between Direct and Continuation Semantics, Proceedings of the 2nd Colloquium on Automata, Languages and Programming, p.141-156, July 29-August 02, 1974
	34	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 [doi>10.1145/91556.91626]
	35	Richard Statman. Logical relations and the typed A-calculus. Information and Control, 65:85-97, 1985.
	36	Christopher Strachey and Christopher Wadsworth. A mathematical semantics for handling full jumps. Technical Report Technical Monograph PRG-11, Oxford University Computing Laboratory, 1974.
	37	Bernard Sufrin. CSP-style processes in ML. (Private communication), 1989.
	38	Gerald J. Sussman , Guy L. Steele, Jr., An Interpreter for Extended Lambda Calculus, Massachusetts Institute of Technology, Cambridge, MA, 1975
	39	C. Talcott, Rum. An intensional theory of function and control abstractions, Lecture notes in computer science on Foundations of logic and functional programming, p.3-44, June 1988, Trento, Italy
	40	Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, Edinburgh University, 1988. Available as Edinburgh University Laboratory for Foundations of Computer Science Technical Report ECS-LFCS-88-54.
	41	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]
	42	Andrew Wright and Matthias Felleisen. The nature of exceptions in polymorphic languages. Unpublished manuscript, P~ice University, 1990.

CITED BY 24

	Hayo Thielecke, An Introduction to Landin‘s “A Generalization of Jumps and Labels”, Higher-Order and Symbolic Computation, v.11 n.2, p.117-123, September 1998
	Kenichi Asai, Online partial evaluation for shift and reset, ACM SIGPLAN Notices, v.37 n.3, p.19-30, March 2002
	Andrzej Filinski, Linear continuations, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.27-38, January 19-22, 1992, Albuquerque, New Mexico, United States
	Dorai Sitaram, Handling control, ACM SIGPLAN Notices, v.28 n.6, p.147-155, June 1993
	Xavier Leroy, Polymorphism by name for references and continuations, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.220-231, March 1993, Charleston, South Carolina, United States
	David Tarditi , Peter Lee , Anurag Acharya, No assembly required: compiling standard ML to C, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.2, p.161-177, June 1992
	Robert Harper , Mark Lillibridge, Explicit polymorphism and CPS conversion, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.206-219, March 1993, Charleston, South Carolina, United States
	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
	Andrew P. Tolmach , Andrew W. Appel, Debuggable concurrency extensions for standard ML, ACM SIGPLAN Notices, v.26 n.12, p.120-131, Dec. 1991
	J. Gregory Morrisett , Andrew Tolmach, Procs and locks: a portable multiprocessing platform for standard ML of New Jersey, ACM SIGPLAN Notices, v.28 n.7, p.198-207, July 1993
	Andrzej Filinski, Representing layered monads, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.175-188, January 20-22, 1999, San Antonio, Texas, United States
	John H. Reppy, CML: A higher concurrent language, ACM SIGPLAN Notices, v.26 n.6, p.293-305, June 1991
	Hayo Thielecke, From control effects to typed continuation passing, ACM SIGPLAN Notices, v.38 n.1, p.139-149, January 2003
	Carsten Führmann , Hayo Thielecke, On the call-by-value CPS transform and its semantics, Information and Computation, v.188 n.2, p.241-283, 29 January 2004
	Philip Wadler, The essence of functional programming, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-14, January 19-22, 1992, Albuquerque, New Mexico, United States
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.26 n.6, p.278-292, June 1991
	Robert Cartwright , Mike Fagan, Soft typing, ACM SIGPLAN Notices, v.39 n.4, April 2004
	John D. Ramsdell, An operational semantics for Scheme, ACM SIGPLAN Lisp Pointers, v.V n.2, p.6-10, April-June 1992
	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
	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
	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
	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
	Olivier Danvy, Defunctionalized interpreters for programming languages, ACM SIGPLAN Notices, v.43 n.9, p.131-142, September 2008