{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:38Z","timestamp":1725664298626},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615507"},{"type":"electronic","value":"9783540705970"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61550-4_160","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:54:46Z","timestamp":1330293286000},"page":"336-347","source":"Crossref","is-referenced-by-count":3,"title":["Equational properties of iteration in algebraically complete categories"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Labella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"25_CR1","first-page":"589","volume":"15","author":"J. Adamek","year":"1974","unstructured":"J. Adamek. Free algebras and automata realizations in the language of category theory. Comm. Math. Unive. Carolinae, 15(1974), 589\u2013602.","journal-title":"Comm. Math. Unive. Carolinae"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-0000(79)90026-6","volume":"19","author":"J. Adamek","year":"1979","unstructured":"J. Adamek and V. Koubek. Least fixed point of a functor. J. of Computer and System Sciences, 19(1979), 163\u2013178.","journal-title":"J. of Computer and System Sciences"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0022-0000(89)90027-5","volume":"35","author":"P. America","year":"1989","unstructured":"P. America and J.J.M.M. Rutten. Solving reflexive domain equations in a category of complete metric spaces. J. of Computer and System Sciences, 35(1989), 343\u2013375.","journal-title":"J. of Computer and System Sciences"},{"key":"25_CR4","unstructured":"A. Asperti and G. Longo. Categories, Types, and Structures. Foundations of Computing Series. MIT Press, 1991."},{"key":"25_CR5","unstructured":"J. Adamek and V. Trnkova. Automata and Algebras in Categories. Kluwer Academic Publishers, 1990."},{"key":"25_CR6","first-page":"212","volume":"56","author":"M. A. Arbib","year":"1977","unstructured":"M. A. Arbib. Free dynamics and algebraic semantics. in: Mathematical Foundations of Computer Science '76, LNCS 56, 1977, 212\u2013227.","journal-title":"LNCS"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"R. Backhouse, M. Birjsterveld, R. van Geldrop and J. van der Woude. Categorical fixed point calculus. in: proc. conf. Category Theory and Computer Science '95, LNCS 953, Springer-Verlag, 1995, 159\u2013179.","DOI":"10.1007\/3-540-60164-3_25"},{"key":"25_CR8","first-page":"26","volume":"9","author":"S.L. Bloom","year":"1980","unstructured":"S.L. Bloom, C.C. Elgot and J.B. Wright. Solutions of the iteration equation and extension of the scalar iteration operation. SIAM J. Computing, 9(1980), 26\u201345.","journal-title":"SIAM J. Computing"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/0209039","volume":"9","author":"S.L. Bloom","year":"1980","unstructured":"S.L. Bloom, C.C. Elgot and J.B. Wright. Vector iteration in pointed iterative theories. SIAM J. Computing, 9(1980), 525\u2013540.","journal-title":"SIAM J. Computing"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(89)90012-1","volume":"63","author":"S.L. Bloom","year":"1989","unstructured":"S.L. Bloom and Z. \u00c9sik. Equational logic of circular data type specification. Theoretical Computer Science, 63(1989), 303\u2013331.","journal-title":"Theoretical Computer Science"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. \u00c9sik. Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-78034-9_6"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S0129054195000081","volume":"6","author":"S.L. Bloom","year":"1995","unstructured":"S.L. Bloom and Z. \u00c9sik. Some equational laws of initiality in 2CCC's. Int. J. on Foundations of Computer Science, 6(1995), 95\u2013118.","journal-title":"Int. J. on Foundations of Computer Science"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00010-0","volume":"155","author":"S.L. Bloom","year":"1996","unstructured":"S.L. Bloom and Z. \u00c9sik. Fixed-point operations on CCC's. Part 1. Theoretical Computer Science, 155(1996), 1\u201338.","journal-title":"Theoretical Computer Science"},{"key":"25_CR14","unstructured":"J.C. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971."},{"key":"25_CR15","volume-title":"Logic Colloquium 1973, Studies in Logic, volume 80","author":"C.C. Elgot","year":"1975","unstructured":"C.C. Elgot. Monadic computation and iterative algebraic theories. In J. C. Shepherdson, editor, Logic Colloquium 1973, Studies in Logic, volume 80. North Holland, Amsterdam, 1975."},{"key":"25_CR16","first-page":"183","volume":"14","author":"Z. \u00c9sik","year":"1980","unstructured":"Z. \u00c9sik. Identities in iterative and rational algebraic theories. Computational Linguistics and Computer Languages, 14(1980), 183\u2013207.","journal-title":"Computational Linguistics and Computer Languages"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(88)90020-7","volume":"36","author":"Z. \u00c9sik","year":"1988","unstructured":"Z. \u00c9sik. The independence of the equational axioms of iteration theories. J. Computer and System Sciences, 36(1988), 66\u201376.","journal-title":"J. Computer and System Sciences"},{"key":"25_CR18","unstructured":"Z. \u00c9sik. Completeness of Park induction. Theoretical Computer Science, to appear."},{"key":"25_CR19","unstructured":"Z. \u00c9sik. Group axioms for iteration. To appear."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"P. Freyd. Algebraically complete categories. in: proc. conf. Category Theory, Como 1990, LNM vol. 1488, Springer-Verlag, 1991, 95\u2013104.","DOI":"10.1007\/BFb0084215"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"P. Freyd. Remarks on algebraically compact categories. in: Applications of Categories in Computer Science, London Math. Society Lecture Notes Series, vol. 77, Cambridge University Press, 1992, 95\u2013106.","DOI":"10.1017\/CBO9780511525902.006"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"G.M. Kelly and R. Street. Review of the elements of 2-categories. in: LNM 420, Springer-Verlag, 1974, 76\u2013103.","DOI":"10.1007\/BFb0063101"},{"key":"25_CR23","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(1994), 366\u2013390.","journal-title":"Information and Computation"},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J. Lambek","year":"1968","unstructured":"J. Lambek. A fixpoint theorem for complete categories. Mathematische Zeitschrift, 103(1968), 151\u2013161.","journal-title":"Mathematische Zeitschrift"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"S. Mac Lane. Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer-Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"25_CR26","unstructured":"G. Lallement. Semigroups and Combinatorial Applications. Wiley-Interscience, 1979."},{"key":"25_CR27","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"F.L. Lawvere","year":"1963","unstructured":"F.L. Lawvere. Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences USA, 50(1963), 869\u2013873.","journal-title":"Proceedings of the National Academy of Sciences USA"},{"key":"25_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01752392","volume":"14","author":"D. Lehmann","year":"1981","unstructured":"D. Lehmann and M.B. Smyth. Algebraic specification of data types: a synthetic approach. Mathematical Systems Theory, 14(1981), 97\u2013139.","journal-title":"Mathematical Systems Theory"},{"key":"25_CR29","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0890-5401(91)90005-M","volume":"90","author":"M.E. Majster-Cederbaum","year":"1991","unstructured":"M.E. Majster-Cederbaum and F. Zetzsche. Towards a foundation for semantics in complete metric spaces. Information and Computation, 90(1991), 217\u2013243.","journal-title":"Information and Computation"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus for Communicating Systems. LNCS 92, Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"25_CR31","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(90)90154-A","volume":"70","author":"P.S. Mulry","year":"1990","unstructured":"P.S. Mulry. Categorical fixed point semantics. Theoretical Computer Science, 70(1990), 85\u201397.","journal-title":"Theoretical Computer Science"},{"key":"25_CR32","unstructured":"G.D. Plotkin. Domains. Lecture Notes. Department of Computer Science, University of Edinburgh, 1983."},{"key":"25_CR33","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0304-3975(93)90112-7","volume":"118","author":"A.K. Simpson","year":"1993","unstructured":"A.K. Simpson. A characterisation of the least fixed point operator by dinaturality. Theoretical Computer Science, 118(1993), 301\u2013314.","journal-title":"Theoretical Computer Science"},{"key":"25_CR34","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/0211062","volume":"11","author":"M.B. Smyth","year":"1982","unstructured":"M.B. Smyth and G.D. Plotkin. The category theoretic solution of recursive domain equations. SIAM J. Computing, 11(1982), 761\u2013783.","journal-title":"SIAM J. Computing"},{"key":"25_CR35","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0304-3975(79)90053-7","volume":"8","author":"M. Wand","year":"1979","unstructured":"M. Wand. Fixed point constructions in order enriched categories. Theoretical Computer Science, 8(1979), 13\u201330.","journal-title":"Theoretical Computer Science"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"J.B. Wright, J. Thatcher, J. Goguen, and E.G. Wagner. Rational algebraic theories and fixed-point solutions. In Proc. 17th IEEE Symposium on Foundations of Computing, 1976, 147\u2013158.","DOI":"10.1109\/SFCS.1976.24"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61550-4_160.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:46Z","timestamp":1605647266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61550-4_160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615507","9783540705970"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-61550-4_160","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}