Monads as extension systems - No iteration is necessary

Theory and Applications of Categories

Volumn 24, Issue , 2010, Pages 84-113

  Marmolejo, F ^a   Wood, R J ^b  

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Distributive laws; Extension systems; Monads; Profunctors; Wreaths

Indexed keywords

EID: 77952896965     PISSN: 1201561X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. Jon Beck. Distributive laws. Lecture Notes in Mathematics 80, (1969), 119-140.
2. F. Borceux. Handbook of Categorical Algebra. Cambridge University Press, 1994.
3. S. Eilenberg and J. Moore, Adjoint functors and triples. Illinois J. Math. 9 (1965), 381-398.
4. Stephen Lack and Ross Street, The formal theory of monads II. Journal of pure and applied algebra 175 (2002) 234-265.
5. E. G. Manes. Algebraic Theories. Springer-Verlag, 1976.
6. Ernie Manes and Philip Mulry, Monad compositions I: general constructions and recursive distributive laws. Theory and Applications of Categories, Vol. 18, 2007, No. 7, pp 172-208.
7. F. Marmolejo, R. D. Rosebrugh and R. J. Wood, A basic distributive law. J. Pure and Appl. Algebra 168 (2002) 209-226.
8. F. Marmolejo, Doctrines whose structure forms a fully faithful adjoint string. Theory and Applications of Categories, Vol 3, No. 2, 1999, pp. 24-44.
9. R. H. Street, The formal theory of monads. J. Pure and Appl. Algebra 2 (1972) 149-168.
10. D. Varacca. Probability, nondeterminism and concurrency: two denotational models for probabilistic computation. PhD Dissertation, BRICS PhD School, 2003.