[1] A., Abel, B., Pientka, D., Thibodeau, and A., Setzer. Copatterns: Programming infinite structures by observations. In Principles of Programming Languages, pages 27–38. ACM Press, New York, 2013.
[2] M., Abott, T., Altenkirch, and N., Ghani. Containers: Constructing strictly positive types.
Theor. Comp. Sci., 342:3–27, 2005.
[3] M., Abott, T., Altenkirch, N., Ghani, and C., McBride. Categories of containers. In A.D., Gordon, editor, Foundations of Software Science and Computation Structures, number 2620 in Lect. Notes Comp. Sci., pages 23–38. Springer, Berlin, 2003.
[4] M., Abott, T., Altenkirch, N., Ghani, and C., McBride. Derivatives of containers. In M., Hofmann, editor, Typed Lambda Calculi and Applications, number 2701 in Lect. Notes Comp. Sci., pages 23–38. Springer, Berlin, 2003.
[5] S., Abramsky. A domain equation for bisimulation.
Inf. & Comp., 92:161–218, 1990.
[6] S., Abramsky. Domain theory in logical form.
Ann. Pure & Appl. Logic, 51(1/2):1–77, 1991.
[7] S., Abramsky. Coalgebras, Chu spaces, and representations of physical systems.
J. Philosophical Logic
42(3):551–574, 2013.
[8] S., Abramsky and B., Coecke. A categorical semantics of quantum protocols. In K., Engesser, Dov M., Gabbai, and D., Lehmann, editors, Handbook of Quantum Logic and Quantum Structures: Quantum Logic, pages 261–323. North Holland, Elsevier, Computer Science Press, 2009.
[9] P., Aczel. Non-Well-Founded Sets. Center for the Study of Language and Information (CSLI) Lecture Notes 14, Stanford, CA, 1988.
[10] P., Aczel. Final universes of processes. In S., Brookes, M., Main, A., Melton, M., Mislove, and D., Schmidt, editors, Mathematical Foundations of Programming Semantics, number 802 in Lect. Notes Comp. Sci., pages 1–28. Springer, Berlin, 1994.
[11] P., Aczel, J., Adámek, S., Milius, and J., Velebil. Infinite trees and completely iterative theories: A coalgebraic view.
Theor. Comp. Sci., 300 (1–3):1–45, 2003.
[12] P., Aczel and N., Mendler. A final coalgebra theorem. In D., Pitt, A., Poigné, and D., Rydeheard, editors, Category Theory and Computer Science, number 389 in Lect. Notes Comp. Sci., pages 357–365. Springer, Berlin, 1989.
[13] J., Adámek. Free algebras and automata realizations in the language of categories.
Comment. Math. Univ. Carolinae, 15:589–609, 1974.
[14] J., Adámek. Observability and Nerode equivalence in concrete categories. In F. Gécseg, editor, Fundamentals of Computation Theory, number 117 in Lect. Notes Comp. Sci., pages 1–15. Springer, Berlin, 1981.
[15] J., Adámek. On final coalgebras of continuous functors.
Theor. Comp. Sci., 294:3–29, 2003.
[16] J., Adámek. Introduction to coalgebra.
Theor. Appl. Categ., 14(8):157–199, 2005.
[17] J., Adámek. A logic of coequations. In L., Ong, editor, Computer Science Logic, number 3634 in Lect. Notes Comp. Sci., pages 70–86. Springer, Berlin, 2005.
[18] J., Adámek and V., Koubek. On the greatest fixed point of a set functor.
Theor. Comp. Sci., 150:57–75, 1995.
[19] J., Adámek and C., Kupke, editors. Coalgebraic Methods in Computer Science (CMCS 2008), volume 203(5) of Elect. Notes in Theor. Comp. Sci., 2008.
[20] J., Adámek and C., Kupke, editors. Coalgebraic Methods in Computer Science (CMCS 2008), volume 208(12) of Inf. & Comp., 2010.
[21] J., Adámek, D., Lücke, and S., Milius. Recursive coalgebras of finitary functors.
RAIRO-Theor. Inform. and Appl., 41:447–462, 2007.
[22] J., Adámek and S., Milius, editors. Coalgebraic Methods in Computer Science (CMCS'04), number 106 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2004.
[23] J., Adámek and S., Milius, editors. Coalgebraic Methods in Computer Science (CMCS 2004), volume 204(4) of Inf. & Comp., 2006.
[24] J., Adámek, S., Milius, and J., Velebil. A general final coalgebra theorem.
Math. Struct. in Comp. Sci., 15(3):409–432, 2005.
[25] J., Adámek, S., Milius, and J., Velebil. Elgot algebras.
Log. Methods Comput. Sci., 2(5), 2006.
[26] J., Adámek, S., Milius, and J., Velebil. Algebras with parametrized iterativity.
Theor. Comp. Sci., 388:130–151, 2007.
[27] J., Adámek, S., Milius, and J., Velebil. Equational properties of iterative monads.
Inf. & Comp., 208(12):1306–1348, 2010.
[28] J., Adámek and H.-E., Porst. From varieties of algebras to varieties of coalgebras. In A., Corradini, M., Lenisa, and U., Montanari, editors, Coalgebraic Methods in Computer Science, number 44(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2001.
[29] J., Adámek and H.-E., Porst. On tree coalgebras and coalgebra presentations.
Theor. Comp. Sci., 311:257–283, 2004.
[30] J., Adámek and V., Trnková. Automata and Algebras in Categories. Kluwer Academic Publishers, Dordrecht, 1990.
[31] J., Adámek and J., Velebil. Analytic functors and weak pullbacks.
Theory and Appl. of Categories, 21(11):191–209, 2008.
[32] L., Adleman. Computing with DNA.
Scientific American, 279(2):54–61, 1998.
[33] A., Aho, R., Sethi, and J., Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, MA, 1985.
[34] R., Amadio and P.-L., Curien. Domains and Lambda-Calculi. Number 46 in Tracts in Theor. Comp. Sci. Cambridge University Press, Cambridge, 1998.
[35] M., Arbib and E., Manes. Foundations of system theory: Decomposable systems.
Automatica, 10:285–302, 1974.
[36] M., Arbib and E., Manes. Adjoint machines, state-behaviour machines, and duality.
J. Pure & Appl. Algebra, 6:313–344, 1975.
[37] M., Arbib and E., Manes. Arrows, Structures and Functors: The Categorical Imperative. Academic Press, New York, 1975.
[38] M., Arbib and E., Manes. Foundations of system theory: The Hankel matrix.
J. Comp. Syst. Sci, 20:330–378, 1980.
[39] M., Arbib and E., Manes. Generalized Hankel matrices and system realization.
SIAM J. Math. Analysis, 11:405–424, 1980.
[40] M., Arbib and E., Manes. Machines in a category.
J. Pure & Appl. Algebra, 19:9–20, 1980.
[41] M., Arbib and E., Manes. Parametrized data types do not need highly constrained parameters.
Inf. & Control, 52:139–158, 1982.
[42] M.A., Arbib. Theories of Abstract Automata. Prentice Hall, Englewood Cliffs, NJ, 1969.
[43] K., Arnold and J., Gosling. The Java Programming Language. The Java Series. Addison-Wesley, 2nd edition, 1997.
[44] R., Atkey, N., Ghani, B., Jacobs, and P., Johann. Fibrational induction meets effects. In L., Birkedal, editor, Foundations of Software Science and Computation Structures, number 7213 in Lect. Notes Comp. Sci., pages 42–57. Springer, Berlin, 2012.
[45] R., Atkey, P., Johann, and N., Ghani. When is a type refinement an inductive type? InM., Hofmann, editor, Foundations of Software Science and Computation Structures, number 6604 in Lect. Notes Comp. Sci., pages 72–87. Springer, Berlin, 2011.
[46] S., Awodey. Category Theory. Oxford Logic Guides. Oxford University Press, Oxford, 2006.
[47] S., Awodey and J., Hughes. Modal operators and the formal dual of Birkhoff's completeness theorem.
Math. Struct. Comp. Sci., 13:233–258, 2003.
[48] E., Bainbridge. A unified minimal realization theory with duality. PhD thesis, University of Michigan, Ann Arbor, 1972. Technical report 140, Department of Computer and Communication Sciences.
[49] E., Bainbridge, P., Freyd, A., Scedrov, and P., Scott. Functorial polymorphism.
Theor. Comp. Sci., 70(1):35–64, 1990. Corrigendum in Theor. Comp. Sci. 71(3):431, 1990.
[50] J. de, Bakker and E., Vink. Control Flow Semantics. MIT Press, Cambridge, MA, 1996.
[51] A., Balan and A., Kurz. On coalgebras over algebras.
Theor. Comp. Sci., 412(38):4989–5005, 2011.
[52] A-L., Barabási. Linked: The New Science of Networks. Perseus Publishing,
Cambridge, MA, 2002.
[53] L., Barbosa. Towards a calculus of state-based software components.
J. Universal Comp. Sci., 9(8):891–909, 2003.
[54] H., Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 2nd rev. edition, 1984.
[55] M., Barr. Terminal coalgebras in well-founded set theory.
Theor. Comp. Sci., 114(2):299–315, 1993. Corrigendum in Theor. Comp. Sci. 124:189–192, 1994.
[56] M., Barr and Ch., Wells. Toposes, Triples and Theories. Springer, Berlin, 1985. Revised and corrected version available at www.cwru.edu/artsci/math/wells/pub/ttt.html.
[57] M., Barr and Ch., Wells. Category Theory for Computing Science. Prentice Hall, Englewood Cliffs, NJ, 1990.
[58] F., Bartels. On generalised coinduction and probabilistic specification formats: Distributive laws in coalgebraic modelling. PhD thesis, Free University of Amsterdam, 2004.
[59] F., Bartels, A., Sokolova, and E. de Vink. A hierarchy of probabilistic system types. In H.-P., Gumm, editor, Coalgebraic Methods in Computer Science, number 82(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2003.
[60] J., Barwise and L., Moss. Vicious Circles: On the Mathematics of Nonwellfounded Phenomena. CSLI Lecture Notes 60, Stanford, CA, 1996.
[61] J., Beck. Distributive laws. In B., Eckman, editor, Seminar on Triples and Categorical Homology Theory, number 80 in Lect. Notes Math., pages 119–140. Springer, Berlin, 1969.
[62] M., Behrisch, S., Kerkhoff, and J., Power. Category theoretic understandings of universal algebra and its dual: Monads and Lawvere theories, comonads and what? In U., Berger and M., Mislove, editors, Mathematical Foundations of Programming Semantics, number 286 in Elect. Notes in Theor. Comp. Sci., pages 5–16. Elsevier, Amsterdam, 2012.
[63] J. van, Benthem. Correspondence theory. In D., Gabbay and F., Guenthner, editors, Handbook of Philosophical Logic II, pages 167–247, Reidel, Dordrecht, 1984.
[64] N., Benton, G., Bierman, M., Hyland, and V. de Paiva. Linear lambda calculus and categorical models revisited. In E. Börger, G. J.ager, H., Kleine Büning, S., Martini, and M.M., Richter, editors, Computer Science Logic, number 702 in Lect. Notes Comp. Sci., pages 61–84. Springer, Berlin, 1993.
[65] N., Benton, J., Hughes, and E.Moggi.Monads and effects. In G., Barthe, P., Dybjer, L., Pinto, and J., Saraiva, editors, Applied Semantics, number 2395 in Lect. Notes Comp. Sci., pages 923–952. Springer, Berlin, 2002.
[66] J. van den, Berg and B., Jacobs. The LOOP compiler for Java and JML., In
T., Margaria and W., Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems, number 2031 in Lect. Notes Comp. Sci., pages 299–312. Springer, Berlin, 2001.
[67] J., Bergstra, A., Ponse, and S.A., Smolka, editors. Handbook of Process Algebra. North-Holland, Amsterdam, 2001.
[68] M., Bidoit and R., Hennicker. Proving the correctness of behavioural implementations. In V.S., Alagar and M., Nivat, editors, Algebraic Methods and Software Technology, number 936 in Lect. Notes Comp. Sci., pages 152–168. Springer, Berlin, 1995.
[69] M., Bidoit, R., Hennicker, and A., Kurz. On the duality between observability and reachability. In F., Honsell and M., Miculan, editors, Foundations of Software Science and Computation Structures, number 2030 in Lect. Notes Comp. Sci., pages 72–87. Springer, Berlin, 2001.
[70] M., B'ılková, A., Kurz, D., Petrisan, and J., Velebil. Relation liftings on preorders and posets. In B., Klin and C. Cˆırstea, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), number 6859 in Lect. Notes Comp. Sci., pages 115–129. Springer, Berlin, 2011.
[71] R., Bird. Introduction to Functional Programming Using Haskell. Prentice Hall, Englewood Cliffs, NJ, 2nd edition, 1998.
[72] R., Bird and O. de Moor. Algebra of Programming. Prentice Hall Int. Series in Comput. Sci., Englewood Cliffs, NJ, 1996.
[73] P., Blackburn, M. de Rijke, and Y., Venema. Modal Logic. Number 53 in Tracts in Theor. Comp. Sci. Cambridge University Press, Cambridge, 2001.
[74] B., Bloom, S., Istrail, and A.R., Meyer. Bisimulation can't be traced. J. ACM, 42(1):232–268, 1988.
[75] S.L., Bloom and Z., Ésik. Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs. Springer, Berlin, 1993.
[76] F., Bonchi, M., Bonsangue, M., Boreale, J., Rutten, and A., Silva. A coalgebraic perspective on linear weighted automata.
Inf. & Comp., 211:77–105, 2012.
[77] F., Bonchi, M., Bonsangue, H., Hansen, P., Panangaden, J., Rutten, and A., Silva. Algebra–coalgebra duality in Brzozowski's minimization algorithm. ACM
Trans. Computational Logic, 15(1), 2014.
[78] F., Bonchi and U., Montanari. Reactive systems, (semi-)saturated semantics and coalgebras on presheaves.
Theor. Comp. Sci., 410(41):4044–4066, 2009.
[79] F., Bonchi and D., Pous. Hacking nondeterminism with induction and coinduction.
Communications of the ACM, 58(2):87–95, 2015.
[80] F., Bonchi and F., Zanasi. Saturated semantics for coalgebraic logic programming. In R., Heckel and S., Milius, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2013), number 8089 in Lect. Notes Comp. Sci., pages 80–94. Springer, Berlin, 2013.
[81] F., Bonchi and F., Zanasi. Bialgebraic semantics for logic programming.
Logical Methods in Comp. Sci., 11(1):1–47, 2015.
[82] M., Bonsangue, editor. CoalgebraicMethods in Computer Science (CMCS 2014), number 8446 in Lect. Notes Comp. Sci. Springer, Berlin, 2014.
[83] M., Bonsangue, editor. Coalgebraic Methods in Computer Science 2014, volume 604 of Theor. Comp. Sci., 2015.
[84] M., Bonsangue, J., Rutten, and A., Silva. Coalgebraic logic and synthesis of Mealy machines. In R., Amadio, editor, Foundations of Software Science and Computation Structures, number 4962 in LNCS, pages 231–245. Springer, Berlin, 2008.
[85] F., Borceux. Handbook of Categorical Algebra, volumes 50–52 of Encyclopedia of Mathematics. Cambridge University Press, Cambridge, 1994.
[86] F. van, Breugel and J., Worrell. An algorithm for quantitative verification of probabilistic transition systems in Java for smart cards. In K.G., Larsen and M., Nielsen, editors, CONCUR 2001 – Concurrency Theory, number 2154 in Lect. Notes Comp. Sci., pages 336–350. Springer, Berlin, 2001.
[87] R., Brown. Topology. John Wiley & Sons, New York, 2nd rev. edition, 1988.
[88] K.B., Bruce, L., Cardelli, G., Castagna, the Hopkins Objects Group (J., Eifrig, S., Smith, V., Trifonov), G., Leavens, and B., Pierce. On binary methods.
Theory & Practice of Object Systems, 1(3):221–242, 1996.
[89] J.A., Brzozowski. Derivatives of regular expressions. J. ACM, 11(4):481–494, 1964.
[90] P., Buchholz. Bisimulation relations for weighted automata.
Theor. Comp. Sci., 393(1–3):109–123, 2008.
[91] L., Burdy, Y., Cheon, D., Cok, M., Ernst, J., Kiniry, G., Leavens, K., Leino, and E., Poll. An overview of JML tools and applications.
Int. J. on Software Tools for Technology Transfer, 7(3):212–232, 2005.
[92] P.J., Cameron. Sets, Logic and Categories. Undergraduate Mathematics. Springer, London, 1999.
[93] V., Capretta, T., Uustalu, and V., Vene. Recursive coalgebras from comonads.
Theor. Comp. Sci., 204:437–468, 2006.
[94] A., Carboni, M., Kelly, and R., Wood. A 2-categorical approach to change of base and geometric morphisms I.
Cah. de Top. et Géom. Diff., 32(1):47–95, 1991.
[95] K., Cho, B., Jacobs, A., Westerbaan, and B., Westerbaan. An introduction to effectus theory. arxiv.org/abs/1512.05813, 2015.
[96] K., Cho, B., Jacobs, A., Westerbaan, and B., Westerbaan. Quotient comprehension chains. In C., Heunen, P., Selinger, and J., Vicary, editors, Quantum Physics and Logic (QPL) 2015, number 195 in Elect. Proc. in Theor. Comp. Sci., pages 136–147, 2015.
[97] V., Ciancia. Accessible functors and final coalgebras for named sets. PhD thesis, University of Pisa, 2008.
[98] C., Cïrstea. Integrating observational and computational features in the specification of state-based dynamical systems.
Inf. Théor. et Appl., 35(1):1–29, 2001.
[99] C., Cïrstea, A., Kurz, D., Pattinson, L., Schröder, and Y., Venema. Modal logics are coalgebraic.
The Computer Journal, 54:31–41, 2011.
[100] C., Cïrstea and D., Pattinson. Modular construction of complete coalgebraic logics.
Theor. Comp. Sci., 388(1–3):83–108, 2007.
[101] R., Cockett. Introduction to distributive categories.
Math. Struct. in Comp. Sci., 3:277–307, 1993.
[102] R., Cockett. Deforestation, program transformation, and cut-elimination. In A., Corradini, M., Lenisa, and U., Montanari, editors, Coalgebraic Methods in Computer Science, number 44(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2001.
[103] R., Cockett and T., Fukushima. About Charity. Technical Report 92/480/18, Department of Computer Science University of Calgary, 1992.
[104] R., Cockett and D., Spencer. Strong categorical datatypes I., In
R.A.G., Seely, editor, International Meeting on Category Theory 1991, Canadian Mathematical Society Proceedings, vol. 13, pp. 141–169, AMS, Montreal, 1992.
[105] R., Cockett and D., Spencer. Strong categorical datatypes II: A term logic for categorical programming.
Theor. Comp. Sci., 139:69–113, 1995.
[106] B., Coecke and K., Martin. A partial order on classical and quantum states. In B., Coecke, editor, New Structures in Physics, number 813 in Lect. Notes Physics, pages 593–683. Springer, Berlin, 2011.
[107] M., Comini, G., Levi, and M., Meo. A theory of observables for logic programs.
Inf. & Comp., 169(1):23–80, 2001.
[108] A., Corradini, B., Klin, and C., Cïrstea, editors. Coalgebra and Algebra in Computer Science (CALCO'11), number 6859 in Lect. Notes Comp. Sci. Springer, Berlin, 2011.
[109] A., Corradini, M., Lenisa, and U., Montanari, editors. Coalgebraic Methods in Computer Science (CMCS'01), number 44(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2001.
[110] A., Corradini, M., Lenisa, and U., Montanari, editors. Coalgebraic Methods in Computer Science, volume 13(2) of Math. Struct. in Comp. Sci., 2003. Special issue on CMCS'01.
[111] D., Coumans and B., Jacobs. Scalars, monads and categories. In C., Heunen, M., Sadrzadeh, and E., Grefenstette, editors, Quantum Physics and Linguistics: A Compositional, Diagrammatic Discourse, pages 184–216. Oxford University Press, Oxford, 2013.
[112] S., Coupet-Grimal and L., Jakubiec. Hardware verification using co-induction in COQ., In
Y., Bertot, G., Dowek, A., Hirschowitz, C., Paulin, and L., Théry, editors, Theorem Proving in Higher Order Logics, number 1690 in Lect. Notes Comp. Sci., pages 91–108. Springer, Berlin, 1999.
[113] R., Crole. Categories for Types. Cambridge Mathematical Textbooks. Cambridge University Press, 1993.
[114] N.J., Cutland. Computability. Cambridge University Press, 1980.
[115] G., D'Agostino and A., Visser. Finality regained: A coalgebraic study of Scottsets and multisets.
Arch. Math. Log., 41:267–298, 2002.
[116] D. van, Dalen, C., Doets, and H. de Swart. Sets: Naive, Axiomatic and Applied. Number 106 in Pure & Applied Math. Pergamon Press, 1978.
[117] V., Danos, J., Desharnais, F., Laviolette, and P., Panangaden. Bisimulation and cocongruence for probabilistic systems.
Inf. & Comp., 204:503–523, 2006.
[118] P., D'Argenio, H., Hermanns, and J.-P., Katoen. On generative parallel composition. In C., Baier, M., Huth, M., Kwiatkowska, and M., Ryan, editors, Workshop on Probabilistic Methods in Verification (ProbMIV), number 22 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1998.
[119] B., Davey and H., Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
[120] L., Dennis and A., Bundy. A comparison of two proof critics: Power vs. robustness. In V.A., Carre~no, C.A., Mu~noz, and S., Tahar, editors, Theorem Proving in Higher Order Logics, number 2410 in Lect. Notes Comp. Sci., pages 182–197. Springer, Berlin, 2002.
[121] E., D'Hondt and P., Panangaden. Quantum weakest preconditions.
Math. Struct. in Comp. Sci., 16(3):429–451, 2006.
[122] E., Dijkstra and C., Scholten. Predicate Calculus and Program Semantics. Springer, Berlin, 1990.
[123] H., Dobbertin. Refinement monoids, Vaught monoids, and Boolean algebras.
Math. Annalen, 265(4):473–487, 1983.
[124] E.-E., Doberkat. Stochastic Coalgebraic Logic. Springer, 2010.
[125] M., Droste and P., Gastin. Weighted automata and weighted logics. In L., Caires, G., Italiano, L., Monteiro, C., Palamidessi, and M., Yung, editors, International Colloquium on Automata, Languages and Programming, number 3580 in Lect. Notes Comp. Sci., pages 513–525. Springer, Berlin, 2005.
[126] H., Ehrig and B., Mahr. Fundamentals of Algebraic Specification I: Equations and Initial Semantics. Number 6 in EATCS Monographs. Springer, Berlin, 1985.
[127] S., Eilenberg. Automata, Languages and Machines. Academic Press, 1974. 2 volumes.
[128] E., Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995–1072. Elsevier/MIT Press, 1990.
[129] R., Fagin, J.Y., Halpern, Y., Moses, and M.Y., Vardi. Reasoning about Knowledge. MIT Press, Cambridge, MA, 1995.
[130] J., Fiadeiro, N., Harman, M., Roggenbach, and J., Rutten, editors. Coalgebra and Algebra in Computer Science (CALCO'05), number 3629 in Lect. Notes Comp. Sci. Springer, Berlin, 2005.
[131] K., Fine. In so many possible worlds.
Notre Dame J. Formal Log., 13:516–520, 1972.
[132] M., Fiore. Axiomatic Domain Theory in Categories of Partial Maps. Cambridge University Press, Cambridge, 1996.
[133] M., Fiore. A coinduction principle for recursive data types based on bisimulation.
Inf. & Comp., 127(2):186–198, 1996.
[134] M., Fiore, N., Gambino, M., Hyland, and G., Winskel. The cartesian closed bicategory of generalised species of structures.
J. London Math. Soc., 77(2): 203–220, 2008.
[135] M., Fiore and C.-K., Hur. Equational systems and free constructions (extended abstract). In L., Arge, C., Cachin, T., Jurdzinski, and A., Tarlecki, editors, International Colloquium on Automata, Languages and Programming, number 4596 in LNCS, pages 607–618. Springer, Berlin, 2007.
[136] M., Fiore, G., Plotkin, and D., Turi. Abstract syntax and variable binding. In Logic in Computer Science, pages 193–202. IEEE, Computer Science Press, Washington, DC, 1999.
[137] M., Fiore and D., Turi. Semantics of name and value passing. In Logic in Computer Science, pages 93–104. IEEE, Computer Science Press, Boston, 2001.
[138] M., Fokkinga. Datatype laws without signatures.
Math. Struct. in Comp. Sci., 6:1–32, 1996.
[139] W., Fokkink. Introduction to Process Algebra. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, 2000.
[140] M., Forti and F., Honsell. Set theory with free construction principles.
Annali Scuola Normale Superiore, Pisa, X(3):493–522, 1983.
[141] A., Fraenkel, Y., Bar-Hillel, and A., Levy. Foundations of Set Theory. North-Holland, Amsterdam, 2nd rev. edition, 1973.
[142] P., Freyd. Aspects of topoi.
Bull. Austr. Math. Soc., 7:1–76 and 467–480, 1972.
[143] P., Freyd. Recursive types reduced to inductive types. In Logic in Computer Science, pages 498–507. IEEE, Computer Science Press, Philadelphia, 1990.
[144] P., Freyd. Algebraically complete categories. In A., Carboni, M.C., Pedicchio, and G., Rosolini, editors, Como Conference on Category Theory, number 1488 in Lect. Notes Math., pages 95–104. Springer, Berlin, 1991.
[145] P., Freyd. Remarks on algebraically compact categories. In M., Fourman, P., Johnstone, and A., Pitts, editors, Applications of Categories in Computer Science, number 177 in LMS, pages 95–106. Cambridge University Press, 1992.
[146] P., Freyd and M., Kelly. Categories of continuous functors.
J. Pure & Appl. Algebra, 2:169–191, 1972.
[147] H., Friedman. Equality between functionals. In Logic Colloquium. Symposium on Logic Held at Boston 1972–1973, number 453 in Lect. Notes Math., pages 22–37. Springer, Berlin, 1975.
[148] M., Gabbay and A., Pitts. A new approach to abstract syntax with variable binding.
Formal Aspects Comp., 13:341–363, 2002.
[149] N., Ghani, F., Nordvall Forsberg, and A., Simpson. Comprehensive parametric polymorphism: Categorical models and type theory. In B., Jacobs and C. Löding, editors, Foundations of Software Science and Computation Structures, number 9634 in Lect. Notes Comp. Sci., pages 3–19. Springer, Berlin, 2016.
[150] N., Ghani, P., Johann, and C., Fumex. Generic fibrational induction.
Logical Methods in Comp. Sci., 8(2), 2012.
[151] N., Ghani and J., Power, editors. Coalgebraic Methods in Computer Science (CMCS 2006), volume 164(1) of Elect. Notes in Theor. Comp. Sci., 2006.
[152] V., Giarrantana, F., Gimona, and U., Montanari. Observability concepts in abstract data specifications. In A., Mazurkiewicz, editor, Mathematical Foundations of Computer Science, number 45 in Lect. Notes Comp. Sci., pages 576–587. Springer, Berlin, 1976.
[153] J., Gibbons. Origami programming. In J., Gibbons and O. de Moor, editors, The Fun of Programming, Cornerstones in Computing, pages 41–60. Palgrave, 2003.
[154] J., Gibbons, G., Hutton, and T., Altenkirch. When is a function a fold or an unfold? In A., Corradini, M., Lenisa, and U., Montanari, editors, Coalgebraic Methods in Computer Science, number 44(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2001.
[155] J.-Y., Girard. Linear logic.
Theor. Comp. Sci., 50:1–102, 1987.
[156] J.-Y., Girard. Normal functors, power series and λ-calculus.
Ann. Pure & Appl. Logic, 37:129–177, 1988.
[157] M., Giry. A categorical approach to probability theory. In B., Banaschewski, editor, Categorical Aspects of Topology and Analysis, number 915 in Lect. Notes Math., pages 68–85. Springer, Berlin, 1982.
[158] R. van, Glabbeek. The linear time-branching time spectrum II., In
E., Best, editor, CONCUR 93. 4th International Conference on Concurrency Theory, number 715 in Lect. Notes Comp. Sci., pages 66–81. Springer, Berlin, 1993.
[159] R. van, Glabbeek, S., Smolka, B., Steffen, and C., Tofts. Reactive, generative, and stratified models of probabilistic processes. In Logic in Computer Science, pages 130–141. IEEE, Computer Science Press, Philadelphiaa, 1990.
[160] J., Goguen. Minimal realization of machines in closed categories.
Bull. Amer. Math. Soc., 78(5):777–783, 1972.
[161] J., Goguen. Realization is universal.
Math. Syst. Theor., 6(4):359–374, 1973.
[162] J., Goguen. Discrete-time machines in closed monoidal categories. I.
J. Comp. Syst. Sci, 10:1–43, 1975.
[164] J., Goguen and G., Malcolm. A hidden agenda.
Theor. Comp. Sci., 245(1):55–101, 2000.
[163] J., Goguen, K., Lin, and G., Rosu. Circular coinductive rewriting. In Automated Software Engineering (ASE'00), pages 123–131. IEEE Press, Grenoble, 2000.
[165] J., Goguen, J., Thatcher, and E., Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. In R., Yeh, editor, Current Trends in Programming Methodology, pages 80–149. Prentice Hall, Englewood Cliffs, NJ, 1978.
[166] R., Goldblatt. Topoi: The Categorial Analysis of Logic. North-Holland, Amsterdam, 2nd rev. edition, 1984.
[167] R., Goldblatt. Logics of Time and Computation. CSLI Lecture Notes 7, Stanford, CA, 2nd rev. edition, 1992.
[168] R., Goldblatt. What is the coalgebraic analogue of Birkhoff's variety theorem?
Theor. Comp. Sci., 266(1–2):853–886, 2001.
[169] R., Goldblatt. A comonadic account of behavioural covarieties of coalgebras.
Math. Struct. in Comp. Sci., 15(2):243–269, 2005.
[170] R., Goldblatt. Final coalgebras and the Hennessy–Milner property.
Ann. Pure & Appl. Logic, 183:77–93, 2006.
[171] S., Goncharov, S., Milius, and A., Silva. Towards a coalgebraic Chomsky hierarchy. In J., Diaz, I., Lanese, and D., Sangiorgi, editors, Theoretical Computer Science – 8th IFIP TC 1/WG 2.2 International Conference, number 8705 in Lect. Notes Comp. Sci., pages 265–280. Springer, Berlin, 2014.
[172] A., Gordon. Bisimilarity as a theory of functional programming. In S., Brookes, M., Main, A., Melton, and M., Mislove, editors, Mathematical Foundations of Programming Semantics, number 1 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1995.
[173] J., Gosling, B., Joy, G., Steele, and G., Bracha. The Java Language Specification. The Java Series, 2nd edition. Addison-Wesley, 2000.
[174] S., Gould. What does the dreaded “E” word mean anyway? In I Have Landed: The End of a Beginning in Natural History, pages 241–256. Three Rivers Press, New York, 2002.
[175] J.-F., Groote and F., Vaandrager. Structured operational semantics and bisimulation as a congruence.
Inf. & Comp., 100(2):202–260, 1992.
[176] H.-P., Gumm. Elements of the general theory of coalgebras. Notes of lectures given at LUATCS'99: Logic, Universal Algebra, Theoretical Computer Science, Johannesburg, 1999.
[177] H.-P., Gumm. Birkhoff's variety theorem for coalgebras.
Contributions to General Algebra, 13:159–173, 2000.
[178] H.-P., Gumm. Universelle coalgebra, 2001. Appendix in [235].
[179] H.-P., Gumm. Copower functors.
Theor. Comp. Sci., 410:1129–1142, 2002.
[180] H.-P., Gumm, editor. Coalgebraic Methods in Computer Science (CMCS'03), number 82(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2003.
[181] H.-P., Gumm, editor. Coalgebraic Methods in Computer Science, volume 327 of Theor. Comp. Sci., 2004. Special issue on CMCS'03.
[182] H.-P., Gumm, J., Hughes, and T., Schröder. Distributivity of categories of coalgebras.
Theor. Comp. Sci., 308:131–143, 2003.
[183] H.-P., Gumm and T., Schröder. Covarieties and complete covarieties. In B., Jacobs, L., Moss, H., Reichel, and J., Rutten, editors, Coalgebraic Methods in Computer Science, number 11 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1998.
[184] H.-P., Gumm and T., Schröder. Coalgebraic structure from weak limit preserving functors. In H., Reichel, editor, Coalgebraic Methods in Computer Science, number 33 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2000.
[185] H.-P., Gumm and T., Schröder. Monoid-labeled transition systems. In A., Corradini, M., Lenisa, and U., Montanari, editors, Coalgebraic Methods in Computer Science, number 44(1) in Elect. Notes in Theor. Comp. Sci., pages 185–204. Elsevier, Amsterdam, 2001.
[186] H.-P., Gumm and T., Schröder. Products of coalgebras.
Algebra Universalis, 846:163–185, 2001.
[187] H.-P., Gumm and T., Schröder. Coalgebras of bounded type.
Math. Struct. in Comp. Sci., 12(5):565–578, 2002.
[188] C., Gunter. Semantics of Programming Languages: Structures and Techniques. MIT Press, Cambridge, MA, 1992.
[189] G., Gupta, A., Bansal, R., Min, L., Simon, and A., Mallya. Coinductive logic programming and its applications. In V., Dahl and I., Niemel.a, editors, Logic Programming, number 4670 in Lect. Notes Comp. Sci., pages 27–44. Springer, Berlin, 2007.
[190] G., Gupta, N., Saeedloei, B., DeVries, R., Min, K., Marple, and F., Kluzniak. Infinite computation, co-induction and computational logic. In A., Corradini, B., Klin, and C., Cïrstea, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), number 6859 in Lect. Notes Comp. Sci., pages 40–54. Springer, Berlin, 2011.
[191] T., Hagino. A categorical programming language. PhD thesis, University of Edinburgh, 1987. Technical report 87/38.
[192] T., Hagino. A typed lambda calculus with categorical type constructors. In D., Pitt, A Poigné, and D., Rydeheard, editors, Category and Computer Science, number 283 in Lect. Notes Comp. Sci., pages 140–157. Springer, Berlin, 1987.
[193] H.H., Hansen, C., Kupke, and R., Leal. Strong completeness for iteration-free coalgebraic dynamic logics. In J., Diaz, I., Lanese, and D., Sangiorgi, editors, Theoretical Computer Science, number 8705 in Lect. Notes Comp. Sci., pages 281–295. Springer, Berlin, 2014.
[194] H.H., Hansen, C., Kupke, and E., Pacuit. Neighbourhood structures: Bisimilarity and basic model theory.
Logical Methods in Comp. Sci., 5(2), 2009.
[195] H.H., Hansen and J., Rutten. Symbolic synthesis of Mealy machines from arithmetic bitstream functions.
Scientific Annals of Computer Science, 20:97–130, 2010.
[196] H.H., Hansen. Coalgebraic modelling: Applications in automata theory and modal logic. PhD thesis, Free University of Amsterdam, 2009.
[197] H., Hansson. Real-Time Safety Critical Systems: Time and Probability in Formal Design of Distributed Systems. Elsevier, New York, 1994.
[198] D., Harel, D., Kozen, and J., Tiuryn. Dynamic Logic. MIT Press, Cambridge, MA, 2000.
[199] R., Hasegawa. Categorical data types in parametric polymorphism.
Math. Struct. in Comp. Sci., 4:71–109, 1994.
[200] R., Hasegawa. Two applications of analytic functors.
Theor. Comp. Sci., 272(1–2):113–175, 2002.
[201] I., Hasuo. Generic weakest precondition semantics from monads enriched with order.
Theor. Comp. Sci., 604:2–29, 2015.
[202] I., Hasuo, C., Heunen, B., Jacobs, and A., Sokolova. Coalgebraic components in a many-sorted microcosm. In A., Kurz and A., Tarlecki, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2009), number 5728 in Lect. Notes Comp. Sci., pages 64–80. Springer, Berlin, 2009.
[203] I., Hasuo and B., Jacobs. Context-free languages via coalgebraic trace semantics. In J., Fiadeiro, N., Harman, M., Roggenbach, and J., Rutten, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2005), number 3629 in Lect. Notes Comp. Sci., pages 213–231. Springer, Berlin, 2005.
[204] I., Hasuo and B., Jacobs. Traces for coalgebraic components.
Math. Struct. in Comp. Sci., 21:267–320, 2011.
[205] I., Hasuo, B., Jacobs, and M., Niqui. Coalgebraic representation theory of fractals. In P., Selinger, editor, Mathematical Foundations of Programming Semantics, number 265 in Elect. Notes in Theor. Comp. Sci., pages 351–368. Elsevier, Amsterdam, 2010.
[206] I., Hasuo, B., Jacobs, and A., Sokolova. Generic trace theory via coinduction.
Logical Methods in Comp. Sci., 3(4:11), 2007.
[207] I., Hasuo, B., Jacobs, and A., Sokolova. The microcosm principle and concurrency in coalgebra. In R., Amadio, editor, Foundations of Software Science and Computation Structures, number 4962 in LNCS, pages 246–260. Springer, Berlin, 2008.
[208] S., Hayashi. Adjunction of semifunctors: Categorical structures in nonextensional lambda calculus.
Theor. Comp. Sci., 41:95–104, 1985.
[209] R., Heckel and S., Milius, editors. Conference on Algebra and Coalgebra in Computer Science (CALCO 2013), number 8089 in Lect. Notes Comp. Sci. Springer, Berlin, 2013.
[210] A., Heifetz and P., Mongin. Probability logic for type spaces.
Games and Economic Behavior, 35(1–2):31–53, 2001.
[211] A., Heifetz and D., Samet. Topology-free typology of beliefs.
J. Economic Theory, 82(2):324–341, 1998.
[212] M., Hennessy and R., Milner. Algebraic laws for nondeterminism and concurrency. J. ACM, 32-1:137–161, 1985.
[213] U., Hensel. Definition and proof principles for data and processes. PhD thesis, Technical University of Dresden, 1999.
[214] U., Hensel and B., Jacobs. Proof principles for datatypes with iterated recursion. In E., Moggi and G., Rosolini, editors, Category Theory and Computer Science, number 1290 in Lect. Notes Comp. Sci., pages 220–241. Springer, Berlin, 1997.
[215] U., Hensel and B., Jacobs. Coalgebraic theories of sequences in PVS.
J. Logic and Computation, 9(4):463–500, 1999.
[216] U., Hensel and D., Spooner. A view on implementing processes: Categories of circuits. In M., Haveraaen, O., Owe, and O.-J., Dahl, editors, Recent Trends in Data Type Specification, number 1130 in Lect. Notes Comp. Sci., pages 237–254. Springer, Berlin, 1996.
[217] C., Hermida. Fibrations, logical predicates and indeterminates. PhD thesis, University of Edinburgh, 1993. Technical report LFCS-93-277. Also available as Aarhus Univ. DAIMI technical report PB-462.
[218] C., Hermida and B., Jacobs. Structural induction and coinduction in a fibrational setting.
Inf. & Comp., 145:107–152, 1998.
[219] C., Heunen and B., Jacobs. Arrows, like monads, are monoids. In Mathematical Foundations of Programming Semantics, number 158 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2006.
[220] C., Heunen and B., Jacobs. Quantum logic in dagger kernel categories.
Order, 27(2):177–212, 2010.
[221] W., Hino, H., Kobayashi
I., Hasuo, and B., Jacobs. Healthiness from duality. Logic in Computer Science. To appear in the 2016 proceedings of http://ieeexplore.ieee.org/xpl/conhome.jsp?reload=true&punumber=1000420.
[222] M., Hirsch and S., Smale. Differential Equations, Dynamical Systems, and Linear Algebra. Academic Press, New York, 1974.
[223] C.A.R., Hoare. Communicating Sequential Processes. Prentice Hall, 1985. Available at www.usingcsp.com.
[224] D.R., Hofstadter. Gödel, Escher, Bach: An Eternal Golden Braid. Basic Books, New York, 1979.
[225] F., Honsell, M., Miculan, and I., Scagnetto. π-calculus in (co)inductive-type theory.
Theor. Comp. Sci., 253(2):239–285, 2001.
[226] R., Hoofman and I., Moerdijk. A remark on the theory of semi-functors.
Math. Struct. in Comp. Sci., 5(1):1–8, 1995.
[227] R.A., Howard. Dynamic Probabilistic Systems. John Wiley & Sons, New York, 1971.
[228] G., Hughes and M., Cresswell. A New Introduction to Modal Logic. Routledge, London and New York, 1996.
[229] J., Hughes. Generalising monads to arrows.
Science of Comput. Progr., 37:67–111, 2000.
[230] J., Hughes. Modal operators for coequations. In A., Corradini, M., Lenisa, and U., Montanari, editors, CoalgebraicMethods in Computer Science, number 44(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2001.
[231] J., Hughes. A study of categories of algebras and coalgebras. PhD thesis, Carnegie Mellon Unive, 2001.
[232] J., Hughes and B., Jacobs. Simulations in coalgebra.
Theor. Comp. Sci., 327(1–2):71–108, 2004.
[233] M., Hyland, G., Plotkin, and J., Power. Combining effects: Sum and tensor.
Theor. Comp. Sci., 357:70–99, 2006.
[234] M., Hyland and J., Power. The category theoretic understanding of universal algebra: Lawvere theories and monads. In L., Cardelli, M., Fiore, and G.Winskel, editors, Computation, Meaning, and Logic: Articles Dedicated to Gordon Plotkin, number 172 in Elect. Notes in Theor. Comp. Sci., pages 437–458. Elsevier, Amsterdam, 2007.
[235] T., Ihringer. Allgemeine Algebra, volume 10 of Berliner Studienreihe zur Mathematik. Heldermann Verlag, 2003.
[236] B., Jacobs. Mongruences and cofree coalgebras. In V.S., Alagar and M., Nivat, editors, Algebraic Methodology and Software Technology, number 936 in Lect. Notes Comp. Sci., pages 245–260. Springer, Berlin, 1995.
[237] B., Jacobs. Objects and classes, co-algebraically. In B., Freitag, C.B., Jones, C., Lengauer, and H.-J., Schek, editors, Object-Orientation with Parallelism and Persistence, pages 83–103. Kluwer Academic, Dordrecht, 1996.
[238] B., Jacobs. Invariants, bisimulations and the correctness of coalgebraic refinements. In M., Johnson, editor, Algebraic Methodology and Software Technology, number 1349 in Lect. Notes Comp. Sci., pages 276–291. Springer, Berlin, 1997.
[239] B., Jacobs. Categorical Logic and Type Theory. North Holland, Amsterdam, 1999.
[240] B., Jacobs. A formalisation of Java's exception mechanism. In D., Sands, editor, Programming Languages and Systems (ESOP), number 2028 in Lect. Notes Comp. Sci., pages 284–301. Springer, Berlin, 2001.
[241] B., Jacobs. Many-sorted coalgebraic modal logic: A model-theoretic study.
RAIRO-Theor. Inform. and Appl., 35(1):31–59, 2001.
[242] B., Jacobs. Comprehension for coalgebras. In L., Moss, editor, Coalgebraic Methods in Computer Science, number 65(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2002.
[243] B., Jacobs. The temporal logic of coalgebras via Galois algebras.
Math. Struct. in Comp. Sci., 12:875–903, 2002.
[244] B., Jacobs. Trace semantics for coalgebras. In J., Adámek and S., Milius, editors, CoalgebraicMethods in Computer Science, number 106 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2004.
[245] B., Jacobs. Weakest precondition reasoning for Java programs with JML annotations.
J. Logic and Algebraic Programming, 58:61–88, 2004.
[246] B., Jacobs. A bialgebraic review of deterministic automata, regular expressions and languages. In K., Futatsugi, J.-P., Jouannaud, and J., Meseguer, editors, Algebra, Meaning and Computation: Essays Dedicated to Joseph A., Goguen on the Occasion of His 65th Birthday, number 4060 in Lect. Notes Comp. Sci., pages 375–404. Springer, Berlin, 2006.
[247] B., Jacobs. Convexity, duality, and effects. In C., Calude and V., Sassone, editors, IFIP Theoretical Computer Science 2010, number 82(1) in IFIP Adv. in Inf. and Comm. Techn., pages 1–19. Springer, Boston, 2010.
[248] B., Jacobs. From coalgebraic to monoidal traces. In B., Jacobs, M., Niqui, J., Rutten, and A., Silva, editors, Coalgebraic Methods in Computer Science, volume 264 of Elect. Notes in Theor. Comp. Sci., pages 125–140. Elsevier, Amsterdam, 2010.
[249] B., Jacobs. Coalgebraic walks, in quantum and Turing computation. In M., Hofmann, editor, Foundations of Software Science and Computation Structures, number 6604 in Lect. Notes Comp. Sci., pages 12–26. Springer, Berlin, 2011.
[250] B., Jacobs. Probabilities, distribution monads, and convex categories.
Theor. Comp. Sci., 412(28):3323–3336, 2011.
[251] B., Jacobs. Bases as coalgebras.
Logical Methods in Comp. Sci., 9(3), 2013.
[252] B., Jacobs. Measurable spaces and their effect logic. In Logic in Computer Science. IEEE, Computer Science Press, 2013. Available at http://dblp.unitrier. de/db/conf/lics/lics2013.html#Jacobs13.
[253] B., Jacobs. Dijkstra and Hoare monads in monadic computation.
Theor. Comp. Sci., 604:30–45, 2015.
[254] B., Jacobs. A recipe for state and effect triangles. In L., Moss and P., Sobocinski, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2015),volume 35 of LIPIcs, pages 116–129. Schloss Dagstuhl, 2015.
[255] B., Jacobs, C., Heunen, and I., Hasuo. Categorical semantics for arrows.
J. Funct. Progr., 19(3-4):403–438, 2009.
[256] B., Jacobs, J., Kiniry, and M., Warnier. Java program verification challenges. In F. de Boer,M., Bonsangue, S., Graf, andW.-P. de Roever, editors, Formal Methods for Components and Objects (FMCO 2002), number 2852 in Lect. Notes Comp. Sci., pages 202–219. Springer, Berlin, 2003.
[257] B., Jacobs and J., Mandemaker. The expectation monad in quantum foundations. In B., Jacobs, P., Selinger, and B., Spitters, editors, Quantum Physics and Logic (QPL) 2011, number 95 in Elect. Proc. in Theor. Comp. Sci., pages 143–182, 2012.
[258] B., Jacobs and J., Mandemaker. Relating operator spaces via adjunctions. In J., Chubb, A., Eskandarian, and V., Harizanov, editors, Logic and Algebraic Structures in Quantum Computing, volume 45 of Lect. Notes in Logic, pages 123–150. Cambridge University Press, 2016.
[259] B., Jacobs, J., Mandemaker, and R., Furber. The expectation monad in quantum foundations. Inf. & Comp., 2016. Available at http://www.sciencedirect.com/science/article/pii/S0890540116000365.
[260] B., Jacobs, L., Moss, H., Reichel, and J., Rutten, editors. Coalgebraic Methods in Computer Science (CMCS'98), number 11 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1998.
[261] B., Jacobs, L., Moss, H., Reichel, and J., Rutten, editors. Coalgebraic Methods in Computer Science, volume 260(1/2) of Theor. Comp. Sci., 2001. Special issue on CMCS'98.
[262] B., Jacobs, M., Niqui, J., Rutten, and A., Silva, editors. Coalgebraic Methods in Computer Science, volume 264(2) of Elect. Notes in Theor. Comp. Sci., 2010. CMCS 2010, Tenth Anniversary Meeting.
[263] B., Jacobs, M., Niqui, J., Rutten, and A., Silva, editors. Coalgebraic Methods in Computer Science, volume 412(38) of Theor. Comp. Sci., 2011. CMCS 2010, Tenth Anniversary Meeting.
[264] B., Jacobs and E., Poll. Coalgebras and monads in the semantics of Java.
Theor. Comp. Sci., 291(3):329–349, 2003.
[265] B., Jacobs and E., Poll. Java program verification at Nijmegen: Developments and perspective. In K., Futatsugi, F., Mizoguchi, and N., Yonezaki, editors, Software Security: Theories and Systems, number 3233 in Lect. Notes Comp. Sci., pages 134–153. Springer, Berlin, 2004.
[266] B., Jacobs and J., Rutten. A tutorial on (co)algebras and (co)induction. EATCS
Bulletin, 62:222–259, 1997.
[267] B., Jacobs and J., Rutten, editors. Coalgebraic Methods in Computer Science (CMCS'99), number 19 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1999.
[268] B., Jacobs and J., Rutten, editors. Coalgebraic Methods in Computer Science, volume 280(1/2) of Theor. Comp. Sci., 2002. Special issue on CMCS'99.
[269] B., Jacobs and J., Rutten. A tutorial on (co)algebras and (co)induction. In D., Sangiorgi and J., Rutten, editors, Advanced Topics in Bisimulation and Coinduction, number 52 in Tracts in Theor. Comp. Sci., pages 38–99. Cambridge University Press, Cambridge, 2011.
[270] B., Jacobs and A., Silva. Initial algebras of terms with binding and algebraic structure. In C., Casadio, B., Coecke, M., Moortgat, and P., Scott, editors, Categories and Types in Logic, Language, and Physics, number 8222 in Lect. Notes Comp. Sci., pages 211–234. Springer, Berlin, 2014.
[271] B., Jacobs, A., Sliva, and A., Sokolova. Trace semantics via determinization. In L., Schröder and D., Patinson, editors, Coalgebraic Methods in Computer Science (CMCS 2012), number 7399 in Lect. Notes Comp. Sci., pages 109–129. Springer, Berlin, 2012.
[272] B., Jacobs, A., Sliva, and A., Sokolova. Trace semantics via determinization.
J. Computer and System Sci., 81(5):859–879, 2015.
[273] B., Jacobs and A., Sokolova. Exemplaric expressivity of modal logics.
J. Logic and Computation, 20(5):1041–1068, 2010.
[274] B., Jay. A semantics for shape.
Science of Comput. Progr., 25:251–283, 1995.
[275] B., Jay. Data categories. In M., Houle and P., Eades, editors, Computing: The Australasian Theory Symposium Proceedings, Melbourne, number 18 in Australian Comp. Sci. Comm., pages 21–28, 1996.
[276] B., Jay and J., Cockett. Shapely types and shape polymorphism. In D., Sannella, editor, Programming Languages and Systems (ESOP), number 788 in Lect. Notes Comp. Sci., pages 302–316. Springer, Berlin, 1994.
[277] J.-B., Jeannin, D., Kozen, and A., Silva. CoCaml: Programming with coinductive types. Technical report http://hdl.handle.net/1813/30798, Cornell University, 2012. Fundamenta Informaticae, to appear.
[278] J.-B., Jeannin, D., Kozen, and A., Silva. Language constructs for non-well-founded computation. In M., Felleisen and P., Gardner, editors, Programming Languages and Systems (ESOP), number 7792 in Lect. Notes Comp. Sci., pages 61–80. Springer, Berlin, 2013.
[279] P., Johnstone. Topos Theory. Academic Press, London, 1977.
[280] P., Johnstone. Stone Spaces. Number 3 in Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1982.
[281] P., Johnstone. Sketches of an Elephant: A Topos Theory Compendium. Number 44 in Oxford Logic Guides. Oxford University Press, Oxford, 2002. 2 volumes.
[282] P., Johnstone, J., Power, T., Tsujishita, H., Watanabe, and J., Worell. An axiomatics for categories of transition systems as coalgebras. In Logic in Computer Science. IEEE, Computer Science Press, 1998.
[283] P., Johnstone, J., Power, T., Tsujishita, H., Watanabe, and J., Worrell. On the structure of categories of coalgebras.
Theor. Comp. Sci., 260:87–117, 2001.
[284] S. Peyton, Jones and P., Wadler. Imperative functional programming. In Principles of Programming Languages, pages 71–84. ACM Press, 1993.
[285] A., Joyal. Foncteurs analytiques et espèces de structures. In G., Labelle and P., Leroux, editors, Combinatoire Enumerative, number 1234 in Lect. Notes Math., pages 126–159. Springer, Berlin, 1986.
[286] A., Joyal and I., Moerdijk. Algebraic Set Theory. Number 220 in London Math. Soc. Lecture Note Series. Cambridge University Press, 1995.
[287] R., Kalman, P., Falb, and M., Arbib. Topics in Mathematical System Theory. McGraw-Hill International Series in Pure and Appl. Mathematics, 1969.
[288] B. von, Karger. Temporal algebra.
Math. Struct. in Comp. Sci., 8:277–320, 1998.
[289] S., Kasangian, M., Kelly, and F., Rossi. Cofibrations and the realization of nondeterministic automata.
Cah. de Top. et Géom. Diff., 24:23–46, 1983.
[290] P., Katis, N., Sabadini, and R., Walters. Bicategories of processes.
J. Pure & Appl. Algebra, 115(2):141–178, 1997.
[291] Y., Kawahara and M., Mori. A small final coalgebra theorem.
Theor. Comp. Sci., 233(1–2):129–145, 2000.
[292] K., Keimel, A., Rosenbusch, and T., Streicher. Relating direct and predicate transformer partial correctness semantics for an imperative probabilisticnondeterministic language.
Theor. Comp. Sci., 412:2701–2713, 2011.
[293] J.G., Kemeny and J.L., Snell. Finite Markov Chains. Springer-Verlag, New York, 1976.
[294] S.C., Kleene. Representation of events in nerve nets and finite automata. In C. E., Shannon and J., McCarthy, editors, Automata Studies, number 34 in Annals of Mathematics Studies, pages 3–41. Princeton University Press, Princeton, NJ, 1956.
[295] A., Klein. Relations in categories.
Illinois J. Math., 14:536–550, 1970.
[296] B., Klin. The least fibred lifting and the expressivity of coalgebraic modal logic. In J., Fiadeiro, N., Harman, M., Roggenbach, and J., Rutten, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2005), number 3629 in Lect. Notes Comp. Sci., pages 247–262. Springer, Berlin, 2005.
[297] B., Klin. Coalgebraic modal logic beyond sets. In M., Fiore, editor, Mathematical Foundations of Programming Semantics, number 173 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2007.
[298] B., Klin. Bialgebras for structural operational semantics: An introduction.
Theor. Comp. Sci., 412(38):5043–5069, 2011.
[299] A., Kock. Monads on symmetric monoidal closed categories.
Arch. Math., 21:1–10, 1970.
[300] A., Kock. On double dualization monads.
Math. Scand., 27:151–165, 1970.
[301] A., Kock. Bilinearity and cartesian closed monads.
Math. Scand., 29:161–174, 1971.
[302] A., Kock. Closed categories generated by commutative monads.
J. Austr. Math. Soc., 12:405–424, 1971.
[303] A., Kock. Algebras for the partial map classifier monad. In A., Carboni, M.C., Pedicchio, and G., Rosolini, editors, Como Conference on Category Theory, number 1488 in Lect. Notes Math., pages 262–278. Springer, Berlin, 1991.
[304] A., Kock and G.E., Reyes. Doctrines in categorical logic. In J., Barwise, editor, Handbook of Mathematical Logic, pages 283–313. North-Holland, Amsterdam, 1977.
[305] E., Komendantskaya and J., Power. Coalgebraic semantics for derivations in logic programming. In B., Klin and C. Cˆırstea, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), number 6859 in Lect. Notes Comp. Sci., pages 268–282. Springer, Berlin, 2011.
[306] E., Komendantskaya, J., Power, and M., Schmidt. Coalgebraic logic programming: from semantics to implementation programming.
J. Logic and Computation, 26(2):745–783, 2016.
[307] B., König and S., Küpper. Generic partition refinement algorithms for coalgebras and an instantiation to weighted automata. In J., Diaz, I., Lanese, and D., Sangiorgi, editors, Theoretical Computer Science – 8th IFIP TC 1/WG 2.2 International Conference, number 8705 in Lect. Notes Comp. Sci., pages 311–325. Springer, Berlin, 2014.
[308] D., Kozen. Semantics of probabilistic programs.
J. Comp. Syst. Sci, 22(3): 328–350, 1981.
[309] D., Kozen. A completeness theorem for Kleene algebras and the algebra of regular events.
Inf. & Comp., 110(2):366–390, 1994.
[310] D., Kozen. Coinductive proof principles for stochastic processes.
Logical Methods in Comp. Sci., 3(4):1–14, 2007.
[311] D., Kozen. Optimal coin flipping. Unpublished manuscript, 2009.
[312] D., Kozen and A., Silva. Practical coinduction. Math. Struct. in Comp. Sci., 2016.
[313] M., Kracht. Tools and Techniques in Modal Logic. North Holland, Amsterdam, 1999.
[314] S., Krstić, J., Launchbury, and D., Pavlović. Categories of processes enriched in final coalgebras. In F., Honsell and M., Miculan, editors, Foundations of Software Science and Computation Structures, number 2030 in Lect. Notes Comp. Sci., pages 303–317. Springer, Berlin, 2001.
[315] C., Kupke, A., Kurz, and Y., Venema. Completeness of the finitary Moss logic. In C., Areces and R., Goldblatt, editors, Advances in Modal Logic 2008, volume 7, pages 193–217. King's College Publications, 2003.
[316] C., Kupke, A., Kurz, and Y., Venema. Stone coalgebras. In H.-P., Gumm, editor, Coalgebraic Methods in Computer Science, number 82(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2003.
[317] C., Kupke, A., Kurz, and Y., Venema. Stone coalgebras.
Theor. Comp. Sci., 327(1–2):109–134, 2004.
[318] C., Kupke and D., Pattinson. Coalgebraic semantics of modal logics: An overview.
Theor. Comp. Sci., 412(38):5070–5094, 2011.
[319] C., Kupke and Y., Venema. Coalgebraic automata theory: Basic results.
Logical Methods in Comp. Sci., 4:1–43, 2008.
[320] A., Kurz. Coalgebras and modal logic. Notes of lectures given at ESSLLI'01, Helsinki, 1999.
[321] A., Kurz. A covariety theorem for modal logic. In M., Zakharyaschev, K., Segerberg, M. de Rijke, and H., Wansang, editors, Advances in Modal Logic, volume 2, pages 367–380. CSLI Publications, Stanford, 2001.
[322] A., Kurz. Specifying coalgebras with modal logic.
Theor. Comp. Sci., 260(1–2):119–138, 2001.
[323] A., Kurz and R., Leal. Modalities in the Stone age: A comparison of coalgebraic logics.
Theor. Comp. Sci., 430:88–116, 2012.
[324] A., Kurz, D., Petrisan, P., Severi, and F.J. de Vries. Nominal coalgebraic data types with applications to lambda calculus. Logical Methods in Comp. Sci., 9(4):1–52, 2013.
[325] A., Kurz and J., Rosick'y. Operations and equations for coalgebras.
Math. Struct. in Comp. Sci., 15(1):149–166, 2005.
[326] A., Kurz and A., Tarlecki, editors. Coalgebra and Algebra in Computer Science (CALCO'09), number 5728 in Lect. Notes Comp. Sci. Springer, Berlin, 2009.
[327] J., Lambek. A fixed point theorem for complete categories.
Math. Zeitschr., 103:151–161, 1968.
[328] K., Larsen and A., Skou. Bisimulation through probabilistic testing.
Inf. & Comp., 94:1–28, 1991.
[329] F., Lawvere. Functorial semantics of algebraic theories and some algebraic problems in the context of functorial semantics of algebraic theories. PhD thesis, Columbia University, 1963. Reprinted in
Theory and Applications of Categories, 5:1–121, 2004.
[330] F., Lawvere and S., Schanuel. Conceptual Mathematics: A First Introduction to Categories. Cambridge University Press, Cambridge, 1997.
[331] T., Leinster. A general theory of self-similarity.
Advances in Math., 226(4): 2935–3017, 2011.
[332] T., Leinster. Basic Category Theory. Cambridge Studies in Advanced Mathematics. Cambridge Univesity Press, Cambridge, 2014.
[333] M., Lenisa, J., Power, and H., Watanabe. Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. In H., Reichel, editor, Coalgebraic Methods in Computer Science, number 33 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2000.
[334] M., Lenisa, J., Power, and H., Watanabe. Category theory for operational semantics.
Theor. Comp. Sci., 327 (1–2):135–154, 2004.
[335] P., Levy. Monads and adjunctions for global exceptions. In Mathematical Foundations of Programming Semantics, number 158 in Elect. Notes in Theor. Comp. Sci., pages 261–287. Elsevier, Amsterdam, 2006.
[336] S., Liang, P., Hudak, andM., Jones. Monad transformers and modular interpreters. In Principles of Programming Languages, pages 333–343. ACM Press, 1995.
[337] S., Lindley, Ph. Wadler, and J., Yallop. The arrow calculus.
J. Funct. Progr., 20(1):51–69, 2010.
[338] D., Lucanu, E.I., Goriac, G., Caltais, and G., Rosu. CIRC: A behavioral verification tool based on circular coinduction. In A., Kurz and A., Tarlecki, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2009), number 5728 in Lect. Notes Comp. Sci., pages 433–442. Springer, Berlin, 2009.
[339] G., Malcolm. Behavioural equivalence, bisimulation and minimal realisation. In M., Haveraaen, O., Owe, and O.J., Dahl, editors, Recent Trends in Data Type Specification, number 1130 in Lect. Notes Comp. Sci., pages 359–378. Springer, Berlin, 1996.
[340] E., Manes. Algebraic Theories. Springer, Berlin, 1974.
[341] E., Manes. Predicate Transformer Semantics. Number 33 in Tracts in Theor. Comp. Sci. Cambridge University Press, Cambridge, 1992.
[342] E., Manes and M., Arbib. Algebraic Appoaches to Program Semantics. Texts and Monogr. in Comp. Sci.,. Springer, Berlin, 1986.
[343] Z., Manna and A., Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, Berlin, 1992.
[344] S., Mac Lane. Categories for theWorking Mathematician. Springer, Berlin, 1971.
[345] S., Mac Lane. Mathematics: Form and Function. Springer, Berlin, 1986.
[346] S., Mac Lane and I., Moerdijk. Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Springer, New York, 1992.
[347] K., McMillan. Symbolic Model Checking. Kluwer Academic, Dordrecht, 1993.
[348] A., Melton, D., Schmidt, and G., Strecker. Galois connections and computer science applications. In D., Pitt, S., Abramsky, A., Poigné, and D., Rydeheard, editors, Category Theory and Computer Programming, number 240 in Lect. Notes Comp. Sci., pages 299–312. Springer, Berlin, 1985.
[349] M., Miculan. A categorical model of the fusion calculus. In Mathematical Foundations of Programming Semantics, number 218 in Elect. Notes in Theor. Comp. Sci., pages 275–293. Elsevier, Amsterdam, 2008.
[350] T., Miedaner. The soul of theMark III beast. In D.R., Hofstadter and D.C., Dennet, editors, The Mind's I, pages 109–113. Penguin, London, 1981.
[351] S., Milius. A sound and complete calculus for finite stream circuits. In Logic in Computer Science, pages 449–458. IEEE, Computer Science Press, 2010.
[352] S., Milius, D., Pattinson, and T., Wißman. A new foundation for finitary corecursion: The locally finite fixpoint and its properties. In B., Jacobs and C. Löding, editors, Foundations of Software Science and Computation Structures, number 9634 in Lect. Notes Comp. Sci., pages 107–125. Springer, Berlin, 2016.
[353] R., Milner. An algebraic definition of simulation between programs. In Second International Joint Conference on Artificial Intelligence, pages 481–489. British Computer Society Press, London, 1971.
[354] R., Milner. A Calculus of Communicating Systems. Lect. Notes Comp. Sci. Springer, Berlin, 1989.
[355] R., Milner. Communication and Concurrency. Prentice Hall, Englewood Cliffs, NJ, 1989.
[356] J., Mitchell. Foundations of Programming Languages. MIT Press, Cambridge, MA, 1996.
[357] E., Moggi. Notions of computation and monads.
Inf. & Comp., 93(1):55–92, 1991.
[358] R., Montague. Universal grammar.
Theoria, 36:373–398, 1970.
[359] L., Moss. Coalgebraic logic.
Ann. Pure & Appl. Logic, 96(1–3):277–317, 1999. Erratum in Ann. Pure & Appl. Logic, 99(1–3):241–259, 1999.
[360] L., Moss. Parametric corecursion.
Theor. Comp. Sci., 260(1–2):139–163, 2001.
[361] L., Moss, editor. Coalgebraic Methods in Computer Science (CMCS'00), number 65(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2002.
[362] L., Moss and I., Viglizzo. Harsanyi type spaces and final coalgebras constructed from satisfied theories. In J., Adámek and S., Milius, editors, Coalgebraic Methods in Computer Science, number 106 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2004.
[363] T., Mossakowski, U., Montanari, and M., Haveraaen, editors. Coalgebra and Algebra in Computer Science (CALCO'07), number 4624 in Lect. Notes Comp. Sci. Springer, Berlin, 2007.
[364] A., Nanevski, G., Morrisett, A., Shinnar, P., Govereau, and L., Birkedal. Ynot: Dependent types for imperative programs. In International Conference on Functional Programming (ICFP), pages 229–240. ACM SIGPLAN Notices, 2008.
[365] M., Nielsen and I., Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
[366] M., Niqui. Formalising exact arithmetic: Representations, algorithms and proofs. PhD thesis, Radboud University Nijmegen, 2004.
[367] P., Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989.
[368] E., Palmgren and I., Moerdijk. Wellfounded trees in categories.
Ann. Pure & Appl. Logic, 104(1/3):189–218, 2000.
[369] P., Panangaden. Labelled Markov Processes. Imperial College Press, London, 2009.
[370] A., Pardo. Combining datatypes and effects. In V., Vene and T., Uustalu, editors, Advanced Functional Programming, number 3622 in Lect. Notes Comp. Sci., pages 171–209. Springer, Berlin, 2004.
[371] D., Park. Concurrency and automata on infinite sequences. In P., Deussen, editor, Proceedings 5th GI Conference on Theoretical Computer Science, number 104 in Lect. Notes Comp. Sci., pages 15–32. Springer, Berlin, 1981.
[372] R., Paterson. A new notation for arrows. In International Conference on Functional Programming (ICFP), volume 36(10), pages 229–240. ACM, SIGPLAN Notices, 2001.
[373] D., Pattinson. Coalgebraic modal logic: Soundness, completeness and decidability of local consequence.
Theor. Comp. Sci., 309(1–3):177–193, 2003.
[374] D., Pattinson. An introduction to the theory of coalgebras. Course notes at the North American Summer School in Logic, Language and Information (NASSLLI), 2003.
[375] D., Pattinson and L., Schröder, editors. CoalgebraicMethods in Computer Science 2012, volume 81(5) of J. Computer and System Sci., 2015.
[376] D., Pavlović and M., Escardó. Calculus in coinductive form. In Logic in Computer Science, pages 408–417. IEEE, Computer Science Press, 1998.
[377] D., Pavlović, M., Mislove, and J., Worrell. Testing semantics: Connecting processes and process logics. In M., Johnson and V., Vene, editors, Algebraic Methods and Software Technology, number 4019 in Lect. Notes Comp. Sci., pages 308–322. Springer, Berlin, 2006.
[378] D., Pavlović and V., Pratt. The continuum as a final coalgebra.
Theor. Comp. Sci., 280 (1–2):105–122, 2002.
[379] B., Pierce. Basic Category Theory for Computer Scientists. MIT Press, Cambridge, MA, 1991.
[380] A., Pitts. A co-induction principle for recursively defined domains.
Theor. Comp. Sci., 124(2):195–219, 1994.
[381] R., Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, Boston, 1993.
[382] G., Plotkin. Lambda definability in the full type hierarchy. In J., Hindley and J., Seldin, editors, To H.B Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 363–373. Academic Press, New York and London, 1980.
[383] G., Plotkin. A structural approach to operational semantics. Report DAIMI FN- 19, Aarhus University, reprinted as [384], 1981.
[384] G., Plotkin. A structural approach to operational semantics.
J. Logic and Algebraic Programming, 60–61:17–139, 2004.
[385] G., Plotkin and M., Abadi. A logic for parametric polymorphism. In M., Bezem and J.-F., Groote, editors, Typed Lambda Calculi and Applications, number 664 in Lect. Notes Comp. Sci., pages 361–375. Springer, Berlin, 1993.
[386] G., Plotkin and J., Power. Notions of computation determine monads. In M., Nielsen and U., Engberg, editors, Foundations of Software Science and Computation Structures, number 2303 in Lect. Notes Comp. Sci., pages 342–356. Springer, Berlin, 2002.
[387] G., Plotkin and J., Power. Algebraic operations and generic effects.
Appl. Categorical Struct., 11(1):69–94, 2003.
[388] G., Plotkin and J., Power. Computational effects and operations: An overview. In Proceedings of the Workshop on Domains VI, number 73 in Elect. Notes in Theor. Comp. Sci., pages 149–163. Elsevier, Amsterdam, 2004.
[389] A., Pnueli. The temporal logic of programs. In Foundations of Computer Science, pages 46–57. IEEE, 1977.
[390] A., Pnueli. The temporal semantics of concurrent programs.
Theor. Comp. Sci., 31:45–60, 1981.
[391] A., Pnueli. Probabilistic verification.
Inf. & Comp., 103:1–29, 1993.
[392] E., Poll and J., Zwanenburg. From algebras and coalgebras to dialgebras. In A., Corradini, M., Lenisa, and U., Montanari, editors, Coalgebraic Methods in Computer Science, number 44(1) in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2001.
[393] J., Power. Enriched Lawvere theories.
Theory and Appl. of Categories, 6:83–93, 2000.
[394] J., Power and E., Robinson. Premonoidal categories and notions of computation.
Math. Struct. in Comp. Sci., 7(5):453–468, 1997.
[395] J., Power and D., Turi. A coalgebraic foundation for linear time semantics. In M., Hofmann
D., Pavlović, and G., Rosolini, editors, Category Theory and Computer Science 1999, number 29 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1999.
[396] S., Pulmannová and S., Gudder. Representation theorem for convex effect algebras.
Commentationes Mathematicae Universitatis Carolinae, 39(4):645–659, 1998.
[397] H., Reichel. Behavioural equivalence: A unifying concept for initial and final specifications. In Third Hungarian Computer Science Conference. Akademiai Kiado, Budapest, 1981.
[398] H., Reichel. Initial Computability, Algebraic Specifications, and Partial Algebras. Number 2 in Monographs in Comp. Sci. Oxford University Press, 1987.
[399] H., Reichel. An approach to object semantics based on terminal co-algebras.
Math. Struct. in Comp. Sci., 5:129–152, 1995.
[400] H., Reichel, editor. Coalgebraic Methods in Computer Science (CMCS'00), number 33 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2000.
[401] K., Rosenthal. Quantales and Their Applications. Number 234 in Pitman Research Notes in Math. Longman Scientific & Technical, 1990.
[402] M., Rößiger. Languages for coalgebras on datafunctors. In B., Jacobs and J., Rutten, editors, Coalgebraic Methods in Computer Science, number 19 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1999.
[403] M., Rößiger. Coalgebras and modal logic. In H., Reichel, editor, Coalgebraic Methods in Computer Science, number 33 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 2000.
[404] M., Rößiger. From modal logic to terminal coalgebras.
Theor. Comp. Sci., 260(1–2):209–228, 2001.
[405] G., Rosu. Equational axiomatizability for coalgebra.
Theor. Comp. Sci., 260:229–247, 2001.
[406] J., Rothe, H., Tews, and B., Jacobs. The coalgebraic class specification language CCSL.
J. Universal Comp. Sci., 7(2), 2001.
[407] J., Rutten. Processes as terms: Non-well-founded models for bisimulation.
Math. Struct. in Comp. Sci., 2(3):257–275, 1992.
[408] J., Rutten. Automata and coinduction (an exercise in coalgebra). In D., Sangiorgi and R. de Simone, editors, Concur'98: Concurrency Theory, number 1466 in Lect. Notes Comp. Sci., pages 194–218. Springer, Berlin, 1998.
[409] J., Rutten. Relators and metric bisimulations. In B., Jacobs, L., Moss, H., Reichel, and J., Rutten, editors, Coalgebraic Methods in Computer Science, number 11 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1998.
[410] J., Rutten. Automata, power series, and coinduction: Taking input derivatives seriously (extended abstract). In J., Wiedermann, P. van Emde Boas, and M., Nielsen, editors, International Colloquium on Automata, Languages and Programming, number 1644 in Lect. Notes Comp. Sci., pages 645–654. Springer, Berlin, 1999.
[411] J., Rutten. Universal coalgebra: A theory of systems.
Theor. Comp. Sci., 249:3–80, 2000.
[412] J., Rutten. Behavioural differential equations: A coinductive calculus of streams, automata, and power series.
Theor. Comp. Sci., 308:1–53, 2003.
[413] J., Rutten. A coinductive calculus of streams.
Math. Struct. in Comp. Sci., 15(1):93–147, 2005.
[414] J., Rutten and D., Turi. Initial algebra and final coalgebra semantics for concurrency. In J. de Bakker, W.-P. de Roever, and G., Rozenberg, editors, A Decade of Concurrency, number 803 in Lect. Notes Comp. Sci., pages 530–582. Springer, Berlin, 1994.
[415] N., Saeedloei and G., Gupta. Coinductive constraint logic programming. In T., Schrijvers and P., Thiemann, editors, Functional and Logic Programming, number 7294 in Lect. Notes Comp. Sci., pages 243–259. Springer, Berlin, 2012.
[416] A., Salomaa. Computation and Automata, volume 25 of Encyclopedia of Mathematics. Cambridge University Press, 1985.
[417] D., Schamschurko. Modelling process calculi with PVS., In
B., Jacobs, L., Moss, H., Reichel, and J., Rutten, editors, Coalgebraic Methods in Computer Science, number 11 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1998.
[418] O., Schoett. Behavioural correctness of data representations.
Science of Comput. Progr., 14:43–57, 1990.
[419] L., Schröder. Expressivity of coalgebraic modal logic: The limits and beyond. In V., Sassone, editor, Foundations of Software Science and Computation Structures, number 3441 in Lect. Notes Comp. Sci., pages 440–454. Springer, Berlin, 2005.
[420] L., Schröder and D., Patinson, editors. Coalgebraic Methods in Computer Science (CMCS 2012), number 7399 in Lect. Notes Comp. Sci. Springer, Berlin, 2012.
[421] M.P., Schützenberger. On the definition of a family of automata.
Inf. & Control, 4(2–3):245–270, 1961.
[422] D., Schwencke. Coequational logic for finitary functors. In J., Adámek and C., Kupke, editors, Coalgebraic Methods in Computer Science, number 203(5) in Elect. Notes in Theor. Comp. Sci., pages 243–262. Elsevier, Amsterdam, 2008.
[423] D., Scott. Advice on modal logic. In K., Lambert, editor, Philosophical Problems in Logic: Some Recent Developments, pages 143–173. Reidel, Dordrecht, 1970.
[424] R., Seely. Linear logic, ∗-autonomous categories and cofree coalgebras. In J., Gray and A., Scedrov, editors, Categories in Computer Science and Logic, number 92 in AMS Contemp. Math., pages 371–382, AMS, Providence, RI, 1989.
[425] R., Segala. Modeling and verification of randomized distributed real-time systems. PhD thesis, MIT, 1995.
[426] R., Segala and N., Lynch. Probabilistic simulations for probabilistic processes. In B., Jonsson and J., Parrow, editors, Concur'94: Concurrency Theory, number 836 in Lect. Notes Comp. Sci., pages 481–496. Springer, Berlin, 1994.
[427] A., Silva, F., Bonchi, M., Bonsangue, and J., Rutten. Generalizing the powerset construction, coalgebraically. In K., Lodaya and M., Mahajan, editors, Foundations of Software Technology and Theoretical Computer Science, volume 8 of Leibniz International Proceedings in Informatics, pages 272–283. Schloss Dagstuhl, 2010.
[428] A., Silva, F., Bonchi,M., Bonsangue, and J., Rutten. Quantative Kleene coalgebras.
Inf. & Comp., 209(5):822–849, 2011.
[429] A., Silva, F., Bonchi, M., Bonsangue, and J., Rutten. Generalizing determinization from automata to coalgebras.
Logical Methods in Comp. Sci., 9(1:09):1–27, 2013.
[430] A., Silva, M., Bonsangue, and J., Rutten. Non-deterministic Kleene coalgebras.
Logical Methods in Comp. Sci., 6(3):1–39, 2010.
[431] L., Simon, A., Mallya, A., Bansal, and G., Gupta. Coinductive logic programming. In S., Etalle and M., Truszczynski, editors, Logic Programming, number 4079 in Lect. Notes Comp. Sci., pages 330–345. Springer, Berlin, 2006.
[432] M., Smyth. Topology. In S., Abramsky, Dov M., Gabbai, and T., Maibaum, editors, Handbook of Logic in Computer Science, volume 1, pages 641–761. Oxford University Press, 1992.
[433] M., Smyth and G., Plotkin. The category theoretic solution of recursive domain equations.
SIAM J. Comput., 11:761–783, 1982.
[434] A., Sokolova. Probabilistic systems coalgebraically: A survey.
Theor. Comp. Sci., 412(38):5095–5110, 2011.
[435] S., Staton. Relating coalgebraic notions of bisimulation. In A., Kurz and A., Tarlecki, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2009), number 5728 in Lect. Notes Comp. Sci., pages 191–205. Springer, Berlin, 2009.
[436] S., Staton. Relating coalgebraic notions of bisimulation.
Logical Methods in Comp. Sci., 7(1:13):1–21, 2011.
[437] C., Stirling. Modal and Temporal Properties of Processes. Springer, 2001.
[438] M., Stone. Postulates for the barycentric calculus.
Ann. Math., 29:25–30, 1949.
[439] N., Swamy, J., Weinberger, C., Schlesinger, J., Chen, and B., Livshits. Verifying higher-order programs with the Dijkstra monad. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 387–398. ACM, 2013.
[440] W., Swierstra. A Hoare logic for the state monad. In S., Berghofer, T., Nipkow, C., Urban, and M., Wenzel, editors, Theorem Proving in Higher Order Logics, number 5674 in Lect. Notes Comp. Sci., pages 440–451. Springer, Berlin, 2009.
[441] T., Swirszcz. Monadic functors and convexity.
Bull. de l'Acad. Polonaise des Sciences. Sér. des Sciences Math., Astr. et Phys., 22:39–42, 1974.
[442] W., Tait. Intensional interpretation of functionals of finite type I.
J. Symb. Logic, 32:198–212, 1967.
[443] P., Taylor. Practical Foundations of Mathematics, number 59 in Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1999.
[444] H., Tews. Coalgebras for binary methods: Properties of bisimulations and invariants.
Inf. Théor. et Appl., 35(1):83–111, 2001.
[445] H., Tews. Coalgebraic methods for object-oriented specification. PhD thesis, Technical University Dresden, 2002.
[446] A., Thijs. Simulation and fixpoint semantics. PhD thesis, University of Groningen, 1996.
[447] B., Trancón y Widemann and M., Hauhs. Distributive-law semantics for cellular automata and agent-based models. In A., Corradini, B., Klin, and C., Cïrstea, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), number 6859 in Lect. Notes Comp. Sci., pages 344–358. Springer, Berlin, 2011.
[448] D., Traytel, A., Popescu, and J., Blanchette. Foundational, compositional (co)datatypes for higher-order logic: Category theory applied to theorem proving. In Logic in Computer Science, pages 596–605. IEEE, Computer Science Press, 2012.
[449] V., Trnková. Some properties of set functors.
Comment. Math. Univ. Carolinae, 10:323–352, 1969.
[450] V., Trnková. Relational automata in a category and their languages. In Fundamentals of Computation Theory, number 256 in Lect. Notes Comp. Sci., pages 340–355. Springer, Berlin, 1977.
[451] D., Turi. Functorial operational semantics and its denotational dual. PhD thesis, Free University of Amsterdam, 1996.
[452] D., Turi and G., Plotkin. Towards a mathematical operational semantics. In Logic in Computer Science, pages 280–291. IEEE, Computer Science Press, 1997.
[453] D., Turi and J., Rutten. On the foundations of final semantics: Non-standard sets, metric spaces and partial orders.
Math. Struct. in Comp. Sci., 8(5):481–540, 1998.
[454] T., Uustalu and V., Vene. Signals and comonads.
J. Universal Comp. Sci., 11(7):1310–1326, 2005.
[455] T., Uustalu, V., Vene, and A., Pardo. Recursion schemes from comonads.
Nordic J. Comput., 8(3):366–390, 2001.
[456] M., Vardi. Automatic verification of probabilistic concurrent finite state programs. In Found. Computer Science, pages 327–338. IEEE, 1985.
[457] Y., Venema. Automata and fixed point logic: A coalgebraic perspective.
Inf. & Comp., 204:637–678, 2006.
[458] I., Viglizzo. Final sequences and final coalgebras for measurable spaces. In J., Fiadeiro, N., Harman, M., Roggenbach, and J., Rutten, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2005), number 3629 in Lect. Notes Comp. Sci., pages 395–407. Springer, Berlin, 2005.
[459] E. de, Vink and J., Rutten. Bisimulation for probabilistic transition systems: A coalgebraic approach.
Theor. Comp. Sci., 221:271–293, 1999.
[460] Ph., Wadler. Monads and composable continuations.
Lisp and Symbolic Computation, 7(1):39–56, 1993.
[461] R., Walters. Categories and Computer Science. Carslaw Publications, Sydney, 1991. Also available as: Cambridge Computer Science Text
28, 1992.
[462] M., Wand. Final algebra semantics and data type extension.
J. Comp. Syst. Sci, 19:27–44, 1979.
[463] W., Wechler. Universal Algebra for Computer Scientists, number 25 in EATCS Monographs. Springer, Berlin, 1992.
[464] J., Winter, M., Bonsangue, and J., Rutten. Context-free languages, coalgebraically. In A., Corradini, B., Klin, and C., Cïrstea, editors, Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), number 6859 in Lect. Notes Comp. Sci., pages 359–376. Springer, Berlin, 2011.
[465] M., Wirsing. Algebraic specification. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 673–788. Elsevier/MIT Press, 1990.
[466] H., Wolff. Monads and monoids on symmetric monoidal closed categories.
Archiv der Mathematik, 24:113–120, 1973.
[467] U., Wolter. CSP, partial automata, and coalgebras.
Theor. Comp. Sci., 280 (1–2):3–34, 2002.
[468] J., Worrell. Toposes of coalgebras and hidden algebras. In B., Jacobs, L., Moss, H., Reichel, and J., Rutten, editors, Coalgebraic Methods in Computer Science, number 11 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1998.
[469] J., Worrell. Terminal sequences for accessible endofunctors. In B., Jacobs and J., Rutten, editors, Coalgebraic Methods in Computer Science, number 19 in Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam, 1999.
[470] J., Worrell. On the final sequence of a finitary set functor.
Theor. Comp. Sci., 338(1–3):184–199, 2005.
[471] G., Wraith. A note on categorical datatypes. In D., Pitt, A., Poigné, and D., Rydeheard, editors, Category Theory and Computer Science, number 389 in Lect. Notes Comp. Sci., pages 118–127. Springer, Berlin, 1989.
