Rolling your own mutable ADT—a connection between linear types and monads

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Rolling your own mutable ADT—a connection between linear types and monads

Full text

Pdf (831 KB)

Source

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

Paris, France

Pages: 54 - 66

Year of Publication: 1997

ISBN:0-89791-853-3

Authors

Chih-Ping Chen	Yale University, Department of Computer Science, New Haven, CT
Paul Hudak	Yale University, Department of Computer Science, New Haven, CT

Sponsors

L'Ecole des Mines de Paris : L'Ecole des Mines de Paris
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Ctr Natl de la Recherche Sci :
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 28, Citation Count: 8

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/263699.263708 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 , 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]
	2	Erik Barendsen , Sjaak Smetsers, Conventional and Uniqueness Typing in Graph Rewrite Systems, Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, p.41-51, December 15-17, 1993
	3	Andrzej Filinski, Declarative Continuations: an Investigation of Duality in Programming Language Semantics, Category Theory and Computer Science, p.224-249, September 05-08, 1989
	4	J. Guzm#n and P. Hudak. Single-threaded polymorplfic laanbda calclflus. In Proc. Symposium on Logic irt Computer Science, pages 333-343. IEEE, June 1990.
	5	Juan Carlos Guzman, On expressing the mutation of state in a functional programming language, Yale University, New Haven, CT, 1993
	6	S. Hohnstrom. A linear fimctiomfl lmlguagc, in Proc. the Workshop on the Implementation of Lazy Fanctio'nal Languages, PMG Report 53, pages 13- 32, 1988.
	7	P. Hudak. Mutable abstract datatypes - or- how to have your state and munge it too. Reseaxch Rep()rt YALEU/DCS/R.R.-914, YMe University, Department of Coxnputer S(:iencc, De(:ember 1992.
	8	Paul Hudak , Simon Peyton Jones , Philip Wadler , Brian Boutel , Jon Fairbairn , Joseph Fasel , María M. Guzmán , Kevin Hammond , John Hughes , Thomas Johnsson , Dick Kieburtz , Rishiyur Nikhil , Will Partain , John Peterson, Report on the programming language Haskell: a non-strict, purely functional language version 1.2, ACM SIGPLAN Notices, v.27 n.5, p.1-164, May 1992 [doi>10.1145/130697.130699]
	9	Y. Lafont, The linear abstract machine, Theoretical Computer Science, v.59 n.1-2, p.157-180, July 1988 [doi>10.1016/0304-3975(88)90100-4]
	10	John Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.144-154, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158618]
	11	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
	12	Sheng Liang , Paul Hudak, Modular Denotational Semantics for Compiler Construction, Proceedings of the 6th European Symposium on Programming Languages and Systems, p.219-234, April 22-24, 1996
	13	E. Moggi, Computational lambda-calculus and monads, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.14-23, June 1989, Pacific Grove, California, United States
	14	Greg Morrisett , Matthias Felleisen , Robert Harper, Abstract models of memory management, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.66-77, June 26-28, 1995, La Jolla, California, United States [doi>10.1145/224164.224182]
	15	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]
	16	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]
	17	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]
	18	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]
	19	P. Wadler. Linear types (zm change the world! hi IFIP TC 2 Worki'n9 Conference on P#vgramming Concepts and Methods, Sea of Galilee, IsreM, April 1990. IFIP.
	20	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]
	21	C.P. Wadsworth. Semantics and Pragmatics of t, he Lambda Calculus. PhD thesis, Oxford University, 1971.

CITED BY 8

	Jonathan Sobel , Daniel P. Friedman, Recycling continuations, ACM SIGPLAN Notices, v.34 n.1, p.251-260, Jan. 1999
	Zena M. Ariola , Amr Sabry, Correctness of monadic state: an imperative call-by-need calculus, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.62-74, January 19-21, 1998, San Diego, California, United States
	Philip Wadler, How to declare an imperative, ACM Computing Surveys (CSUR), v.29 n.3, p.240-263, Sept. 1997
	Martin Odersky, Programming with variable functions, ACM SIGPLAN Notices, v.34 n.1, p.105-116, Jan. 1999
	Martin Hofmann, A type system for bounded space and functional in-place update, Nordic Journal of Computing, v.7 n.4, p.258-289, Winter 2000
	Olin Shivers , Matthew Might, Continuations and transducer composition, ACM SIGPLAN Notices, v.41 n.6, June 2006
	Paul Graunke, Verified Safety and Information Flow of a Block Device, Electronic Notes in Theoretical Computer Science (ENTCS), 217, p.187-202, July, 2008
	Arthur Charguéraud , François Pottier, Functional translation of a calculus of capabilities, ACM SIGPLAN Notices, v.43 n.9, September 2008