Author:
Milius Stefan,Pattinson Dirk,Wißmann Thorsten
Funder
Deutsche Forschungsgemeinschaft
DFG
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference59 articles.
1. Infinite trees and completely iterative theories: a coalgebraic view;Aczel;Theor. Comput. Sci.,2003
2. Free algebras and automata realizations in the language of categories;Adámek;Comment. Math. Univ. Carol.,1974
3. Abstract and Concrete Categories: the Joy of Cats;Adámek,2009
4. Fixed points of functors;Adámek;J. Log. Algebr. Methods Program.,2018
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. A Completeness Theorem for Probabilistic Regular Expressions;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Minimality Notions via Factorization Systems and Examples;Logical Methods in Computer Science;2022-09-08
4. Coalgebraic Semantics for Nominal Automata;Coalgebraic Methods in Computer Science;2022
5. Foundations of regular coinduction;Logical Methods in Computer Science;2021-10-01