Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the final sequence of a finitary set functor
Theoretical Computer Science
ACM SIGACT News
Stochastic Relations
Terminal Coalgebras for Measure-Polynomial Functors
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Final coalgebras for functors on measurable spaces
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
A Note on Expressive Coalgebraic Logics for Finitary Set Functors
Journal of Logic and Computation
Rank-1 Modal Logics are Coalgebraic
Journal of Logic and Computation
The Computer Journal
Initial algebras and terminal coalgebras in many-sorted sets
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
The aim of this tutorial is to present the area of coalgebra to people interested in the kinds of semantic modeling that is prominent at TARK. Coalgebra is a general study of a great many kinds of models, and these include type spaces and Kripke models, and many others. But the theory is not overly general, it is not a theory of absolutely everything. The tutorial is designed to be a short introduction to a substantial technical field, bearing in mind that this is nearly impossible. It is also intended to bring together literatures from theoretical computer science and game theory.