Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. S. Abramsky, Interaction categories, manuscript (1994); extended abstract in: G. Burn et al (eds.), Theory and Formal Methods 1993, Workshops in Computing (Springer 1993) 57–69
2. P. Aczel, Non-Well-Founded Sets, Lecture Notes 14 (CSLI 1988)
3. P. Aczel and P.F. Mendler, A final coalgebra theorem, in: Category Theory and Computer Science, D.H. Pitt et al. (eds.), Lecture Notes in Computer Science 389 (Springer 1989) 357–365
4. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114(1993) 299–315
5. D.B. Benson and O. Ben-Shachar, Bisimulation of automata, Information and Computation 79(1988) 60–83
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Retracing Some Paths in Categorical Semantics: From Process-Propositions-as-Types to Categorified Reals and Computers;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023
2. Tree-functors, determinacy and bisimulations;Mathematical Structures in Computer Science;2010-02-04
3. Concrete Process Categories;Electronic Notes in Theoretical Computer Science;2002-11
4. Specifying interaction categories;Category Theory and Computer Science;1997