Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads

Electronic Notes in Theoretical Computer Science

Volumn 33, Issue , 2000, Pages 230-260

  Lenisa, Marina ^a   Power, John ^b   Watanabe, Hiroshi ^c  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

^c ELECTROTECHNICAL LABORATORY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATA ACQUISITION; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; SET THEORY; THEOREM PROVING;

CO-CONSTRUCTION; COITERATION; ENDOFUNCTORS; NATURAL TRANSFORMATIONS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 18944387191     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80350-0     Document Type: Conference Paper

References (22)

1. Aczel P. Non-well-founded sets, CSLI Lecture Notes 14, Stanford. 1988
2. P. Aczel and N. Mendler, A Final Coalgebra Theorem, Proc. CTCS'89, Lecture Notes in Comp Science 389, D. Pitt et al (eds.) Springer-Verlag (1989), 357-365
3. A. Corradini, M. Grosse-Rhode and R. Heckel, Structured Transition Systems as Lax Coalgebras, Proc. first Workshop of CMCS'98, Electric Notes in Theoretical Computer Science, Vol. 11 (1998), http://www.elsevier.nl/locate/ entcs/volumell.html
4. Freyd P., Scedrov A. Categories, Allegories, North-Holland, Amsterdam. 1990
5. H. Geuvers, Inductive and Coinductive types with Iteration and Recursion, Proc. 1992 Workshop on Types for Proofs and Programs, Bastad, Sweden, eds. B. Nordstrom, K. Petersson and G. Plotkin (1992), 183-207
6. Honsell F., Lenisa M. Coinductive Characterizations of Applicative Structures, Math. Struct, in Comp. Science. 9:1999;403-435
7. Howe D. Proving congruence of bisimulation in functional programming languages. Inf. and Comp. 124:(2):1996;103-112
8. Johnstone P.T. Adjoint lifting theorems for categories of algebras. Bull. London Math. Soc. 7:1975;294-297
9. Kelly G.M. A Unified Treatment Of Transfinite Constructions For Free Algebras, Free Monoids, Colimits, Associated Sheaves, And So On. Bull. Austral. Math. Soc. vol. 22:1980;1-83
10. Kelly G.M., Street R. Review of the elements of 2-categories, Sydney Category Seminar, Lecture Notes in Mathematics 420. 1974;75-103
11. Lassen S. Relational Reasoning About Contexts, Higher Order Operational Techniques in Semantics. Gordon A., Pitts A. 1996;Cambridge University Press
12. Lenisa M. Themes in Final Semantics. Ph.D. Thesis. TD-6/98:1998;. Dipartimento di Informatica, Università di Pisa, Italy
13. M. Lenisa, From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems, Proc. CMCS'99, Electric Notes in Theoretical Computer Science, Vol.19 (1999), http://www.elseier.nl/locate/entcs/volume19. html
14. Milner R. Calculi for synchrony and asynchrony, Theoretical Computer Science. 25:1983;267-310
15. Milner R., Parrow J., Walker D. A calculus of mobile processes. Inf. and Comp. 100:1992;1-77
16. Power J., Turi D. A Coalgebraic Foundation for Linear Time Semantics, Proc. CTCS'99. Electric Notes in Theoretical Computer Science. vol.24:1999
17. J. Power and H. Watanabe, Distributivity for a monad and a comonad, Proc. second Workshop of CMCS'99, Electric Notes in Theoretical Computer Science, Vol. 19 (1999), http://www.elsevier.nl/locate/entcs/volume19.html
18. J. Power and H. Watanabe, Combining a monad and a comonad, ETL Technical Report TR-99-33 (submitted to TCS)
19. Street R. The formal theory of monads, J. Pure Appl. Algebra. 2:1972;149-168
20. J. Rutten and D. Turi, Initial algebra and final coalgebra semantics for concurrency, Proc. REX workshop A Decade of Concurrency - Reflections and Perspectives, Lecture Notes in Comp Science 803, J. de Bakker et al (eds.) Springer-Verlag (1994), 530-582
21. Sangiorgi D. On the bisimulation proof method. Math. Struct In Comp. Science. 98:(8):1998;447-478
22. Turi D., Plotkin G. Towards a mathematical operational semantics. Proc. LICS. 97:1997;280-291