Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. Non-well-founded sets;Aczel,1988
2. On the greatest fixed point of a set functor;Adamek;Theoretical Computer Science,1995
3. P. Aczel and N.P. Mendler. A final coalgebra theorem. In D. H. Pitt, D. E. Rydeheard, P. Dybjer, A. M. Pitts, and A. Poigné, editors, Proceedings of the Conference on Category Theory and Computer Science, volume 389 of LNCS, pages 357–365, Berlin, September 1989. Springer.
4. Terminal coalgebras in well-founded set theory;Barr;Theoretical Computer Science,1993
5. J. Beck. Distributive laws. In B. Eckmann, editor, Seminar on Triples and Categorical Homology Theory, volume 80 of Lecture Notes in Mathematics, pages 119–140. Springer-Verlag, 1969.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stream processors and comodels;Logical Methods in Computer Science;2023-01-12
2. Categorical Büchi and Parity Conditions via Alternating Fixed Points of Functors;Coalgebraic Methods in Computer Science;2018
3. Quantitative simulations by matrices;Information and Computation;2017-02
4. Relation lifting, a survey;Journal of Logical and Algebraic Methods in Programming;2016-06
5. Simplified Coalgebraic Trace Equivalence;Software, Services, and Systems;2015