Correctness of monadic state

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Correctness of monadic state: an imperative call-by-need calculus

Full text

Pdf (1.59 MB)

Source

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

San Diego, California, United States

Pages: 62 - 74

Year of Publication: 1998

ISBN:0-89791-979-3

Authors

Zena M. Ariola	Department of Computer & Information Science, University of Oregon, Eugene, OR
Amr Sabry	Department of Computer & Information Science, University of Oregon, Eugene, OR

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): 2, Downloads (12 Months): 22, Citation Count: 5

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/268946.268952 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	Zena M. Ariola , Stefan Blom, Cyclic Lambda Calculi, Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software, p.77-106, September 23-26, 1997
	2	ARIOLA, Z. M., AND BLOM, S. Lambda calculi plus letrec. Tech. Rep. CIS-TR-97-05, Dept. of Computer and Information Science, University of Oregon, 1997.
	3	Zena M. Ariola , Matthias Felleisen, The call-by-need lambda calculus, Journal of Functional Programming, v.7 n.3, p.265-301, May 1997 [doi>10.1017/S0956796897002724]
	4	Zena M. Ariola , John Maraist , Martin Odersky , Matthias Felleisen , Philip Wadler, A call-by-need lambda calculus, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.233-246, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199507]
	5	Zena M. Ariola , Jan W Klop, Lambda calculus with explicit recursion, CWI (Centre for Mathematics and Computer Science), Amsterdam, The Netherlands, 1996
	6	AUGUSTSSON, L., PaTTPa, M., AND SYNEK, n. FuItctional peaxl: On generating unique names. Journal of Functional Programming ~{, 1 (Jan. 1994), 117- 123. Original version: Splitting Infinite Sets of Unique Names by Hidden State Changes, Tech. Rep. 67, Programming Methoddogy Group, Chalmers University of Technology, 1992.
	7	E. Cartwright , M. Felleisen, The semantics of program dependence, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.13-27, June 19-23, 1989, Portland, Oregon, United States
	8	Chih-Ping Chen , Paul Hudak, Rolling your own mutable ADT—a connection between linear types and monads, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.54-66, January 15-17, 1997, Paris, France [doi>10.1145/263699.263708]
	9	Byron Cook , John Launchbury, Disposable memo functions (extended abstract), Proceedings of the second ACM SIGPLAN international conference on Functional programming, p.310, June 09-11, 1997, Amsterdam, The Netherlands
	10	~, E. Parameter-passing and the lambda calculus. Master's thesis, Dept. of Computer Science, Rice University, 1990.
	11	Erik Crank , Matthias Felleisen, Parameter-passing and the lambda calculus, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.233-244, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99616]
	12	FF~LEISEN, M., AND HmB, R. The revised report on the syntactic theories of sequential control and state. Theater. Gomput. SoL 10~ (1992), 235-271. Teeh. Rep. 89-100, Rice University.
	13	FIELD, J. A simple rewriting semantics for realistic imperative programs and its application to program analysis (preliminary report). Tech. Rep. YALE/DCS/RR- 909, Dept. of Computer Science, Yale University, 1992. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 98-107.
	14	G~, J. C., AND HUDAK, P. Single-threaded polymorphic lambda calculus. In the IEEE Symposium on Logic in Computer Science (1990), IEEE Computer Society Press, Los A}amitos, Calif., pp. 333-343.
	15	HUDAK, P. Mutable abstract datatypes -or- how to have your state and mange it too. Tech. Rep. YALEU/DCS/RR-914, Dept. of Computer Science, Yale University, December 1992. Revised May 1993.
	16	HUGHES, J. Lazy memo-functions. Tech. Rep. 21, Progtamming Methodolog~ Group, Chalmers University of Technology, 1985.
	17	LAUNGHBURY, J. Lazy imperative programming. Tech. Rep. YALEU/DCS/RR-968, Dept. of Computer Science, Yale University, 1993. ACM SIGPLAN Workshop on State in Programming Languages.
	18	John Launchbury , Simon L. Peyton Jones, Lazy functional state threads, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, p.24-35, June 20-24, 1994, Orlando, Florida, United States
	19	LAUNCI-IBUKY, J., AND PEYTON JONES, S. L. State ill HaskelL Lisp Symbol. Comput. 8 (I995), 193-341.
	20	John Launchbury , Amr Sabry, Monadic state: axiomatization and type safety, Proceedings of the second ACM SIGPLAN international conference on Functional programming, p.227-238, June 09-11, 1997, Amsterdam, The Netherlands
	21	LEVY, 3.-3. Optimal reductions in the lambda-calculus. in To H-.B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism (1980), Academic Press, pp. 159-291.
	22	Martin Odersky , Dan Rabin , Paul Hudak, Call by name, assignment, and the lambda calculus, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.43-56, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158521]
	23	Simon L. Peyton Jones , John Launchbury, Unboxed values as first class citizens in a non-strict functional language, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.636-666, June 1991, Cambridge, Massachusetts, United States
	24	Simon Peyton Jones , Mark Shields , John Launchbury , Andrew Tolmach, Bridging the gulf: a common intermediate language for ML and Haskell, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.49-61, January 19-21, 1998, San Diego, California, United States [doi>10.1145/268946.268951]
	25	PSrTOl~ JONES, S. L. The Implementation of Functional Programming Languages. International Series in Computer Science. Prentice-Hall, I987.
	26	Simon L. Peyton Jones , Philip Wadler, Imperative functional programming, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.71-84, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158524]
	27	Amr Sabry, What is a purely functional language?, Journal of Functional Programming, v.8 n.1, p.1-22, January 1998 [doi>10.1017/S0956796897002943]
	28	SABRY, A., AND FmLD, J. Reasoning abou~ explici~ and implicit representations of state. Tech. Rep. YALEU/DCS/KR-968, Dept. of Computer Science, Yale University, 1993. A OM SIGPLAN Workshop on State in Programming Languages, pages 1"/'-30.
	29	David A. Schmidt, Detecting global variables in denotational specifications, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.2, p.299-310, April 1985 [doi>10.1145/3318.3323]
	30	Peter Sestoft, Replacing function parameters by global variables, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.39-53, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99374]
	31	Vipin Swarup , Uday S. Reddy , Evan Ireland, Assignments for applicative languages, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.192-214, June 1991, Cambridge, Massachusetts, United States
	32	D. Tarditi , G. Morrisett , P. Cheng , C. Stone , R. Harper , P. Lee, TIL: a type-directed optimizing compiler for ML, Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation, p.181-192, May 21-24, 1996, Philadelphia, Pennsylvania, United States
	33	Philip Wadler, Comprehending monads, Proceedings of the 1990 ACM conference on LISP and functional programming, p.61-78, June 27-29, 1990, Nice, France [doi>10.1145/91556.91592]
	34	Philip Wadler, Is there a use for linear logic?, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.255-273, June 17-19, 1991, New Haven, Connecticut, United States
	35	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 [doi>10.1145/143165.143169]
	36	David Wakeling , Colin Runciman, Linearity and laziness, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.215-240, June 1991, Cambridge, Massachusetts, United States

CITED BY 5

	Steven E. Ganz , Amr Sabry , Walid Taha, Macros as multi-stage computations: type-safe, generative, binding macros in MacroML, ACM SIGPLAN Notices, v.36 n.10, October 2001
	Matthew Fluet , Greg Morrisett, Monadic regions, ACM SIGPLAN Notices, v.39 n.9, September 2004
	Miley Semmelroth , Amr Sabry, Monadic encapsulation in ML, ACM SIGPLAN Notices, v.34 n.9, p.8-17, Sept. 1999
	Tachio Terauchi , Alex Aiken, Witnessing side effects, ACM Transactions on Programming Languages and Systems (TOPLAS), v.30 n.3, p.1-42, May 2008
	Matthew Fluet , Greg Morrisett, Monadic regions, Journal of Functional Programming, v.16 n.4-5, p.485-545, July 2006