Author:
Adámek Jiřı́,Milius Stefan,Velebil Jiřı́
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. Non-Well-Founded Sets;Aczel,1988
2. Infinite trees and completely iterative theories;Aczel;Theoret. Comput. Sci.,2003
3. A final coalgebra theorem;Aczel,1989
4. Free algebras and automata realization in the language of categories;Adámek;Comment. Math. Univ. Carolin.,1974
5. J. Adámek, On a description of terminal coalgebras and iterative theories, Electron. Notes Theoret. Comput. Sci. 82 (1) (2003).
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ALGEBRAIC COCOMPLETENESS AND FINITARY FUNCTORS;LOG METH COMPUT SCI;2021
2. Coalgebra and Abstraction;Notre Dame Journal of Formal Logic;2021-01-01
3. Fixed points of functors;Journal of Logical and Algebraic Methods in Programming;2018-02
4. Relation lifting, a survey;Journal of Logical and Algebraic Methods in Programming;2016-06
5. A proof-theoretic semantic analysis of dynamic epistemic logic;Journal of Logic and Computation;2014-11-03