Generalised coinduction

Electronic Notes in Theoretical Computer Science

Volumn 44, Issue 1, 2001, Pages 67-87

  Bartels, F ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER SIMULATION; FUNCTIONS; ITERATIVE METHODS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

BISIMULATION; COALGEBRA; COITERATION; FUNCTOR;

BOOLEAN ALGEBRA;

EID: 18944404502     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80903-4     Document Type: Conference Paper

References (17)

1. Peter Aczel and Nax Mendler. A final coalgebra theorem. In D.H. Pitt, D.E. Rydeheard, P. Dybjer, A.M. Pitts, and A. Poigné, editors, Proceedings 3rd Conf. on Category Theory and Computer Science, CTCS'89, Manchester, UK, 5-8 Sept 1989, volume 389 of Lecture Notes in Computer Science, pages 357-365. Springer-Verlag, Berlin, 1989.
2. F. Bartels. Generalised coinduction. Technical Report SEN-R0043, CWI - Centrum voor Wiskunde en Informatica, December 2000.
3. Bloom Bard, Istrail Sorin, Meyer Albert R. Bisimulation can't be traced. Journal of the ACM. 42:(1):January 1995;232-268
4. E.W. Dijkstra. Hamming's exercise in sasl. Personal Note EWD792, see http://www.cs.utexas.edu/users/EWD/, 1981.
5. Jacobs Bart, Rutten Jan. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS. 62:1996;222-259
6. Jacobs B., Rutten J. Proc. Coalgebraic Methods in Computer Science (CMCS 1999), volume 19 of Electronic Notes in Theoretical Computer Science. 1999
7. M. Lenisa. From set-theoretic coinduction to coalgebraic coinduction: Some results, some problems. Unpublished extension of [Len99b] (available through the author's homepage at http://www.dimi.uniud.it/~lenisa/), December 1999.
8. M. Lenisa. From set-theoretic coinduction to coalgebraic coinduction: some results, some problems. In Jacobs and Rutten [JR99], pages 1-21.
9. Lenisa M., Power J., Watanabe H. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Reichel H. Proc. Coalgebraic Methods in Computer Science (CMCS 2000), volume 33 of Electronic Notes in Theoretical Computer Science. 2000;233-263
10. Milner R. Communication and Concurrency. International Series in Computer Science :1989;Prentice Hall
11. J. Power and H. Watanabe. Distributivity for a monad and a comonad. In Jacobs and Rutten [JR99], pages 119-132.
12. J.J.M.M. Rutten. Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Technical Report SEN-R0023, CWI - Centrum voor Wiskunde en Informatica, 2000.
13. Rutten J.J.M.M. Universal coalgebra: A theory of systems. Theoretical Computer Science. 249:(1):October 2000;3-80
14. Sangiorgi D. On the bisimulation proof method. Journal of Mathematical Structures in Computer Science. 8:1998;447-479
15. Sijtsma Ben A. On the Productivity of Recursive List Definitions. ACM Transactions on Programming Languages and Systems. 11:(4):October 1989;633-649
16. th LICS Conf., pages 280-291. IEEE, Computer Society Press, 1997.
17. Uustalu Tarmo, Vene Varmo. Primitive (co)recursion and course-of-value (co)iteration, categorically. INFORMATICA (IMI, Lithuania). 10:(1):1999;5-26