[Adá03] On final coalgebras of continuous functors. Theoretical Computer Science, 294:3–29, 2003..
[AM75] Arrows, Structures and Functors. The Categorical Imperative. Academic Press, 1975. and .
[AM82] Parametrized data types do not need highly constrained parameters. Information and Control, 52:139–158, 1982. and .
[AM89] Category Theory and Computer Science, number 389 in Lecture Notes Computer Science, pages 357–365. Springer, 1989. and . A final coalgebra theorem. In , , and , editors,
[Awo06] Category Theory. Oxford University Press, 2006..
[Bar93] Terminal coalgebras in well-founded set theory. Theoretical Computer Science, 114(2):299–315, 1993. Corrigendum in Theoretical Computer Science124:189–192, 1994..
[Bar03] Generalised coinduction. Mathematical Structures in Computer Science, 13(2):321–348, 2003..
[BBRS09] International Conference on Concurrency Theory (CONCUR 2009), Lecture Notes Computer Science, Springer, 2009., , , and . Deriving syntax and axioms for quantitative regular behaviours. In
[BD94] A Classical Mind. Essays in Honour of C.A.R. Hoare, pages 75–92. Prentice Hall, 1994. and . Hiding and behaviour: an institutional approach. In , editor,
[BM96] Vicious Circles: On the Mathematics of Non-wellfounded Phenomena. CSLI Lecture Notes 60, Stanford, 1996. and .
[Bor94] Handbook of Categorical Algebra, volume 50, 51 and 52 of Encyclopedia of Mathematics. Cambridge University Press, 1994..
[BRS09] Logic in Computer Science. IEEE, Computer Science Press, 2009., , and . Algebras for Kripke polynomial coalgebras. In , editor,
[BV96] Control Flow Semantics. MIT Press, 1996. and .
[BW90] Category Theory for Computing Science. Prentice Hall, 1990. and .
[CHL03] Coalgebraic Methods in Computer Science, number 82(1) in Electronic Notes in Theoretical Computer Science, Elsevier, 2003., and . Generalized coiteration schemata. In , editor,
[Coh81] Universal Algebra, volume 6 of Mathematics and its Applications. Reidel, 1981..
[CP07] Modular proof systems for coalgebraic logics. Theoretical Computer Science, 388:83–108, 2007. and .
[Cro93] Categories for Types. Cambridge Mathematical Textbooks. Cambridge University Press, 1993..
[CS95] Strong categorical datatypes II: A term logic for categorical programming. Theoretical Computer Science, 139:69–113, 1995. and .
[EM85] Fundamentals of Algebraic Specification I: Equations and Initial Semantics. Number 6 in EATCS Monographs. Springer, 1985. and .
[Fio96] A coinduction principle for recursive data types based on bisimulation. Information and Computation, 127(2):186–198, 1996..
[GD94] Recent Trends in Data Type Specification, number 785 in Lecture Notes in Computer Science, pages 1–29. Springer, 1994. and . Towards an algebraic semantics for the object paradigm. In and , editors,
[GGM76] Mathematical Foundations of Computer Science, number 45 in Lecture Notes in Computer Science, pages 576–587. Springer, 1976., , and . Observability concepts in abstract data specifications. In , editor,
[GM82] International Colloquium on Automata, Languages and Programming, number 140 in Lecture Notes in Computer Science, pages 263–281. Springer, 1982. and . Universal realization, persistent interconnection and implementation of abstract modules. In and , editors,
[GM93] Introduction to HOL: A Theorem Proing Environment for Higher Order Logic. Cambridge University Press, 1993. and .
[GM94] A Classical Mind. Essays in Honour of C.A.R. Hoare, pages 119–142. Prentice Hall, 1994. and . Proof of correctness of object representations. In , editor,
[GM96] Proceedings of the Conference on Intelligent Systems: A Semiotic Perspective, pages 159–167. National Institute of Standards and Technology, 1996. and . An extended abstract of a hidden agenda. In , , and , editors,
[GTW78] Current Trends in Programming Methodoloy, pages 80–149. Prentice Hall, 1978., , and . An initial algebra approach to the specification, correctness and implementation of abstract data types. In , editor,
[Gum99] 1999.. Elements of the general theory of coalgebras. Notes of lectures given at LUATCS'99: Logic, Universal Algebra, Theoretical Computer Science, Johannesburg. Available as www.mathematik.uni-marburg.de/~gumm/Papers/Luatcs.ps,
[HJ98] Structural induction and coinduction in a fibrational setting. Information and Computer, 145:107–152, 1998. and .
[HJ04] Simulations in coalgebra. Theoretical Computer Science, 327(1–2):71–108, 2004. and .
[HJ05] Algebra and Coalgebra in Computer Science (CALCO'05), number 3629 in Lecture Notes in Computer Science, pages 213–231. Springer, 2005. and . Context-free languages via coalgebraic trace semantics. In , , , and , editors,
[HJS07] Generic trace theory. Logical Methods in Computer Science, 3(4:11), 2007., , and .
[HL95] Typed Lambda Calculi and Applications, number 902 in Lecture Notes in Computer Science, pages 249–265. Springer, 1995. and . Final semantics for untyped λ-calculus. In and , editors,
[HP95] A unifying type-theoretic framework for objects. Journal of Functional Programming, 5(4):593–635, 1995. and .
[Jac95] Parameters and parametrization in specification using distributive categories. Fundamental Informaticae, 24(3):209–250, 1995..
[Jac96a] European Conference on Object-Oriented Programming, number 1098 in Lecture Notes in Computer Science, pages 210–231. Springer, 1996.. Inheritance and cofree constructions. In , editor,
[Jac96b] Object-Orientation with Parallelism and Persistence, pages 83–103. Kluwer, 1996.. Objects and classes, co-algebraically. In , , , and , editors,
[Jac06] Algebra, Meaning and Computation: Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday, number 4060 in Lecture Notes in Computer Science, pages 375–404. Springer, 2006.. A bialgebraic review of deterministic automata, regular expressions and languages. In , , and , editors,
[Jac08] Coalgebraic Methods in Computer Science, volume 203(5) of Electronic Notes in Theoretical Computer Science, pages 131–152. Elsevier, 2008.. Coalgebraic trace semantics for combined possibilistic and probabilistic systems. In and , editors,
[JNW96] Bisimulation from open maps. Information and Computation, 127(2):164–185, 1996., , and .
[Kam83] Final data types and their specification. ACM Transactions on Programming Languages and Systems, 5(1):97–123, 1983..
[Kli07] Mathematical Foundations of Programming Semantics, number 173 in Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 2007.. Coalgebraic modal logic beyond sets. In , editor,
[Kur01] Specifying coalgebras with modal logic. Theoretical Computer Science, 260(1–2):119–138, 2001..
[Kur06] Coalgebras and their logics. SIGACT News Logic Column, 37(2):57–77, 2006..
[Lan71] Categories for the Working Mathematician. Springer, 1971..
[LS81] Algebraic specification of data types: A synthetic approach. Mathematical Systems Theory, 14:97–139, 1981. and .
[LS86] Introduction to Higher Order Categorical Logic. Number 7 in Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1986. and .
[MA86] Algebraic Appoaches to Program Semantics. Texts and Monographs in Computer Science. Springer, 1986. and .
[Mal96] Recent Trends in Data Type Specification, number 1130 in Lecture Notes in Computer Science, pages 359–378. Springer, 1996.. Behavioural equivalence, bisimulation and minimal realisation. In , , and , editors,
[Man74] Algebraic Theories. Springer, 1974..
[Mel89] Current Trends in Hardware Verification and Automated Theorem Proving, Lecture Notes in Computer Science, pages 341–386. Springer, 1989.. Automating recursive type definitions in higher order logic. In and , editors,
[Mil89] A Calculus of Communicating Systems. Lecture Notes in Computer Science, Springer, 1989..
[MT92] Handbook of Logic in Computer Science, volume 1, pages 189–411. Oxford University Press, 1992. and . Universal algebra. In , , and , editors,
[ORR+96] Computer Aided Verification, number 1102 in Lecture Notes in Computer Science, pages 411–414. Springer, 1996., , , , and . PVS: Combining specification, proof checking, and model checking. In and , editors,
[Par81] Proceedings 5th GI Conference on Theoretical Computer Science, number 104 in Lecture Notes in Computer Science, pages 15–32. Springer, 1981.. Concurrency and automata on infinite sequences. In , editor,
[Pau90] Logic and Computer Science, pages 361–386. Academic Press, 1990. The APIC series, vol. 31.. Isabelle: The next 700 theorem provers. In , editor,
[Pau97] Mechanizing coinduction and corecursion in higher-order logic. Journal of Logic and Computation, 7:175–204, 1997..
[Pie91] Basic Category Theory for Computer Scientists. MIT Press, 1991..
[Pit94] A co-induction principle for recursively defined domains. Theoretical Computer Science, 124(2):195–219, 1994..
[Pit96] Relational properties of domains. Information and Computing, 127(2):66–90, 1996..
[Plo81] 1981.. A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University,
[PM93] Typed Lambda Calculi and Applications, number 664 in Lecture Notes in Computer Science, pages 328–345. Springer, 1993.. Inductive definitions in the system Coq. Rules and properties. In and , editors,
[PP02] The continuum as a final coalgebra. Theoretical Computer Science, 280(1–2):105–122, 2002. and .
[Rei95] An approach to object semantics based on terminal co-algebras. Mathematical Structures in Computer Science, 5:129–152, 1995..
[Rou96] Handbook of Logic and Language. Elsevier, 1996.. Feature logics. In and , editors,
[RT94] A Decade of Concurrency, number 803 in Lecture Notes in Computer Science, pages 530–582. Springer, 1994. and . Initial algebra and final coalgebra semantics for concurrency. In , , and , editors,
[Rut00] Universal coalgebra: a theory of systems. Theoretical Computer Science, 249:3–80, 2000..
[Rut03] Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science, 308:1–53, 2003..
[SP82] The category theoretic solution of recursive domain equations. SIAM Journal of Computing, 11:761–783, 1982. and .
[SR07] Logic, Language, Information and Computation, 14th International Workshop, WoLLIC 2007, number 4576 in Lecture Notes in Computer Science, pages 322–336. Springer, 2007. and . Behavioural differential equations and coinduction for binary trees. In and , editors,
[TP97] Logic in Computer Science, pages 280–291. IEEE, Computer Science Press, 1997. and . Towards a mathematical operational semantics. In , editor,
[Tur96] 1996.. Functorial operational semantics and its denotational dual. PhD thesis, Free University Amsterdam,
[Wal91] Categories and Computer Science. Carslaw Publications, Sydney, 1991. Also available as: Cambridge Computer Science Text 28, 1992..
[Wec92] Universal Algebra for Computer Scientists. Number 25 in EATCS Monographs. Springer, Berlin, 1992..
[Wir90] Handbook of Theoretical Computer Science, volume B, pages 673–788. Elsevier/MIT Press, 1990.. Algebraic specification. In , editor,