On the foundations of final coalgebra semantics: Non-well-founded sets, partial orders, metric spaces

Mathematical Structures in Computer Science

Volumn 8, Issue 5, 1998, Pages 481-540

  Turi, Daniele ^a   Rutten, Jan ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85022954743     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129598002588     Document Type: Article

References (52)

1. Abramsky, S. (1990) The lazy lambda calculus. In: Turner, D. (ed.) Research Topics in Functional Programming, Addison-Wesley 65-116.
2. Abramsky, S. (1991) A domain equation for bisimulation. Information and Computation 92 161-218.
3. Aczel, P. (1988) Non-well-founded sets, CSLI Lecture Notes 14.
4. Aczel, P. (1994) Final universes of processes. In: Mathematical Foundations of Programming Semantics, Proc. 9th Int. Conf., New Orleans, LA, USA, April 1993. Springer-Verlag Lecture Notes in Computer Science 802 1-28.
5. Aczel, P. and Mendler, N. (1989) A Linal coalgebra theorem. In: Pitt, D. et al. (eds.) Proc. category theory and computer science. Springer-Verlag Lecture Notes in Computer Science 389 357-365.
6. America, P. and Rutten, J. (1989) Solving reflexive domain equations in a category of complete metric spaces. Journal of Computer and System Sciences 39 (3) 343-375.
7. Arbib, M. and Manes, E. (1980) The greatest point approach to data types. In: Proc. of the 3rd workshop meeting on Categorical and Algebraic Methods in Computer Science and System Theory. See also Arbib and Manes (1982).
8. Arbib, M. and Manes, E. (1982) Parametrized data types do not need highly constrained parameters. Information and Control 52 139-158.
9. Arnold, A. and Dicky, A. (1989) An algebraic characterization of transition system equivalences. Information and Computation 82 198-229.
10. Baldamus, M. (1994) A non-well-founded sets semantics for observation congruence over full CCS. Tech. rep. Berlin University of Technology.
11. Barr, M. (1993) Terminal coalgebras in well-founded set theory. Theoretical Computer Science 144(2) 299-315.
12. Barwise, J. and Etchemendy, J. (1987) The Liar: An Essay in Truth and Circularity, Oxford University Press.
13. Bonsangue, M., Breugel, F.V. and Rutten, J. (1998) Generalized ultrametric spaces: completion, topology, and powerdomains via the Yoneda embedding. Theoretical Computer Science 193 1-51.
14. Casley, R., Crew, R., Meseguer, J. and Pratt, V. (1991) Temporal structures. Math. Structures in Comp. Sci. 1 (2) 179-213.
15. de Bakker, J. and de Vink, E. (1996) Control Flow Semantics, The MIT Press.
16. de Bakker, J. and Rutten, J. (eds.) (1992) Ten Years of Concurrency Semantics, World Scientic, Selected papers of the Amsterdam Concurrency Group.
17. Fiore, M. (1996a) Axiomatic Domain Theory in Categories of Partial Maps, Distinguished Dissertations Series, Cambridge University Press.
18. Fiore, M. (1996b) A coinduction principle for recursive data types based on bisimulation. Information and Computation 127 (2) 186-198.
19. Fiore, M. and Plotkin, G. (1992) On compactness and Cpo-enriched categories. In: Winskel, G. (ed.) Proceedings of the CLICS Workshop (23-27 March 1992). DAIMI PB 397-II Computer Science Department, Aarhus University 571-584.
20. Fiore, M. and Plotkin, G. (1994) An axiomatisation of computationally adequate domain-theoretic models of FPC. 9th LICS Conf., IEEE, Computer Society Press 92-102.
21. Flagg, B. and Kopperman, R. (1997) Continuity spaces: Reconciling domains and metric spaces. Theoretical Computer Science 177 (1) 111-138.
22. Forti, M. and Honsell, F. (1983) Set theory with free construction principles. Annali Scuola Normale Superiore, Pisa X (3) 493-522.
23. Freyd, P. (1990) Recursive types reduced to inductive types. Proc. Fifth IEEE Symp. on Logic In Computer Science, IEEE Computer Society Press 498-507.
24. Freyd, P. (1991) Algebraically complete categories. In: Carboni, A., Pedicchio, M. and Rosolini, G. (eds.) Category Theory - Proc. of the Int'l Conf. held in Como, Italy, July 1990. Springer-Verlag Lecture Notes in Mathematics 1488 95-104.
25. Freyd, P. (1992) Remarks on algebraically compact categories. In: Fourman, M., Johnstone, P. and Pitts, A. (eds.) Applications of Category Theory in computer science. London Mathematical Society Lecture Notes Series, Cambridge University Press 177 95-106.
26. Goguen, J., Thatcher, J. and Wagner, E. (1978) An initial algebra approach to the specification, correctness and implementation of abstract data types. In: Yeh, R. (ed.) Current Trends in Programming Methodology, Prentice Hall IV 80-149.
27. Hartonas, C. (1997) Semantics of nite delay. Theoretical Computer Science 176 (1-2) 205-234.
28. Hermida, C. and Jacobs, B. (1995) Induction and coinduction via subset types and quotient types. In: Informal Proceedings of the Joint CLICS-TYPES Workshop on Categories and Type Theory. Prog. Meth. Group, Report 85, Goteborg Univ. and Chalmers Univ. of Techn.
29. Honsell, F. and Lenisa, M. (1995) Final semantics for untyped calculus. In: Dezani-Ciancaglini, M. and Plotkin, G. (eds.) Typed Lambda calculi and applications: second international conference. Springer-Verlag Lecture Notes in Computer Science 902. Joyal, A. and Moerdijk, I. (1995) Algebraic Set Theory, London Mathematical Society Lecture Note Series 220, Cambridge University Press.
30. Joyal, A., Nielsen, M. and Winskel, G. (1993) Bisimulation and open maps. In: Proc. Eighth IEEE Symp. on Logic In Computer Science 418-427. Kelly, M. (1982) Basic Concepts of Enriched Category Theory, Cambridge University Press.
31. Kelly, M. (1989) Elementary observations on 2-categorical limits. Bull. Aust. Math. Soc. 39 (2) 301-317.
32. Lawvere, F.W. (1973) Metric spaces, generalized logic, and closed categories. Rendiconti del Seminario Matematico e Fisico di Milano 43 135-166.
33. Lawvere, F.W. (1976) Variable quantities and variable structure in topoi. In: Heller, A. and Tierney, M. (eds.) Algebra, Topology, and Category Theory, Academic Press 101-131.
34. Levy, A. (1979) Basic Set Theory, Perspectives in Mathematical Logic, Springer-Verlag. Mac Lane, S. (1971) Categories for the Working Mathematician, Graduate Texts in Mathematics 5, Springer-Verlag.
35. Mac Lane, S. (1986) Mathematics: Form and Function, Springer-Verlag.
36. Manes, E. (1976) Algebraic Theories, Graduate Texts in Mathematics 26, Springer-Verlag.
37. Milner, R. (1980) A Calculus of Communicating Systems. Springer-Verlag Lecture Notes in Computer Science 92.
38. Mukai, K. (1991) Constraint Logic Programming and the Unlocation of Information, Ph. D. thesis, Tokio Institute of Technology.
39. Park, D. (1981) Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Proceedings 5th GI Conference. Springer-Verlag Lecture Notes in Computer Science 104 167-183.
40. Paulson, L. C. (1995) A concrete final coalgebra theorem for ZF set theory. In: Dybjer, P. et al. (eds.) Types for Proofs and Programs '94. Springer-Verlag Lecture Notes in Computer Science 996 120-139.
41. Pitts, A. (1994a) A co-induction principle for recursively defined domains. Theoretical Computer Science 124 195-219.
42. A. Pitts Computational adequacy via ‘mixed’ inductive definitions, In: Mathematical Foundations of Programming Semantics, Proc. 9th Int. Conf., New Orleans, LA, USA, April 1993. Springer-Verlag Lecture Notes in Computer Science 802 72-82. Plotkin, G. (1981) A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University.
43. Rutten, J. (1996) Elements of generalized ultrametric domain theory. Theoretical Computer Science 170 349-381.
44. Rutten, J. and Turi, D. (1993) On the foundations of final semantics: non-standard sets, metric spaces, partial orders. In: de Bakker, J. et al. (eds.) Proc. of the REX workshop Semantics - Foundations and Applications. Springer-Verlag Lecture Notes in Computer Science 666 477-530.
45. Rutten, J. and Turi, D. (1994) Initial algebra and final coalgebra semantics for concurrency. In: de Bakker, J. et al. (eds.) Proc. of the REX workshop A Decade of Concurrency - Reflections and Perspectives. Springer-Verlag Lecture Notes in Computer Science 803 530-582.
46. Smyth, M. (1988) Quasi uniformities: reconciling domains with metric spaces. In: Main, M., Melton, A., Mislove, M. and Schmidt, D. (eds.) Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics. Springer-Verlag Lecture Notes in Computer Science 298 236-253.
47. Smyth, M. and Plotkin, G. (1982) The category-theoretic solution of recursive domain equations. SIAM J. Comput. 11 761-783.
48. Turi, D. (1996) Functorial Operational Semantics and its Denotational Dual. Ph. D. thesis, Free University, Amsterdam. (Available from http://www.dcs.ed.ac.uk/home/
49. Turi, D. (1997) Categorical modelling of structural operational rules: case studies. In: Moggi, E. and Rosolini, G. (eds.) Proc. 7th CTCS Conference. Springer-Verlag Lecture Notes in Computer Science 1290 127-146.
50. Turi, D. and Plotkin, G. (1997) Towards a mathematical operational semantics. Proc. 12th LICS Conf., IEEE, Computer Society Press 280-291.
51. van Benthem, J. (1984) Correspondence theory. In: Gabbay, D. M. et al. (eds.) Handbook of Philosophical Logic II, Reidel 167-247.
52. Wagner, K. (1994) Solving recursive domain equations with enriched categories, Ph. D. thesis, Carnegie Mellon University, Pittsburgh. (Technical report CMU-CS-94-159.)