Author:
Boreale Michele,Gadducci Fabio
Subject
General Computer Science,Theoretical Computer Science
Reference26 articles.
1. P. Aczel, Non-well-founded sets, Center for the Study of Language and Information, Stanford University. CSLI Lecture Notes, Vol. 14, 1988.
2. Final coalgebras are ideal completions of initial algebras;Adámek;J. Logic Comput.,2002
3. Terminal coalgebras in well-founded set theory;Barr;Theoret. Comput. Sci.,1993
4. M. Boreale, F. Gadducci, Denotational testing semantics in coinductive form, in: B. Rovan, P. Vojtás (Eds.), Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2747, Springer, Berlin, 2003, pp. 279–289.
5. Testing equivalence as a bisimulation equivalence;Cleaveland;Formal Aspects Comput.,1993
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献