Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. Non-well-founded sets;Aczel,1988
2. P. Aczel, P.F. Mendler, A final coalgebra theorem, in: Category Theory and Computer Science, Lecture Notes in Computer Science, Vol. 389, Springer, Berlin, 1989, pp. 357–365.
3. On final coalgebras of continuous functors;Adámek;Theoret. Comput. Sci.,2003
4. Least fixed point of a functor;Adámek;J. Comput. System Sci.,1979
5. On the greatest fixed point of a set functor;Adámek;Theoret. Comput. Sci.,1995
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Proving Behavioural Apartness;Lecture Notes in Computer Science;2024
2. Graded Monads and Behavioural Equivalence Games;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
3. Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
4. Session Coalgebras: A Coalgebraic View on Regular and Context-free Session Types;ACM Transactions on Programming Languages and Systems;2022-07-15
5. Corecursion Up-to via Causal Transformations;Coalgebraic Methods in Computer Science;2022