A generalization of exceptions and control in ML-like languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A generalization of exceptions and control in ML-like languages

Full text

Pdf (1.34 MB)

Source

Functional Programming Languages and Computer Architecture archive
Proceedings of the seventh international conference on Functional programming languages and computer architecture table of contents

La Jolla, California, United States

Pages: 12 - 23

Year of Publication: 1995

ISBN:0-89791-719-7

Authors

Carl A. Gunter	University of Pennsylvania
Didier Rémy	INRIA, Rocquencourt
Jon G. Riecke	AT&T Bell Laboratories

Sponsors

IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 23, Citation Count: 25

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/224164.224173 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	Andrew W. Appel, Compiling with continuations, Cambridge University Press, New York, NY, 1992
	2	Olivier Danvy and Andrezj Filinski. Representing control: A study of the cps transformation. Mathematical Structures in Computer Science, 2(4):361-391, 1992.
	3	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 [doi>10.1145/99583.99608]
	4	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]
	5	Matthias Felleisen, On the expressive power of programming languages, Science of Computer Programming, v.17 n.1-3, p.35-75, Dec. 1991
	6	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 [doi>10.1145/174675.178047]
	7	Michael J. C. Gordon, Robin Milner, and C.P. Wadsworth. Edinburgh L CF: A Mechanical Logic of Computation, volume 78 of Lect. Notes in Computer Sci. Springer-Verlag, 1979.
	8	Robert Harper and Mark Lillibridge. ML with callcc is unsound, July 1991. Message sent to the."sml" mailing list.
	9	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
	10	My Hoang, John C. Mitchell, and Ramesh Viswanathan. Standard ML-NJ weak polymorphism and imperative constructs. In Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, pages 15-25, 1993.
	11	Xavier Leroy. The Caml Light system, release 0.6 - Documentation and user's manual. INRIA, 1993. Included in the Caml Light distribution.
	12	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 [doi>10.1145/158511.158632]
	13	Robin Milner , Mads Tofte , Robert Harper, The definition of Standard ML, MIT Press, Cambridge, MA, 1990
	14	Luc Moreau , Christian Queinnec, Partial Continuations as the Difference of Continuations - A Duumvirate of Control Operators, Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming, p.182-197, September 14-16, 1994
	15	Gordon D. Piotkin. A structural approach to operational semantics. Technical Report DAiMI FN- 19, Aarhus Univ., Computer Science Dept., Denmark, 1981.
	16	Christian Queinnec, A library of high level control operators, ACM SIGPLAN Lisp Pointers, v.VI n.4, p.11-26, Oct.-Dec. 1993 [doi>10.1145/181889.181891]
	17	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 [doi>10.1145/99583.99610]
	18	Didier R~my. Extending ML type system with a sorted equational theory. Research Report 1766, Institut National de Recherche en Informatique, BP 105, F-78 153 Le Chesnay Cedex, 1992.
	19	John Hamilton Reppy, Higher-order concurrency, Cornell University, Ithaca, NY, 1992
	20	John H. Reppy, Concurrent programming in ML, Cambridge University Press, New York, NY, 1999
	21	Dorai Sitaram, Handling control, Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, p.147-155, June 21-25, 1993, Albuquerque, New Mexico, United States
	22	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]
	23	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]
	24	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]
	25	Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, Edinburgh University, 1988.
	26	Mads Tofte, Type inference for polymorphic references, Information and Computation, v.89 n.1, p.1-34, Nov. 1990 [doi>10.1016/0890-5401(90)90018-D]
	27	Andrew K. Wright. Polymorphism for imperative languages without imperative types. Technical Report COMP TR93-200, Department of Computer, Rice University, 1993.
	28	Andrew K. Wright , Matthias Felleisen, A syntactic approach to type soundness, Information and Computation, v.115 n.1, p.38-94, Nov. 15, 1994 [doi>10.1006/inco.1994.1093]

CITED BY 25

	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
	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
	Yukiyoshi Kameyama , Masahito Hasegawa, A sound and complete axiomatization of delimited continuations, ACM SIGPLAN Notices, v.38 n.9, p.177-188, September 2003
	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
	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
	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
	Vincent Balat , Roberto Di Cosmo , Marcelo Fiore, Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums, ACM SIGPLAN Notices, v.39 n.1, p.64-76, January 2004
	Gavin Bierman , Michael Hicks , Peter Sewell , Gareth Stoyle , Keith Wansbrough, Dynamic rebinding for marshalling and update, with destruct-time ?, ACM SIGPLAN Notices, v.38 n.9, p.99-110, September 2003
	Greg Pettyjohn , John Clements , Joe Marshall , Shriram Krishnamurthi , Matthias Felleisen, Continuations from generalized stack inspection, ACM SIGPLAN Notices, v.40 n.9, September 2005
	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
	Takeshi Ogasawara , Hideaki Komatsu , Toshio Nakatani, EDO: Exception-directed optimization in java, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.1, p.70-105, January 2006
	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
	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
	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
	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
	Peter Thiemann, Combinators for program generation, Journal of Functional Programming, v.9 n.5, p.483-525, September 1999
	Mark Lillibridge, Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC, Higher-Order and Symbolic Computation, v.12 n.1, p.75-104, April 1999
	Luc Moreau, A Syntactic Theory of Dynamic Binding, Higher-Order and Symbolic Computation, v.11 n.3, p.233-279, 1998
	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
	Peter Sewell , Gareth Stoyle , Michael Hicks , Gavin Bierman , Keith Wansbrough, Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction, Journal of Functional Programming, v.18 n.4, p.437-502, July 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