Algebras, Coalgebras, Monads and Comonads-Reference-Cited by-同舟云学术

Algebras, Coalgebras, Monads and Comonads

Published:2001-05 Issue:1 Volume:44 Page:128-145
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Ghani Neil,Lüth Christoph,de Marchi Federico,Power John

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference24 articles.

1. P. Aczel, J. Adamek, and J. Velebil. Iteration monads. In U. Montanari, editor, Proceedings CMCS'01, volume 44, 2001.

2. J. Adamek. On final coalgebras of continuous functors. To appear.

3. J. Adamek and J. Rosický. Locally Presentable and Accessible Categories. Number 189 in London Mathematical Society Lecture Note Series. Cambridge University Press, 1994.

4. S. Awodey and J. Hughes. The coalgebraic dual of birkhoffs variety theorem. http://www.contrib.andrew.cmu.edu/user/jesse/papers/CoBirkhoff.ps.gz, 2000.

5. Terminal algebras in well-founded set theory;Barr;Theoretical Computer Science,1993

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Grounding Game Semantics in Categorical Algebra;Electronic Proceedings in Theoretical Computer Science;2022-11-03

2. Doctrines, modalities and comonads;Mathematical Structures in Computer Science;2021-09-14

3. On the behaviour of coalgebras with side effects and algebras with effectful iteration;Journal of Logic and Computation;2021-09

4. An Algebraic Theory of Markov Processes;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09

5. Turing-Completeness Totally Free;Lecture Notes in Computer Science;2015