Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
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. Bisimulation can't be traced;Bloom;Journal of the ACM,1995
4. E.W. Dijkstra. Hamming's exercise in sasl. Personal Note EWD792, see http://www.cs.utexas.edu/users/EWD/, 1981.
5. A tutorial on (co)algebras and (co)induction;Jacobs;Bulletin of the EATCS,1996
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献