From set-theoretic coinduction to coalgebraic coinduction: Some results, some problems

Electronic Notes in Theoretical Computer Science

Volumn 19, Issue , 1999, Pages 2-22

  Lenisa, Marina ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; SEMANTICS; SET THEORY; THEOREM PROVING;

BISIMULATION; COALGEBRAIC COINDUCTION; COITERATIVE FUNCTION; SET-THEORETIC COINDUCTION;

ALGEBRA;

EID: 0942291418     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80265-8     Document Type: Conference Paper

References (36)

1. Aczel P. Non-well-founded sets. CSLI Lecture Notes. 14:1988;. Stanford
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. Bakker J.de, de Vink E. Control Flow Semantics. 1996;IT Press
5. Barwise J., Moss L. Vicious circles: On the mathematics of nonwellfounded phenomena. CSLI Publications, Stanford. 1996
6. Coquand T. Infinite Objects in Type Theory, in TYPES-93. SLNCS. 806:1994;62-78
7. Fiore M. A Coinduction Principle for Recursive Data Types Based on Bisimulation. Information and Computation. 127:1996;186-198
8. Forti M., Honsell F. Set theory with free construction principles. Ann. Scuola Norm. Sup. Pisa, Cl. Sci. 10:(4):1983;493-522
9. 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.
10. Freyd P., Scedrov A. Categories, Allegories. North-Holland, Amsterdam. 1990
11. H.Geuvers. Inductive and Coinductive types with Iteration and Recursion, Draft, 1992.
12. Giménez E. Codifying guarded definitions with recursive schemes, Workshop on Types for Proofs and Programs. Dybjer P., et al. Springer LNCS. 996:1994;39-59
13. C.Hermida, B.Jacobs. Structural induction and coinduction in a fibrational setting, to appear in Inf. and Comp.
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. F.Honsell, M.Lenisa. Coinductive Characterizations on Applicative Structures, to appear in MSCS.
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
18. Jacobs B. Behaviour-refinement of object-oriented specifications with coinductive correctness proofs, TAPSOFT'97. Bidoit M., et al. Springer LNCS. 1214:1997;787-802
19. Lenisa M. Final Semantics for a Higher Order Concurrent Language, CAAP'96. Kirchner H., et al. Springer LNCS. 1059:1996;102-118
20. M.Lenisa. Themes in Final Semantics, Ph.D. Thesis TD-6/98, Dipartimento di Informatica, Universitá di Pisa, March 1998.
21. M.Lenisa. A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects, to appear in FoSSaCS'99 Conf. Proc.
22. Milner R. Calculi for synchrony and asynchrony. TCS. 25:1983;267-310
23. Milner R., Parrow J., Walker D. A calculus of mobile processes. Inf. and Comp. 100:1992;1-77
24. L.Moss. Coalgebraic Logic, to appear in the Annals of Pure and Applied Logic.
25. Park D.M.R. Concurrency and automata on infinite sequences, MFPS'93. Deussen P. Springer LNCS. 104:1981;167-183
26. Pitts A.M. Relational Properties of Domains. Inf. and Comp. 127:1996;66-90
27. G.Plotkin. Types and Partial Functions, Post-Graduate Lecture Notes, Department of Computer Science, University of Edinburgh, 1985.
28. J.J.M.M.Rutten. Universal coalgebra: a theory of systems, CS-R9652, CWI, 1996.
29. J.J.M.M.Rutten. Relators and Metric Bisimulations, CMCS'98 Conf. Proc., ENTCS 11, 1998.
30. 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.
31. 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.
32. 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.
33. D.Sangiorgi. On the proof method for bisimulation, MFCS'95 Conference Proceedings, J.Wiedermann et al. eds., Springer LNCS 969, 1995, 479-488.
34. Smyth M., Plotkin G. The category-theoretic solution of recursive domain equations. SIAM J. of Computing. 11:(4):1982;761-783
35. D.Turi. Functorial Operational Semantics and its Denotational Dual, PhD thesis, 1996.
36. D.Turi, G.Plotkin. Towards a mathematical operational semantics, Proc 12th LICS Conf., IEEE, Computer Science Press, 1997, 280-291.