Monads for functional programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 925, Issue , 1995, Pages 24-52

  Wadler, Philip ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CASE-STUDIES; DATA TYPE; EXCEPTION HANDLING; FUNCTIONAL PROGRAMS; GLOBAL STATE; IN-PLACE UPDATE; NON-DETERMINISM;

FUNCTIONAL PROGRAMMING;

EID: 84955607329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59451-5_2     Document Type: Conference Paper

References (22)

1. S. Abramsky and C. Hankin, Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987.
2. A. Bloss, Update analysis and the efficient implementation of functional aggregates. In 4 'th Symposium on Functional Programming Languages and Computer Architecture, ACM, London, September 1989.
3. R. Bird and P. Wadler, Introduction to Functional Programming. Prentice Hall, 1987.
4. P. Hudak, S. Peyton Jones and P. Wadler, editors, Report on the Programming Language HaskeU: Version 1.1. Technical report, Yale University and Glasgow University, August 1991.
5. J.-Y. Girard, Linear logic. Theoretical Computer Science, 50:1-102, 1987.
6. J. Guzmán and P. Hudak, Single-threaded polymorphic lambda calculus. In IEEE Symposium on Logic in Computer Science, Philadelphia, June 1990.
7. P. Hudak, A semantic model of reference counting and its abstraction (detailed summary). In ACM Conference on Lisp and Functional Programming, pp. 351-363, Cambridge, Massachusetts, August 1986.
8. P. Hudak, Continuation-based mutable abstract data types, or how to have your state and munge it too. Technical report YALEU/DCS/RR-914, Department of Computer Science, Yale University, July 1992.
9. D. King and P. Wadler, Combining monads. In Glasgow Workshop on Functional Programming, Ayr, July 1992. Workshops in Computing Series, Springer Verlag, to appear. 10. S. Mac Lane, Categories for the Working Mathematician, Springer-Verlag, 1971.
10. R. Milner, M. Torte, and R. Harper, The definition of Standard ML. MIT Press, 1990.
11. E. Moggi, Computational lambda-calculus and monads. In Symposium on Logic in Computer Science, Asilomar, California; IEEE, June 1989. (A longer version is available as a technical report from the University of Edinburgh.)
12. E. Moggi, An abstract view of programming languges. Course notes, University of Edinburgh.
13. L. C. Paulson, ML for the Working Programmer. Cambridge University Press, 1991.
14. S. L. Peyton Jones and P. Wadler, Imperative functional programming. In 20'th Sym. posium on Principles of Programming Languages, Charleston, South Carolina; ACM, January 1993.
15. G. Plotkin, Call-by-name, call-by-value, and the X-calculus. Theoretical Computer Science, 1:125-159, 1975.
16. J. Rees and W. Clinger (eds.), The revised 3 report on the algorithmic language Scheme. ACM SIGPLAN Notices, 21(12):37-79, 1986.
17. D. Schmidt, Detecting global variables in denotational specifications. ACM Trans. on Programming Languages and Systems, 7:299-310, 1985.
18. V. Swarup, U. S. Reddy, and E. Ireland, Assignments for applicative languages. In Conference on Functional Programming Languages and Computer Architecture, Cambridge, Massachusetts; LNCS 523, Springer Verlag, August 1991.
19. D. A. Turner, An overview of Miranda. In D. A. Turner, editor, Research Topics in Functional Programming. Addison Wesley, 1990.
20. P. Wadler, Comprehending monads. In Conference on Lisp and Functional Programming, Nice, France; ACM, June 1990.
21. P. Wadler, Is there a use for linear logic? Conference on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), New Haven, Connecticut; ACM, June 1991.
22. P. Wadler, The essence of functional programming (invited talk). In 19'th Symposium on Principles of Programming Languages, Albuquerque, New Mexico; ACM, January 1992.