Corina Cîrstea (2011):
Maximal Traces and Path-Based Coalgebraic Temporal Logics.
Theoretical Computer Science 412(38),
pp. 5025–5042,
doi:10.1016/j.tcs.2011.04.025.
Corina Cîrstea (2011):
Model Checking Linear Coalgebraic Temporal Logics: An Automata-Theoretic Approach.
In: Proc.+.1667em+.1667emCALCO+.1667em+.1667em2011,
Lecture Notes in Computer Science 6859.
Springer,
pp. 130–144,
doi:10.1007/978-3-642-22944-2_10.
Dion Coumans & Bart Jacobs (2013):
Scalars, Monads, and Categories.
In: C. Heunen, M. Sadrzadeh & E. Grefenstette: Quantum Physics and Linguistics. A Compositional, Diagrammatic Discourse.
Oxford Univ. Press,
pp. 184–216,
doi:10.1093/acprof:oso/9780199646296.001.0001.
Brian A. Davey & Hilary A. Priestley (2002):
Introduction to Lattices and Order (2. ed.).
Cambridge University Press,
doi:10.1017/CBO9780511809088.
Zoltan Ésik & Werner Kuich (2007):
Modern Automata Theory.
http://dmg.tuwien.ac.at/kuich/.
Clément Fumex, Neil Ghani & Patricia Johann (2011):
Indexed Induction and Coinduction, Fibrationally.
In: Proc.+.1667em+.1667emCALCO+.1667em+.1667em2011,
Lecture Notes in Computer Science 6859.
Springer,
pp. 176–191,
doi:10.1007/978-3-642-22944-2_13.
Neil Ghani, Patricia Johann & Clément Fumex (2012):
Generic Fibrational Induction.
Logical Methods in Computer Science 8(2),
doi:10.2168/LMCS-8(2:12)2012.
Ichiro Hasuo, Kenta Cho, Toshiki Kataoka & Bart Jacobs (2013):
Coinductive Predicates and Final Sequences in a Fibration.
In: Proc.+.1667em+.1667emMFPS+.1667em+.1667emXXIX,
pp. 181–216.
Ichiro Hasuo, Bart Jacobs & Ana Sokolova (2007):
Generic Trace Semantics via Coinduction.
Logical Methods in Computer Science 3(4),
pp. 1–36,
doi:10.2168/LMCS-3(4:11)2007.
Claudio Hermida & Bart Jacobs (1998):
Structural Induction and Coinduction in a Fibrational Setting.
Inf. Comput. 145(2),
pp. 107–152,
doi:10.1006/inco.1998.2725.
Bart Jacobs (2012):
Introduction to Coalgebra. Towards Mathematics of States and Observations (Version 2.0).
Draft.
Bart Jacobs, Alexandra Silva & Ana Sokolova (2012):
Trace Semantics via Determinization.
In: Proc.+.1667em+.1667emCMCS+.1667em+.1667em2012,
Lecture Notes in Computer Science 7399.
Springer,
pp. 109–129,
doi:10.1007/978-3-642-32784-1.
Paris C. Kanellakis & Scott A. Smolka (1990):
CCS Expressions, Finite State Processes, and Three Problems of Equivalence.
Inf. Comput. 86(1),
pp. 43–68,
doi:10.1016/0890-5401(90)90025-D.
Anders Kock (2011):
Monads and extensive quantities.
ArXiv:1103.6009.
Anders Kock (2012):
Commutative monads as a theory of distributions.
Theory and Applications of Categories 26(4),
pp. 97–131.
Lawrence S. Moss (1999):
Coalgebraic Logic.
Ann. Pure Appl. Logic 96(1-3),
pp. 277–317,
doi:10.1016/S0168-0072(98)00042-6.
Dirk Pattinson (2003):
Coalgebraic modal logic: soundness, completeness and decidability of local consequence.
Theor. Comput. Sci. 309(1-3),
pp. 177–193,
doi:10.1016/S0304-3975(03)00201-9.
eptcs@eptcs.org