{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:02:10Z","timestamp":1762459330309,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":73,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480564"},{"type":"electronic","value":"9783662480571"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48057-1_2","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T01:29:54Z","timestamp":1439170194000},"page":"18-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45719-4_17","volume-title":"Algebraic Methodology and Software Technology","author":"L Aceto","year":"2002","unstructured":"Aceto, L., \u00c9sik, Z., Ing\u00f3lfsd\u00f3ttir, A.: Equational axioms for probabilistic bisimilarity. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, pp. 239\u2013254. Springer, Heidelberg (2002)"},{"key":"2_CR2","first-page":"67","volume":"10","author":"KB Arkhangelsky","year":"1967","unstructured":"Arkhangelsky, K.B., Gorshkov, P.V.: Implicational axioms for the algebra of regular languages. Dokl. Akad. Nauk USSR Ser. A 10, 67\u201369 (1967). (in Russian)","journal-title":"Dokl. Akad. Nauk USSR Ser. A"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(80)90045-6","volume":"11","author":"A Arnold","year":"1980","unstructured":"Arnold, A., Nivat, M.: Metric interpretations of infinite trees and semantics of non deterministic recursive programs. Theor. Comput. Sci. 11, 181\u2013205 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR4","volume-title":"Rudiments of $$\\mu $$-Calculus","author":"A Arnold","year":"2001","unstructured":"Arnold, A., Niwinski, D.: Rudiments of $$\\mu $$-Calculus. North-Holland, Amsterdam (2001)"},{"key":"2_CR5","unstructured":"Barr, M., Wells, C.: Category theory for computing science. Reprints Theory Appl. Categories (22), 172 (2012)"},{"key":"2_CR6","first-page":"203","volume":"8","author":"M Bartha","year":"1987","unstructured":"Bartha, M.: A finite axiomatization of flowchart schemes. Acta Cybern. 8, 203\u2013217 (1987)","journal-title":"Acta Cybern."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Beki\u0107, H.: Definable operation in general algebras, and the theory of automata and flowcharts. Technical report, IBM Vienna (1969). Reprinted in: Programming Languages and Their Definition - Hans Beki\u0107 (1936\u20131982). LNCS, vol. 177, pp. 30\u201355. Springer, Heidelberg (1984)","DOI":"10.1007\/BFb0048939"},{"key":"2_CR8","first-page":"35","volume":"32","author":"L Bern\u00e1tsky","year":"1998","unstructured":"Bern\u00e1tsky, L., \u00c9sik, Z.: Semantics on flowchart programs and the free Conway theories. ITA 32, 35\u201378 (1998)","journal-title":"ITA"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0209002","volume":"9","author":"SL Bloom","year":"1980","unstructured":"Bloom, S.L., Elgot, C., Wright, J.B.: Solutions of the iteration equation and extensions of the scalar iteration operation. SIAM J. Comput. 9, 25\u201345 (1980)","journal-title":"SIAM J. Comput."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(89)90012-1","volume":"63","author":"SL Bloom","year":"1989","unstructured":"Bloom, S.L., \u00c9sik, Z.: Equational logic of circular data type specification. Theor. Comput. Sci. 63, 303\u2013331 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1145\/115234.115352","volume":"38","author":"SL Bloom","year":"1991","unstructured":"Bloom, S.L., \u00c9sik, Z.: Floyd-Hoare logic in iteration theories. J. ACM 38, 887\u2013934 (1991)","journal-title":"J. ACM"},{"key":"2_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories","author":"SL Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories. Springer, Heidelberg (1993)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1993.1001","volume":"102","author":"SL Bloom","year":"1993","unstructured":"Bloom, S.L., \u00c9sik, Z., Taubner, D.: Iteration theories of synchronization trees. Inf. Comput. 102, 1\u201355 (1993)","journal-title":"Inf. Comput."},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-58027-1_19","volume-title":"Mathematical Foundations of Programming Semantics","author":"SL Bloom","year":"1994","unstructured":"Bloom, S.L., \u00c9sik, Z.: Some quasi-varieties of iteration theories. In: Main, M.G., Melton, A.C., Mislove, M.W., Schmidt, D., Brookes, S.D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 378\u2013409. Springer, Heidelberg (1994)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00248-4","volume":"179","author":"SL Bloom","year":"1997","unstructured":"Bloom, S.L., \u00c9sik, Z.: The equational logic of fixed points (Tutorial). Theor. Comput. Sci. 179, 1\u201360 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","first-page":"145","volume":"8","author":"SL Bloom","year":"2003","unstructured":"Bloom, S.L., \u00c9sik, Z.: An extension theorem with an application to formal tree series. J. Automata Lang. Comb. 8, 145\u2013185 (2003)","journal-title":"J. Automata Lang. Comb."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.ic.2009.02.003","volume":"207","author":"SL Bloom","year":"2009","unstructured":"Bloom, S.L., \u00c9sik, Z.: Axiomatizing rational power series over natural numbers. Inf. Comput. 207, 793\u2013811 (2009)","journal-title":"Inf. Comput."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/10719839_36","volume-title":"LATIN 2000: Theoretical Informatics","author":"SL Bloom","year":"2000","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration algebras are not finitely axiomatizable. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 367\u2013376. Springer, Heidelberg (2000)"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1008708924144","volume":"9","author":"SL Bloom","year":"2001","unstructured":"Bloom, S.L., \u00c9sik, Z., Labella, A., Manes, E.G.: Iteration 2-theories. Appl. Categorical Struct. 9, 173\u2013216 (2001)","journal-title":"Appl. Categorical Struct."},{"key":"2_CR20","first-page":"419","volume":"24","author":"M Boffa","year":"1990","unstructured":"Boffa, M.: Une remarque sur les syst\u00e9mes complets d\u2019identit\u00e9s rationnelles. ITA 24, 419\u2013428 (1990)","journal-title":"ITA"},{"key":"2_CR21","first-page":"515","volume":"29","author":"M Boffa","year":"1995","unstructured":"Boffa, M.: Une condition impliquant toutes les identit\u00e9s rationnelles. ITA 29, 515\u2013518 (1995)","journal-title":"ITA"},{"key":"2_CR22","first-page":"171","volume":"13","author":"VE Cazanescu","year":"1990","unstructured":"Cazanescu, V.E., Stefanescu, G.: Towards a new algebraic foundation of flowchart scheme theory. Fund. Inform. 13, 171\u2013210 (1990)","journal-title":"Fund. Inform."},{"key":"2_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-8399-1","volume-title":"Universal algebra","author":"PM Cohn","year":"1981","unstructured":"Cohn, P.M.: Universal algebra, 2nd edn. D. Reidel, Dordrecht (1981)","edition":"2"},{"key":"2_CR24","volume-title":"Introduction to lattices and order","author":"BA Davey","year":"1990","unstructured":"Davey, B.A., Priestly, H.A.: Introduction to lattices and order. Cambridge Univ. Press, Cambridge (1990)"},{"key":"2_CR25","unstructured":"De Bakker, J.W., Scott, D.: A theory of programs. Technical report, IBM Vienna (1969)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Elgot, C.C.: Monadic computation and iterative algebraic theories. In: Logic Colloquium 1973, Bristol. Studies in Logic and the Foundations of Mathematics, vol. 80, pp. 175\u2013230. North-Holland, Amsterdam (1975)","DOI":"10.1016\/S0049-237X(08)71949-9"},{"key":"2_CR27","first-page":"183","volume":"14","author":"Z \u00c9sik","year":"1980","unstructured":"\u00c9sik, Z.: Identities in iterative and rational theories. Comput. Linguist. Comput. Lang. 14, 183\u2013207 (1980)","journal-title":"Comput. Linguist. Comput. Lang."},{"key":"2_CR28","first-page":"66","volume":"36","author":"Z \u00c9sik","year":"1988","unstructured":"\u00c9sik, Z.: Independence of the equational axioms of iteration theories. JCSS 36, 66\u201376 (1988)","journal-title":"JCSS"},{"key":"2_CR29","first-page":"375","volume":"9","author":"Z \u00c9sik","year":"1990","unstructured":"\u00c9sik, Z.: A note on the axiomatization of iteration theories. Acta Cybern. 9, 375\u2013384 (1990)","journal-title":"Acta Cybern."},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(96)00240-X","volume":"177","author":"Z \u00c9sik","year":"1997","unstructured":"\u00c9sik, Z.: Completeness of park induction. Theor. Comput. Sci. 177, 217\u2013283 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/BFb0028581","volume-title":"STACS 98","author":"Z \u00c9sik","year":"1998","unstructured":"\u00c9sik, Z.: Axiomatizing the equational theory of regular tree languages (Extended abstract). In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 455\u2013465. Springer, Heidelberg (1998)"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"Z \u00c9sik","year":"1999","unstructured":"\u00c9sik, Z.: Group axioms for iteration. Inf. Comput. 148, 131\u2013180 (1999)","journal-title":"Inf. Comput."},{"key":"2_CR33","first-page":"65","volume":"14","author":"Z \u00c9sik","year":"1999","unstructured":"\u00c9sik, Z.: Axiomatizing iteration categories. Acta Cybern. 14, 65\u201382 (1999)","journal-title":"Acta Cybern."},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-44622-2_20","volume-title":"Computer Science Logic","author":"Z \u00c9sik","year":"2000","unstructured":"\u00c9sik, Z.: Axiomatizing the least fixed point operation and binary supremum. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 302\u2013316. Springer, Heidelberg (2000)"},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0304-3975(99)00315-1","volume":"234","author":"Z \u00c9sik","year":"2000","unstructured":"\u00c9sik, Z.: A proof of the Krohn-Rhodes decomposition theorem. Theor. Comput. Sci. 234, 287\u2013300 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR36","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1142\/S0218196700000145","volume":"10","author":"Z \u00c9sik","year":"2000","unstructured":"\u00c9sik, Z.: The power of the group axioms for iteration. Int. J. Algebr. Comput. 10, 349\u2013373 (2000)","journal-title":"Int. J. Algebr. Comput."},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jlap.2009.10.001","volume":"79","author":"Z \u00c9sik","year":"2010","unstructured":"\u00c9sik, Z.: Axiomatizing the equational theory of regular tree languages. J. Log. Algebr. Program. 79, 189\u2013213 (2010)","journal-title":"J. Log. Algebr. Program."},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.entcs.2011.09.020","volume":"276","author":"Z \u00c9sik","year":"2011","unstructured":"\u00c9sik, Z.: Multi-linear iterative K-semialgebras. Electr. Notes Theor. Comput. Sci. 276, 159\u2013170 (2011)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.entcs.2013.09.011","volume":"298","author":"Z \u00c9sik","year":"2013","unstructured":"\u00c9sik, Z.: A connection between concurrency and language theory. Electr. Notes Theor. Comput. Sci. 298, 143\u2013164 (2013)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2014.02.033","volume":"534","author":"Z \u00c9sik","year":"2014","unstructured":"\u00c9sik, Z.: Axiomatizing weighted synchronization trees and weighted bisimilarity. Theor. Comput. Sci. 534, 2\u201323 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR41","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1093\/logcom\/ext001","volume":"25","author":"Z \u00c9sik","year":"2015","unstructured":"\u00c9sik, Z.: Residuated park theories. J. Log. Comput. 25, 453\u2013471 (2015)","journal-title":"J. Log. Comput."},{"key":"2_CR42","unstructured":"\u00c9sik, Z.: Equational axioms associated with finite automata for fixed point operations in cartesian categories. Math. Struct. Comput. Sci. (to appear)"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-662-47709-0_13","volume-title":"Logic, Language, Information, and Computation","author":"Z \u00c9sik","year":"2015","unstructured":"\u00c9sik, Z.: Equational properties of stratified least fixed points (extended abstract). In: de Paiva, V., de Queiroz, R., Moss, L.S., Leivant, D., de Oliveira, A. (eds.) WoLLIC 2015. LNCS, vol. 9160, pp. 174\u2013188. Springer, Heidelberg (2015)"},{"key":"2_CR44","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/S1571-0661(04)80009-4","volume":"1","author":"Z \u00c9sik","year":"1985","unstructured":"\u00c9sik, Z., Bern\u00e1tsky, L.: Scott induction and equational proofs. Electr. Notes Theor. Comput. Sci. 1, 154\u2013181 (1985)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"2_CR45","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.03.050","volume":"324","author":"Z \u00c9sik","year":"2004","unstructured":"\u00c9sik, Z., Kuich, W.: Inductive star-semirings. Theor. Comput. Sci. 324, 3\u201333 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR46","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00012-012-0179-y","volume":"67","author":"Z \u00c9sik","year":"2012","unstructured":"\u00c9sik, Z., Kuich, W.: Free iterative and iteration K-semialgebras. Algebra Univers. 67, 141\u2013162 (2012)","journal-title":"Algebra Univers."},{"key":"2_CR47","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.jlap.2013.01.001","volume":"82","author":"Z \u00c9sik","year":"2013","unstructured":"\u00c9sik, Z., Kuich, W.: Free inductive K-semialgebras. J. Log. Algebr. Program. 82, 111\u2013122 (2013)","journal-title":"J. Log. Algebr. Program."},{"key":"2_CR48","unstructured":"\u00c9sik, Z., Kuich, W.: Solving fixed-point equations over complete semirings (to appear)"},{"key":"2_CR49","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0304-3975(97)00158-8","volume":"195","author":"Z \u00c9sik","year":"1998","unstructured":"\u00c9sik, Z., Labella, A.: Equational properties of iteration in algebraically complete categories. Theor. Comput. Sci. 195, 61\u201389 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR50","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2015.01.032","volume":"574","author":"Z \u00c9sik","year":"2015","unstructured":"\u00c9sik, Z., Rondogiannis, P.: A fixed point theorem for non-monotonic functions. Theor. Comput. Sci. 574, 18\u201338 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61611-2","volume-title":"Products of Automata","author":"F G\u00e9cseg","year":"1986","unstructured":"G\u00e9cseg, F.: Products of Automata. Springer, Berlin (1986)"},{"key":"2_CR52","volume-title":"Algebraic Theory of Automata","author":"A Ginzburg","year":"1968","unstructured":"Ginzburg, A.: Algebraic Theory of Automata. Academic Press, New-York (1968)"},{"key":"2_CR53","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"JA Goguen","year":"1977","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Initial algebra semantics and continuous algebras. J. ACM 24, 68\u201395 (1977)","journal-title":"J. ACM"},{"key":"2_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-62688-3_37","volume-title":"Typed Lambda Calculi and Applications","author":"M Hasegawa","year":"1997","unstructured":"Hasegawa, M.: Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 196\u2013213. Springer, Heidelberg (1997)"},{"key":"2_CR55","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.entcs.2007.02.019","volume":"172","author":"M Hyland","year":"2007","unstructured":"Hyland, M., Power, J.: The category theoretic understanding of universal algebra: Lawvere theories and monads. Electr. Notes Theor. Comput. Sci. 172, 437\u2013458 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"2_CR56","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"3","author":"A Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Camb. Philos. Soc. 3, 447\u2013468 (1996)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"2_CR57","doi-asserted-by":"crossref","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. In: LICS 1991, pp. 214\u2013225. IEEP Press (1991)","DOI":"10.1109\/LICS.1991.151646"},{"key":"2_CR58","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110, 366\u2013390 (1994)","journal-title":"Inf. Comput."},{"key":"2_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BFb0032022","volume-title":"Automata, Languages and Programming","author":"D Krob","year":"1990","unstructured":"Krob, D.: A complete system of B-rational identities. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 60\u201373. Springer, Heidelberg (1990)"},{"key":"2_CR60","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D Krob","year":"1991","unstructured":"Krob, D.: Complete systems of B-rational identities. Theor. Comput. Sci. 89, 207\u2013343 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR61","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1090\/S0002-9947-1965-0188316-1","volume":"116","author":"K Krohn","year":"1965","unstructured":"Krohn, K., Rhodes, J.L.: Algebraic theory of machines, I, principles of finite semigroups and machines. Trans. Am. Math. Soc. 116, 450\u2013464 (1965)","journal-title":"Trans. Am. Math. Soc."},{"key":"2_CR62","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"FW Lawvere","year":"1963","unstructured":"Lawvere, F.W.: Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. (USA) 50, 869\u2013872 (1963)","journal-title":"Proc. Nat. Acad. Sci. (USA)"},{"key":"2_CR63","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01752392","volume":"14","author":"D Lehmann","year":"1981","unstructured":"Lehmann, D., Smyth, M.B.: Algebraic specification of data types: a synthetic approach. Math. Sys. Theory 14, 97\u2013139 (1981)","journal-title":"Math. Sys. Theory"},{"key":"2_CR64","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, New York (1989)"},{"key":"2_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-16066-3_16","volume-title":"Computation Theory","author":"D Niwinski","year":"1985","unstructured":"Niwinski, D.: Equational $$\\mu $$-calculus. In: Skowron, A. (ed.) Computation Theory. LNCS, vol. 208, pp. 169\u2013176. Springer, Heidelberg (1985)"},{"key":"2_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-16761-7_96","volume-title":"Automata, Languages and Programming","author":"D Niwinski","year":"1986","unstructured":"Niwinski, D.: On fixed-point clones (extended abstract). In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 464\u2013473. Springer, Heidelberg (1986)"},{"key":"2_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"DMR Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Theoretical Computer Science. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"2_CR68","volume-title":"Domains. The Pisa notes","author":"G Plotkin","year":"1983","unstructured":"Plotkin, G.: Domains. The Pisa notes. The University of Edinburgh, Edinburgh (1983)"},{"key":"2_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0018436","volume-title":"Logics in AI 1990","author":"V Pratt","year":"1990","unstructured":"Pratt, V.: Action logic and pure induction. In: van Eijck, J. (ed.) Logics in AI 1990. LNCS, vol. 478, pp. 97\u2013120. Springer, Heidelberg (1990)"},{"key":"2_CR70","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0304-3975(02)00412-7","volume":"295","author":"L Santocanale","year":"2003","unstructured":"Santocanale, L.: On the equational definition of the least prefixed point. Theor. Comput. Sci. 295, 341\u2013370 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR71","doi-asserted-by":"crossref","unstructured":"Simpson, A.K., Plotkin, G.D.: Complete axioms for categorical fixed-point operators. In: LICS 2000, pp. 30\u201341. IEEE Press (2000)","DOI":"10.1109\/LICS.2000.855753"},{"key":"2_CR72","unstructured":"Wagner, E.G., Bloom, S.L., Thatcher, J.W.: Why algebraic theories. In: Algebraic Methods in Semantics, pp. 607\u2013634. Cambridge University Press, New York (1986)"},{"key":"2_CR73","doi-asserted-by":"crossref","unstructured":"Wright, J.B., Thatcher, J.W., Wagner, E.G., Goguen, J.A.: Rational algebraic theories and fixed-point solutions. In: FOCS 1976, pp. 147\u2013158. IEEE Press (1976)","DOI":"10.1109\/SFCS.1976.24"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48057-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:00:58Z","timestamp":1748559658000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48057-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480564","9783662480571"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48057-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}