Monads in action

ACM SIGPLAN Notices

Volumn 45, Issue 1, 2010, Pages 483-494

  Filinski, Andrzej ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Computational effects; Modular semantics; Monads

Indexed keywords

SEMANTICS;

COMPUTATIONAL EFFECTS; FUNCTIONAL LANGUAGES; MODULAR SEMANTICS; MONADIC EFFECT; MONADS; OPERATIONAL SEMANTICS; OPERATIONAL VIEW; PURELY FUNCTIONAL;

FUNCTIONAL PROGRAMMING;

EID: 77149158496     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1707801.1706354     Document Type: Conference Paper

References (21)

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.
2. Karl Crary and Robert Harper. Syntactic logical relations for polymorphic and recursive types. Electronic Notes in Theoretical Computer Science, 172, 2007.
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.
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.
5. Andrzej Filinski. On the relations between monadic semantics. Theoretical Computer Science, 375(1-3):41-75, 2007.
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.
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 Ŕemy, and Jon G. Riecke. A generalization of exceptions and control in ML-like languages. In Functional Programming and Computer Architecture, pages 12-23, 1995.
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. 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.
11. Saunders Mac Lane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer-Verlag, 1971.
12. Eugenio M. 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.
13. Luc Moreau. A syntactic theory of dynamic binding. Higher-Order and Symbolic Computation, 11(3):233-279, 1998.
14. Peter D. Mosses. Modular structural operational semantics. Journal of Logic and Algebraic Programming, 60-61:195-228, 2004.
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 Scḧ'urmann. 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.
18. Gordon D. Plotkin and John Power. Algebraic operations and generic effects. Applied Categorical Structures, 11(1):69-94, 2003.
19. Gordon D. Plotkin and John Power. Algebraic operations and generic effects. Applied Categorical Structures, 11(1):69-94, 2003.
20. Philip Wadler. Comprehending monads. In Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 61-78, Nice, France, June 1990.
21. Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 1994