Pseudo-commutative monads

Electronic Notes in Theoretical Computer Science

Volumn 45, Issue , 2001, Pages 205-216

  Hyland, Martin ^a   Power, John ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SCIENCE; MAPPING; MATHEMATICAL MODELS; THEOREM PROVING;

ALGEBRAIC STRUCTURE; AXIOMS; EQUIFIERS; PSEUDO-COMMUTATIVE MONADS;

COMPUTATION THEORY;

EID: 9944262222     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80963-0     Document Type: Conference Paper

References (12)

1. Abramsky S. Retracing some paths in process algebra. "Proc. CONCUR 96," Lect. Notes in Computer Science 1119:1996;1-17
2. Blackwell R., Kelly G.M., Power A.J. Two-dimensional monad theory. J. Pure Appl. Algebra. 59:1989;1-41
3. Eilenberg S., and G.M. Kelly, Closed categories, "Proc. Conference on Categorical Algebra (La Jolla 1965)," Springer-Verlag (1966).
4. Fiore M., Plotkin G.D. An axiomatisation of computationally adequate domain-theoretic models of FPC. Proc. LICS. 94:1994;92-102
5. Fiore M., Plotkin G.D., Power A.J. Cuboidal sets in axiomatic domain theory. Proc. LICS. 97:1997;268-279
6. Hyland M., and A.J. Power, Pseudo-commutative monads and pseudo-closed 2-categories, J. Pure Appl. Algebra (to appear).
7. Kelly G.M. Coherence theorems for lax algebras and for distributive laws. Lecture Notes in Mathematics. 420:1974;281-375 Springer-Verlag
8. Kock A. Closed categories generated by commutative monads. J. Austral. Math Soc. 12:1971;405-424
9. Milner R. Calculi for interaction. Acta Informatica. 33:1996;707-737
10. Moggi E. Notions of computation and monads. Information and Computation. 93:1991;55-92
11. O'Hearn, P.W., and D.J. Pym, The logic of bunched implications, Bull. Symbolic Logic (to appear)
12. Power A.J., Robinson E.P. Premonoidal categories and notions of computation. Math. Struct. in Comp. Science. 7:1997;453-468