×

Monads in action. (English) Zbl 1312.68038

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’10, Madrid, Spain, January 17–23, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-479-9). 483-494 (2010).

MSC:

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

References:

[1] Robert Cartwright and Matthias Felleisen. Extensible denotational language specifications. In Masami Hagiya and John C. Mitchell, editors, Symposium on Theoretical Aspects of Computer Software, volume 789 of Lecture Notes in Computer Science, pages 244-272, Sendai, Japan, April 1994. · Zbl 0942.68544
[2] Karl Crary and Robert Harper. Syntactic logical relations for polymorphic and recursive types. Electronic Notes in Theoretical Computer Science, 172, 2007. 10.1016/j.entcs.2007.02.010 · Zbl 1277.68119
[3] Matthias Felleisen and Robert Hieb. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 103(2):235-271, September 1992. 10.1016/0304-3975(92)90014-7 · Zbl 0764.68094
[4] Andrzej Filinski. Representing layered monads. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 175-188, San Antonio, Texas, January 1999. 10.1145/292540.292557
[5] Andrzej Filinski. On the relations between monadic semantics. Theoretical Computer Science, 375(1-3):41-75, 2007. 10.1016/j.tcs.2006.12.027 · Zbl 1111.68066
[6] Andrzej Filinski and Kristian Støvring. Inductive reasoning about effectful data types. In ICFP’07: Proceedings of the 2007 ACM SIGPLAN International Conference on Functional Programming, pages 97-110. ACM Press, October 2007. 10.1145/1291151.1291168 · Zbl 1291.68143
[7] Marcelo Fiore and Gordon D. Plotkin. An axiomatisation of computationally adequate domain theoretic models of FPC. In Proceedings of the Ninth Symposium on Logic in Computer Science, pages 92-102, Paris, France, 1994.
[8] Carl A. Gunter, Didier Remy, and Jon G. Riecke. A generalization of exceptions and control in ML-like languages. In Functional Programming and Computer Architecture, pages 12-23, 1995. 10.1145/224164.224173
[9] Oleg Kiselyov, Chung chieh Shan, and Amr Sabry. Delimited dynamic binding. In ICFP’06: Proceedings of the 11th International Conference on Functional Programming, pages 26-37, 2006. 10.1145/1159803.1159808 · Zbl 1321.68128
[10] Paul Blain Levy. Call-by-push-value: Decomposing call-by-value and call-by-name. Higher-Order and Symbolic Computation, 19(4):377-414, 2006. 10.1007/s10990-006-0480-6 · Zbl 1112.68025
[11] Saunders Mac Lane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer-Verlag, 1971. · Zbl 0232.18001
[12] Eugenio Moggi. Computational lambda-calculus and monads. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 14-23, Pacific Grove, California, June 1989. IEEE. · Zbl 0716.03007
[13] Luc Moreau. A syntactic theory of dynamic binding. Higher-Order and Symbolic Computation, 11(3):233-279, 1998. 10.1023/A:1010087314987 · Zbl 0934.68038
[14] Peter D. Mosses. Modular structural operational semantics. Journal of Logic and Algebraic Programming, 60-61:195-228, 2004. · Zbl 1072.68061
[15] Frank Pfenning. Substructural operational semantics and linear destination-passing style (abstract). In Proceedings of the 2nd Asian Symposium on Programming Languages and Systems (APLAS’04), volume 3302 of Lecture Notes in Computer Science, page 196, 2004.
[16] Frank Pfenning and Carsten Schurmann. System description: Twelf - a meta-logical framework for deductive systems. In 16th International Conference on Automated Deduction, volume 1632 of Lecture Notes in Computer Science, pages 202-206, 1999.
[17] Benjamin Pierce. Types and Programming Languages. MIT Press, 2002. · Zbl 0995.68018
[18] Gordon D. Plotkin and John Power. Algebraic operations and generic effects. Applied Categorical Structures, 11(1):69-94, 2003. · Zbl 1023.18006
[19] Gordon D. Plotkin and Matija Pretnar. Handlers of algebraic effects. In 18th European Symposium on Programming, volume 5502 of Lecture Notes in Computer Science, pages 80-94, March 2009. 10.1007/978-3-642-00590-9_7 · Zbl 1234.68059
[20] Philip Wadler. Comprehending monads. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 61-78, Nice, France, June 1990. 10.1145/91556.91592
[21] Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 1994. 10.1006/inco.1994.1093 · Zbl 0938.68559
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.