Monads and Adjunctions for Global Exceptions

Electronic Notes in Theoretical Computer Science

Volumn 158, Issue 1, 2006, Pages 261-287

  Levy, Paul Blain ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

adjunction; Beck's theorem; call by push value; coalgebra; comonad; exception handling; monad

Indexed keywords

COMPUTER SCIENCE; EQUALIZERS; NUMERICAL METHODS; SEMANTICS; THEOREM PROVING;

ADJUNCTION; CALL-BY-PUSH-VALUE; COALGEBRA; COMONAD; EXCEPTION HANDLING; MONAD;

COMPUTATION THEORY;

EID: 33646141405     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.04.014     Document Type: Article

References (22)

1. Beck J.M. Triples, algebras and cohomology. Reprints in Theory and Applications of Categories 2 (2003) 1-59
2. Benton N., and Kennedy A. Exceptional syntax. Journal of Functional Programming 11 (2001) 395-410
3. Carboni A., Lack S., and Walters R.F.C. Introduction to extensive and distributive categories. J. of Pure and Applied Algebra 84 (1993) 145-158
4. Cenciarelli, P. and E. Moggi, A syntactic approach to modularity in denotational semantics, in: CTCS 1993, 1993
5. Cockett J.R.B. Introduction to distributive categories. Mathematical Structures in Computer Science 3 (1993) 277-307
6. Filinski, A., Representing layered monads, in: Proc., 26th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, 1999, pp. 175-188
7. Hyland, J.M.E., G.D. Plotkin and A.J. Power, Combining effects: Sum and tensor (2006), to appear in Theoretical Computer Science
8. Laird, J., A fully abstract game semantics of local exceptions, in: Proc. of the 16th Annual IEEE Symp. on Logic in Computer Science (2001), pp. 105-114
9. Laird J. Exceptions, continuations and macro-expressiveness. LNCS 2305 (2002)
10. Levy, P.B., Call-by-push-value: Decomposing call-by-value and call-by-name, submitted
11. Levy P.B. Call-by-push-value: a subsuming paradigm (extended abstract). In: Girard J.-Y. (Ed). Typed Lambda-Calculi and Applications. LNCS 1581 (1999)
12. Levy P.B. Possible world semantics for general storage in call-by-value. In: Bradfield J. (Ed). Proceedings, 16th CSL. LNCS 2471 (2002)
13. Levy P.B. Call-By-Push-Value. A Functional/Imperative Synthesis. Semantic Structures in Computation (2004), Springer
14. Levy P.B. Adjunction models for call-by-push-value with stacks. Theory and Applications of Categories 14 (2005) 75-110
15. Levy, P.B., Jumbo λ-calculus (2006), to appear in Proc., 33rd ICALP, in LNCS
16. Levy P.B., Power A.J., and Thielecke H. Modelling environments in call-by-value programming languages. Inf. and Comp. 185 (2003) 182-210
17. Mac Lane S. Categories for the Working Mathematician. Graduate Texts in Mathematics 5 (1971), Springer, New York ix+262 pp
18. Moggi E. Computational lambda-calculus and monads. LICS'89, Proc. 4th Ann. Symp. on Logic in Comp. Sci. (1989), IEEE 14-23
19. Moggi E. Notions of computation and monads. Inf. and Comp. 93 (1991)
20. Plotkin G., and Power J. Adequacy for algebraic effects. LNCS 2030 (2001)
21. Plotkin G., and Power J. Notions of computation determine monads. Proc., Foundations of Software Sci. and Comp. Struct., 2002. LNCS 2303 (2002)
22. Plotkin G.D., and Power A.J. Algebraic operations and generic effects. Applied Categorical Structures 11 (2003) 69-94