Coalgebraic coinduction in (Hyper)set-theoretic Categories

Electronic Notes in Theoretical Computer Science

Volumn 33, Issue , 2000, Pages 132-159

  Honsell, Furio ^a   Lenisa, Marina ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; DATA REDUCTION; FUNCTIONS; GRAPHIC METHODS; ITERATIVE METHODS; SEMANTICS; SET THEORY; THEOREM PROVING;

BISIMULATION; COALGEBRA; COINDUCTIVE TYPES; COITERATIVE FUNCTIONS;

BOOLEAN ALGEBRA;

EID: 18944404269     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80347-0     Document Type: Article

References (33)

1. P.Aczel. Non-well-founded sets, CSLI Lecture Notes 14, Stanford 1988.
2. P.Aczel. Final Universes of Processes, MFPS'93 Conference Proceedings, Brookes et al. eds., Springer LNCS 802, New Orleans 1993.
3. Aczel P., Mendler N. A Final Coalgebra Theorem, in Category Theory and Computer Science. Pitt D.H., et al. Springer LNCS. 389:1989;357-365
4. Barr M. Terminal coalgebras in well-founded set theory. TCS. 114:1993;299-315
5. Barr M. Additions and corrections to "Terminal coalgebras in well-founded set theory" TCS. 124:1994;189-192
6. Barwise J., Moss L. Vicious circles: On the mathematics of non-wellfounded phenomena. CSLI Publications, Stanford. 1996
7. Forti M., Honsell F. Set theory with free construction principles. Ann. Scuola Norm. Sup. Pisa, Cl. Sci. 10:(4):1983;493-522
8. Forti M., Honsell F. Axioms of Choice and Free Construction Principles I. Bulletin de la Societe Mathematique de Belgique. XXXVI:(I ser.B):1984
9. Forti M., Honsell F. A general construction of Hyperuniverses. TCS. 156:1996
10. M.Forti, F.Honsell, M.Lenisa. Processes and Hyperuniverses, MFCS'94 Conference Proceedings, I.Prívara et al. eds., Springer LNCS 841, Berlin 1994, 352-361.
11. Forti M., Honsell F., Lenisa M. Axiomatic Characterizations of Hyperuniverses and Applications. Annals of the New York Academy of Sciences, Papers on General Topology and Applications, 11th Summer Conf. 80:1996;140-163 University of Southern Maine, Gorham, Maine
12. Freyd P., Scedrov A. Categories, Allegories. North-Holland, Amsterdam. 1990
13. Hermida C., Jacobs B. Structural induction and coinduction in a fibrational setting. Inf. and Comp. 145:1998;107-152
14. F.Honsell, M.Lenisa. Final Semantics for Untyped Lambda Calculus, TLCA'95 Conf. Proc, M.Dezani, G.Plotkin eds., Springer LNCS 902, Berlin 1995, 249-265.
15. Honsell F., Lenisa M. Coinductive Characterizations of Applicative Structures. Math. Struct, in Comp. Science. 9:1999;403-435
16. F.Honsell, M.Lenisa, U.Montanari, M.Pistore. Final Semantics for the π-calculus, PROCOMET'98 Conf. Proc., D. Gries et al. eds, Chapman & Hall, 1998.
17. Jacobs B. Objects and Classes, co-algebraically, Object-Orientation with Parallelism and Book Persistence. Freitag B., et al. 1996;Kluwer Academic Publishers
18. Lenisa M. Final Semantics for a Higher Order Concurrent Language, CAAP'96. Kirchner H., et al. Springer LNCS. 1059:1996;102-118
19. M.Lenisa. Themes in Final Semantics, Ph.D. Thesis TD-6/98, Dipartimento di Informatica, Universitá di Pisa, March 1998.
20. Lenisa M. From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems, CMCS'99 Conf. Proc. ENTCS. 19:1999;1-21
21. Lenisa M., Power J., Watanabe H. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads, CMCS'00 Conf. Proc. ENTCS. 33:2000
22. L.Moss. Parametric Corecursion, to appear in TCS.
23. L.Moss, Danner. On the Foundations of Corecursion, to appear in the Journal of the IGPL
24. L.Paulson. Final Coalgebras as Greatest Fixed Points in ZF Set Theory, to appear in Math. Struct, in Comp. Science.
25. Reichel H. An approach to objects semantics based on terminal co-algebras. Math. Struct, in Comp. Science. 5:1995;129-152
26. J.J.M.M.Rutten. Universal coalgebra: a theory of systems, CS-R9652, CWI, 1996.
27. Rutten J.J.M.M. Relators and Metric Bisimulations, CMCS'98. Conf. Proc, ENTCS. 11:1998
28. J.J.M.M.Rutten, D.Turi. On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders, REX Conference Proceedings, J.de Bakker et al. eds., Springer LNCS 666, 1993, 477-530.
29. J.J.M.M.Rutten, D.Turi. Initial algebra and final coalgebra semantics for concurrency: A Decade of Concurrency - Reflections and Perspectives, REX Conference Proceedings, J.de Bakker et al. eds., Springer LNCS 803, 1994, 530-582.
30. J.J.M.M.Rutten, E.de Vink, Bisimulation for probabilistic transition systems: a coalgebraic approach (extended abstract), ICALP'97 Conference Proceedings, P.Degano et al, eds., Springer LNCS 1256, 1997, 460-470.
31. Turi D. Functorial Operational Semantics and its Denotational Dual. PhD thesis. 1996
32. Turi D., Plotkin G. Towards a mathematical operational semantics, Proc 12th LICS Conf. 1997;280-291 IEEE, Computer Science Press
33. Turi D., Rutten I. On the foundations of final coalgebra semantics: non-wellfounded sets, partial orders, metric spaces. Math. Struct, in Comp. Science. 8:1998;481-540