An equational notion of lifting monad

Theoretical Computer Science

Volumn 294, Issue 1-2, 2003, Pages 31-60

  Bucalo, Anna ^b   Führmann, Carsten ^a   Simpson, Alex ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b NONE

Author keywords

Abstract Kleisli; Categories; Commutative strong monads; Partiality and partial categories; Premonoidal categories

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; SEMANTICS; THEOREM PROVING;

COMMUTATIVE STRONG MONAD;

COMPUTER SCIENCE;

EID: 0037441276     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00243-2     Document Type: Conference Paper

References (20)

1. Barr M., Wells C. Toposes, Triples and Theories. 1985;Springer, Berlin.
2. Bucalo A., Rosolini G. Lifting, In: Category Theory and Computer Science, Proc. CTCS '97, Lecture Notes in Computer Science. vol. 1290:1997;Springer, Berlin.
3. Cockett J.R.B., Lack S. Restriction categories I. categories of partial maps Theoret. Comput. Sci. 270:2002;223-259.
4. J.R.B. Cockett, S. Lack, Restriction categories II: partial map classification, Theoret. Comput. Sci. this Vol. (2003).
5. Fiore M.P. Axiomatic Domain Theory in Categories of Partial Maps, Distinguished Dissertation Series. 1996;Cambridge University Press, Cambridge.
6. M.P. Fiore, G.D. Plotkin, A.J. Power, Complete cuboidal sets in axiomatic domain theory, Proc. 12th Ann. Symp. on Logic in Computer Science, 1997.
7. C. Führmann, Direct models for the computational lambda-calculus, Proc. MFPS XV, Electronic Notes in Computer Science, vol. 20, 1999.
8. Hyland J.M.E. First steps in synthetic domain theory, Category Theory, Proc., Como 1990, Lecture Notes in Mathematics. vol. 1488:1990;Springer, Berlin.
9. Jacobs B.P.F. Semantics of weakening and contraction. Ann. Pure Appl. Logic. 69:1994;73-106.
10. Kock A. Strong functors and monoidal monads. Arch. Math. 23:1972;113-120.
11. Mac Lane S. Categories for the Working Mathematician, Graduate Texts in Mathematics. 2nd ed. 1998;Springer, Berlin.
12. E. Moggi, The partial lambda-calculus, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1988, Available as LFCS Report no. ECS-LFCS-88-63.
13. E. Moggi, Computational lambda-calculus and monads, Proc. 4th Ann. Symp. on Logic in Computer Science, 1989, pp. 14-23.
14. Moggi E. Notions of computation and monads. Inform. Comput. 93(1):1991.
15. Mulry P.S. Generalized Banach-Mazur functionals in the topos of recursive sets. J. Pure Appl. Algebra. 26:1982;71-83.
16. Robinson E.P., Rosolini G. Categories of partial maps. Inform. and Comput. 79:1988;95-130.
17. G. Rosolini, Continuity and effectivity in topoi, Ph.D. Thesis, University of Oxford, 1986.
18. A.K. Simpson, G.D. Plotkin, Complete axioms for categorical fixed-point operators, Proc. 15th Ann. Symp. on Logic in Computer Science, 2000, pp. 30-41.
19. P. Taylor, Geometric and higher order logic using abstract Stone duality. Theory and Applications of Categories 7 (2000) 284-338, ftp://ftp.tac.mta.ca/pub/tac/html/volumes/7/n15.
20. Winskel G. The Formal Semantics of Programming Languages. 1993;MIT Press, Cambridge, MA.