Final coalgebras as greatest fixed points in ZF set theoryt

Mathematical Structures in Computer Science

Volumn 9, Issue 5, 1999, Pages 545-567

  Paulson, Lawrence C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18544366684     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129599002790     Document Type: Article

References (18)

1. Abramsky, S. (1990) The lazy lambda calculus. In: Turner, D. A. (ed.) Research Topics in Functional Programming, Addison-Wesley 65–116.
2. Aczel, P. (1988) Non-Well-Founded Sets, CSLI.
3. Aczel, P. and Mendler, N. (1989) A final coalgebra theorem. In: Pitt, D. H., Rydeheard, D. E., Dybjer, R, Pitts, A. M. and Poigne, A. (eds.) Category Theory and Computer Science. Springer-Verlag Lecture Notes in Computer Science 389 356–365.
4. Barr, M. (1993) Terminal coalgebras in well-founded set theory. Theoretical Computer Science 114 (2) 299–315.
5. Chandy, K. M. and Misra, J. (1988) Parallel Program Design: A Foundation, Addison-Wesley.
6. Frost, J. (1995) A case study of co-induction in Isabelle. Technical Report 359, Comp. Lab., Univ. Cambridge.
7. Hensel, U. and Jacobs, B. (1997) Proof principles for datatypes with iterated recursion. In: Moggi, E. and Rosolini, G. (eds.) Category Theory and Computer Science. Springer-Verlag Lecture Notes in Computer Science 1290 220–241.
8. Hensel, U., Huisman, M., Jacobs, B. and Tews, H. (1998) Reasoning about classes in object-oriented languages: Logical models and tools. In: Hankin, C. (ed.) European Symposium on Programming. Springer-Verlag Lecture Notes in Computer Science 1381 105–121.
9. Kunen, K. (1980) Set Theory: An Introduction to Independence Proofs, North-Holland.
10. Milner, R. (1989) Communication and Concurrency, Prentice-Hall.
11. Milner, R. and Tofte, M. (1991) Co-induction in relational semantics. Theoretical Computer Science 87 209–220.
12. Moss, L. S. and Danner, N. (1997) On the foundations of corecursion. Logic Journal of the IGPL 5 (2) 231–257. Paulin-Mohring, C. (1993) Inductive definitions in the system Coq: Rules and properties. In: Bezem, M. and Groote, J. (eds.) Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science 664 328–345.
13. Paulson, L. C. (1993) Set theory for verification: I. From foundations to functions. J. Auto. Reas. 11 (3) 353–389.
14. Paulson, L. C. (1994) A fixedpoint approach to implementing (co)inductive definitions. In: Bundy, A. (ed.) Automated Deduction - CADE-12 International Conference. Springer-Verlag Lecture Notes in Artificial Intelligence 814 148–161.
15. Paulson, L. C. (1995a) A concrete final coalgebra theorem for ZF set theory. In: Dybjer, P, Nordstrom, B. and Smith, J. (eds.) Types for Proofs and Programs: International Workshop TYPES ’94. Springer-Verlag Lecture Notes in Computer Science 996 120–139.
16. Paulson, L. C. (1995b) Set theory for verification: II. Induction and recursion. J. Auto. Reas. 15 (2) 167–215.
17. Quine, W. V. (1966) On ordered pairs and relations. In: Selected Logic Papers, chapter VIII, 110–113. Random House. (Orginally published 1945-6.)
18. Rutten, J.J.M.M. and Turi, D. (1993) On the foundations of final semantics: Non-standard sets, metric spaces, partial orders. In: de Bakker, J., de Roever, W.-P. and Rozenberg, G. (eds.) Semantics: Foundations and Applications. Springer-Verlag Lecture Notes in Computer Science 666 477–530.