×

The marriage of effects and monads. (English) Zbl 1370.68050

Berman, A. Michael (ed.), Proceedings of the 2nd ACM SIGPLAN international conference on functional programming, ICFP ’97, Amsterdam, Netherlands, June 9–11, 1997. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-918-1). ACM SIGPLAN Notices 32, No. 8, 63-74 (1997).

MSC:

68N18 Functional programming and lambda calculus
68Q55 Semantics in the theory of computing
Full Text: DOI

References:

[1] N. Benton, A. Kennedy, and G. Russell, Compiling Standard ML to Java Bytecodes, A CM 3’rd Inter. national Conference on Functional Programming, Baltimore, September 1998. 10.1145/289423.289435
[2] V. Breazu-Tannen, T. Coquand, C. A. Gunter, and A. Scedrov, Inheritance as explicit coercion, Information and Computation, 93(1):172-221, 1991. Reprinted in C. A. Gunter and J. C. Mitchell, editors, Theoretical aspects of object-oriented programming, MIT Press, 1994. · Zbl 0799.68129
[3] D. K. Gifford and J. M. Lucassen, Integrating functional and imperative programming, A CM Conference on Lisp and Functional Programming, Cambridge, Massachusetts, August 1986. 10.1145/319838.319848
[4] D.K. Gifford, P. Jouvelot, J. M. Lucassen, and M. A. Sheldon, FX-87 Reference Manual, Technical report MIT/LCS/TR-407, MiT Laboratory for Computer Science, September 1987.
[5] James Gosling, Bill Joy, and Guy Steele, The Java Language Specification, Java Series, Sun Microsystems, 1996. · Zbl 0865.68001
[6] J. Hatcliff and O. Danvy, A generic account of continuation-passing styles, A CM Symposium on Principles of Programming Languages, Portland, Oregon, January 1994. 10.1145/174675.178053
[7] P. Jouvelot and D. K. Gifford, Reasoning about continuations with control effects, Technical report MIT/LCS/TM-378, MIT Laboratory for Computer Science, January 1989.
[8] M. P. Jones, Functional programming with overloading and higher-order polymorphism, in J. Jeuring and E. Meijer, editors, Advanced Functional Programming, LNCS 925, Springer Verlag, 1995.
[9] J. Launchbury and S. L. Peyton Jones, Lazy functional state threads, A CM Conference on Programming Language Design and Implementation, Orlando, Florida, 1994. 10.1145/178243.178246
[10] J. M. Lucassen, Types and effects, towards the integration of functional and imperative programming, Ph.D. Thesis, Technical report MIT/LCS/TR-408, MIT Laboratory for Computer Science, August 1987.
[11] R. Milner, A theory for type polymorphism in prog-ramming, Journal of Computer and Systems Science, 17:348-375, 1978. · Zbl 0388.68003
[12] J. C. Mitchell, Type inference with simple subtypes, Journal of Functional Programming, 1(3):245- 286, 1991. · Zbl 0941.68541
[13] J. C. Mitchell, Foundations for programming languages, MIT Press, 1996.
[14] R. Milner, M. Torte, and R. Harper, The Definition of Standard ML, MiT Press, 1990.
[15] R. Milner, M. Torte, R. Harper, and D. Mac- Queen, The Definition of Standard ML (Revised), MIT Press, 1997.
[16] E. Moggi, Computational lambda calculus and monads, IEEE Symposium on Logic in Computer Sci. ence, Asilomar, California, June 1989. · Zbl 0716.03007
[17] E. Moggi, Notions of computation and monads, Information and Computation, 93(1), 1991. 10.1016/0890-5401(91)90052-4
[18] J. Peterson and K. Hammond, editors, Haskell 1.4, a non-strict, purely functional language, Technical report, Yale University, April 1997.
[19] G. Plotkin, Call-by-name, call-by-value, and the A-calculus, Theoretical Computer Science, 1:125-159, 1975. · Zbl 0325.68006
[20] S. L. Peyton Jones and P. Wadler, Imperative functional programming, A CM Symposium on Principles of Programming Languages, Charleston, South Carolina, January 1993. 10.1145/158511.158524
[21] A reflection on call-by-value. Amr Sabry and Philip Wadler. A CM 2 ansactions on Programming Languages and Systems, 19(6):916-941, November 1997. (An earlier version appeared in 1 ’st A CM International Conference on Functional Programming, Philadelphia, May 1996.) 10.1145/267959.269968
[22] J.-P. Talpin and P. Jouvelot, Polymorphic type, region, and effect inference, Journal of Functional Programming, 2(3):245-271, July 1992. · Zbl 0817.68099
[23] J.-P. Talpin and P. Jouvelot, The type and effect discipline, Information and Computation, 111(2):245- 296, 1994. 10.1006/inco.1994.1046 · Zbl 0806.68017
[24] M. Torte, Operational semantics and polymorphic type inference, PhD Thesis, University of Edinburgh, 1987.
[25] M. Tofte and L. Birkedal, A region inference algorithm, 7 ansactions on Programming Languages and Systems, November 1998 (to appear). 10.1145/291891.291894
[26] A. Tolmach, Optimizing ML using a hierarchy of monadic yypes Workshop on Types in Compilation, Kyoto, March 1998.
[27] P. Wadler, Comprehending monads. A CM Conference on Lisp and Functional Programming, Nice, France, June 1990. 10.1145/91556.91592
[28] P. Wadler, The essence of functional programming (Invited talk), A CM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, January 1992. 10.1145/143165.143169
[29] P. Wadler, Monads for functional programming, in M. Broy, editor, Program Design Calculi, NATO ASI Series, Springer Verlag, 1993. Also in J. Jeuring and E. Meijer, editors, Advanced Functional Programming, LNCS 925, Springer Verlag, 1995.
[30] P. Wadler, How to declare an imperative (Invited talk), International Logic Programming Symposium, Portland, Oregon, MiT Press, December 1995.
[31] A. Wright and M. Felleisen, A syntactic approach to type soundness, Information and Computation, 115(1):38-94, November 1994. 10.1006/inco.1994.1093 · Zbl 0938.68559
[32] A. Wright, Typing references by effect inference, \(th European Symposium on Programming, Rennes, France, February 1992, Springer-Verlang LNCS 582\)
[33] A. Wright, Simple imperative polymorphism, Lisp and Symbolic Computation, 8:343-355, 1995. 10.1007/BF01018828
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.