On the relations between monadic semantics

Theoretical Computer Science

Volumn 375, Issue 1-3, 2007, Pages 41-75

  Filinski, Andrzej ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Computational metalanguage; Continuations; Logical relations; Monads; Recursive types

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE;

COMPUTATIONAL METALANGUAGE; CONTINUATIONS; LOGICAL RELATIONS; MONADS; RECURSIVE TYPES;

SEMANTICS;

EID: 34047122199     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.12.027     Document Type: Article

References (37)

1. Abadi M., Banerjee A., Heintze N., and Riecke J.G. A core calculus of dependency. Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (January 1999), ACM Press, San Antonio, TX 147-160
2. Birkedal L., and Harper R. Relational interpretations of recursive types in an operational setting. Information and Computation 155 1-2 (1999) 3-63
3. Birkedal L., Møgelberg R.E., and Petersen R.L. Parametric domain-theoretic models of polymorphic intuitionistic/linear lambda calculus. Proceedings of the 21st International Conference on Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science vol. 155 (2005) 191-217
4. Olivier Danvy, Andrzej Filinski, Abstracting control, in: Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, Nice, France, June 1990, pp. 151-160
5. Matthias Felleisen, The theory and practice of first-class prompts, in: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, San Diego, California, January 1988, pp. 180-190
6. Andrzej Filinski, Representing monads, in: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, January 1994, pp. 446-457
7. Andrzej Filinski, Controlling effects, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, May 1996. Technical Report CMU-CS-96-119
8. Filinski A. Representing layered monads. Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (January 1999), ACM Press, San Antonio, Texas 175-188
9. Marcelo Fiore, Gordon D. Plotkin, An axiomatisation of computationally adequate domain theoretic models of FPC, in: Proceedings of the Ninth Symposium on Logic in Computer Science, Paris, France, 1994, pp. 92-102
10. Gunter C.A. Semantics of Programming Languages: Structures and Techniques (1992), The MIT Press
11. Kučan J. Retraction approach to CPS transform. Higher-Order and Symbolic Computation 11 2 (1998) 145-175
12. Levy P.B. Call-by-push-value: Decomposing call-by-value and call-by-name. Higher-Order and Symbolic Computation 19 4 (2006) 377-414
13. Sheng Liang, Paul Hudak, Mark Jones, Monad transformers and modular interpreters, in: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, January 1995, pp. 333-343
14. Mac Lane S. Categories for the Working Mathematician. Graduate Texts in Mathematics vol. 5 (1971), Springer-Verlag
15. Meyer A.R., and Wand M. Continuation semantics in typed lambda-calculi (summary). In: Parikh R. (Ed). Logics of Programs - Proceedings. Lecture Notes in Computer Science vol. 193 (June 1985), Brooklyn 219-224
16. Milner R., Tofte M., Harper R., and MacQueen D. The Definition of Standard ML. revised edition (1997), The MIT Press
17. Mitchell J.C. Foundations for Programming Languages (1996), The MIT Press
18. Moggi E. Computational lambda-calculus and monads. Proceedings of the Fourth Annual Symposium on Logic in Computer Science (June 1989), IEEE, Pacific Grove, CA 14-23
19. Moggi E. Notions of computation and monads. Information and Computation 93 1 (1991) 55-92
20. Mosses P.D. Modular structural operational semantics. Journal of Logic and Algebraic Programming 60-61 (2004) 195-228
21. Oles F.J. Type algebras, functor categories, and block structure. In: Nivat M., and Reynolds J.C. (Eds). Algebraic Methods in Semantics (1985), Cambridge University Press
22. Simon L. Peyton Jones, Philip Wadler, Imperative functional programming, in: Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, Charleston, South Carolina, January 1993, pp. 71-84
23. Pfenning F., and Davies R. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science 11 4 (2001) 511-540
24. Andrew M. Pitts, Evaluation logic, Technical Report 198, University of Cambridge Computer Laboratory, August 1990
25. Pitts A.M. Computational adequacy via 'mixed' inductive definitions. Mathematical Foundations of Programming Semantics. Lecture Notes in Computer Science vol. 802 (April 1993), Springer-Verlag 72-82
26. Pitts A.M. Relational properties of domains. Information and Computation 127 2 (1996) 66-90
27. Plotkin G., and Power J. Adequacy for algebraic effects. Foundations of Software Science and Computation Structures, 4th International Conference. Lecture Notes in Computer Science vol. 2030 (April 2001), Springer-Verlag, Genova, Italy 1-24
28. Plotkin G.D. LCF considered as a programming language. Theoretical Computer Science 5 3 (1977) 223-255
29. John C. Reynolds, Definitional interpreters for higher-order programming languages, in: Proceedings of 25th ACM National Conference, Boston, August 1972, pp. 717-740. Reprinted, with a foreword, in Higher-Order and Symbolic Computation, 11(4) 363-397
30. Reynolds J.C. On the relation between direct and continuation semantics. In: Loeckx J. (Ed). 2nd Colloquium on Automata, Languages and Programming. Saarbrücken, West Germany. Lecture Notes in Computer Science vol. 14 (July 1974) 141-156
31. Reynolds J.C. Types, abstraction and parametric polymorphism. In: Mason R.E.A. (Ed). Information Processing 83 (1983), IFIP 513-523
32. Dana S. Scott, Domains for denotational semantics, in: Proceedings of the 9th Colloquium on Automata, Languages and Programming, vol. 140, Aarhus, Denmark, July 1982, pp. 577-613
33. Ian Stark, Names and higher-order functions, Ph.D. Thesis, University of Cambridge, 1994
34. Tse S., and Zdancewic S. Translating dependency into parametricity. In: Fisher K. (Ed). Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming (September 2004), ACM Press, Snowbird, Utah
35. Philip Wadler, Theorems for free!, in: 4th International Conference on Functional Programming and Computer Architecture, London, UK, September 1989, pp. 347-359
36. Philip Wadler, The essence of functional programming (invited talk), in: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, January 1992, pp. 1-14
37. Winskel G. The Formal Semantics of Programming Languages: An Introduction (1993), MIT Press