Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. Final coalgebras are ideal completions of initial algebras;Adámek;J. Logic Comput.,2002
2. A. Baltag, A logic for coalgebraic simulation, H. Reichel (Ed.), Coalgebraic Methods in Computer Science, in Elective Notes in Theoretical Computer Science, Vol. 33, Elsevier, Amsterdam, 2000. www.elsevier.nl/locate/entcs/volume33.html.
3. The Lambda Calculus Its Syntax and Semantics;Barendregt,1984
4. A. Carboni, G.M. Kelly, R.J. Wood, A 2-categorical approach to change of base and geometric morphisms I, Report 90-1, Department of Pure Mathematics, University of Sydney, 1990.
5. A coalgebraic presentation of structured Transition systems;Corradini;Theoret. Comput. Sci.,2001
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Monadic Intersection Types, Relationally;Lecture Notes in Computer Science;2024
2. Preorder-Constrained Simulations for Program Refinement with Effects;Lecture Notes in Computer Science;2024
3. A point-free perspective on lax extensions and predicate liftings;Mathematical Structures in Computer Science;2023-12-01
4. Lax Liftings and Lax Distributive Laws;Electronic Proceedings in Theoretical Computer Science;2023-08-07
5. Weak Similarity in Higher-Order Mathematical Operational Semantics;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26