Generalised coinduction

Mathematical Structures in Computer Science

Volumn 13, Issue 2, 2003, Pages 321-348

  Bartels, Falk ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85014768337     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129502003900     Document Type: Article

References (20)

1. Aczel, P., Adamek, J. and Velebil, J. (2001) A coalgebraic view of infinite trees and iteration. In: Corradini, A., Lenisa, M. and Montanari, U. (eds.) Proc. CMCS 2001. Electronic Notes in Theoretical Computer Science 44.
2. Aczel, P. and Mendler, N. (1989) A final coalgebra theorem. In: Pitt, D., Rydeheard, D., Dybjer, P, Pitts, A. and Poigne, A. (eds.) Proc. 3rd CTCS. Springer-Verlag Lecture Notes in Computer Science 389 357–365.
3. Bartels, F. (2001) Generalised coinduction. In: Corradini, A., Lenisa, M. and Montanari, U. (eds.) Proc. CMCS 2001. Electronic Notes in Theoretical Computer Science 44.
4. Bloom, B., Istrail, S. and Meyer, A. R. (1995) Bisimulation can't be traced. Journal of the ACM 42 (1) 232–268.
5. Dijkstra, E.W. (1981) Hamming's exercise in SASL. Personal Note EWD792, see http://www.cs.utexas.edu/users/ewd/.
6. Jacobs, B. and Rutten, J. (1996) A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS 62 222–259.
7. Lenisa, M. (1999) From set-theoretic coinduction to coalgebraic coinduction: some results, some problems. In: Jacobs, B. and Rutten, J. (eds.) Proc. CMCS 1999. Electronic Notes in Theoretical Computer Science 19 1–21.
8. Lenisa, M., Power, J. and Watanabe, H. (2000) Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. In: Reichel, H. (ed.) Proc. CMCS 2000 Electronic Notes in Theoretical Computer Science 33 233–263.
9. Milner, R. (1989) Communication and Concurrency, International Series in Computer Science, Prentice Hall.
10. Moss, L.S. (2001) Parametric corecursion. Theoretical Computer Science 260 (12) 139–163.
11. Pardo, A. (2000) Towards merging recursion and comonads. In: Jeuring, J. (ed.) Proc. WGP'2000. Tech. Report UU-CS-2000-19, University of Utrecht 50–68.
12. Power, J. and Turi, D. (1999) A coalgebraic foundation for linear time semantics. In: Hofmann, M., Pavlovic, D. and Rosolini, G. (eds.) Proc. 8th CTCS Conf. Electronic Notes in Theoretical Computer Science 29.
13. Power, J. and Watanabe, H. (1999) Distributivity for a monad and a comonad. In: Jacobs, B. and Rutten, J. (eds.) Proc. CMCS 1999. Electronic Notes in Theoretical Computer Science 19 119–132.
14. Rutten, J. (1998) Automata and coinduction (an exercise in coalgebra). In: CONCUR'98. Springer-Verlag Lecture Notes in Computer Science 1466 194–218.
15. Rutten, J. (2000a) Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Technical Report SEN-R0023, CWI, Amsterdam.
16. Rutten, J. (2000b) Universal coalgebra: A theory of systems. Theoretical Computer Science 249 (1) 3–80.
17. Sangiorgi, D. (1998) On the bisimulation proof method. Mathematical Structures in Computer Science 8 447–479.
18. Turi, D. and Plotkin, G. D. (1997) Towards a mathematical operational semantics. In: Proc. 12th LICS Conf., IEEE, Computer Society Press 280–291.
19. Uustalu, T. and Vene, V. (1999) Primitive (co)recursion and course-of-value (co)iteration, categorically. Informatica (IMI, Lithuania) 10 (1) 5–26.
20. Uustalu, T., Vene, V. and Pardo, A. (2001) Recursion schemes from comonads. Nordic Journal of Computing 8 (3) 366–390.