{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:46:45Z","timestamp":1725454005011},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638889"},{"type":"electronic","value":"9783540696612"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0000461","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T10:30:36Z","timestamp":1128508236000},"page":"30-44","source":"Crossref","is-referenced-by-count":2,"title":["Iteration 2-theories: Extended Abstract"],"prefix":"10.1007","author":[{"given":"Stephen L.","family":"Bloom","sequence":"first","affiliation":[]},{"given":"Anna","family":"Labella","sequence":"additional","affiliation":[]},{"given":"Zolt\u00e1n","family":"\u00e9sik","sequence":"additional","affiliation":[]},{"given":"Ernest G.","family":"Manes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"3_CR1","volume-title":"Prentice-Hall Series in Automatic Computation","author":"A. Aho","year":"1972","unstructured":"A. Aho and J. Ullman. The theory of parsing, translation, and compiling. Vol. I: Parsing. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Inc., Englewood Cliffs, N. J., 1972."},{"key":"3_CR2","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":"3_CR3","doi-asserted-by":"crossref","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"},{"doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. \u00e9sik. Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1993.","key":"3_CR4","DOI":"10.1007\/978-3-642-78034-9_6"},{"doi-asserted-by":"crossref","unstructured":"F. Borceux. Handbook of Categorical Algebra 1, Basic Category Theory. Encyclopedia of Mathematics and its Applications, Vol. 50, Cambridge University Press, 1994.","key":"3_CR5","DOI":"10.1017\/CBO9780511525872"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","volume":"16","author":"C.C. Elgot","year":"1978","unstructured":"C.C. Elgot, S.L. Bloom and R. Tindell. On the algebraic structure of rooted trees. Journal of Computer and System Sciences, 16(1978), 362\u2013399.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR7","first-page":"183","volume":"14","author":"Z. \u00e9sik","year":"1980","unstructured":"Z. \u00e9sik. Identities in iterative and rational algebraic theories. Computational Linguistics and Computer Languages, 14(1980), 183\u2013207.","journal-title":"Computational Linguistics and Computer Languages"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(88)90020-7","volume":"36","author":"Z. \u00e9sik","year":"1988","unstructured":"Z. \u00e9sik. The independence of the equational axioms of iteration theories. Journal of Computer and System Sciences, 36(1988), 66\u201376.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0304-3975(96)00240-X","volume":"177","author":"Z. \u00e9sik","year":"1997","unstructured":"Z. \u00e9sik. Completeness of Park induction. Theoretical Computer Science, 177 (1997) 217\u2013283.","journal-title":"Theoretical Computer Science"},{"unstructured":"Z. \u00e9sik. Group axioms for iteration. To appear.","key":"3_CR10"},{"doi-asserted-by":"crossref","unstructured":"Z. \u00e9sik and A. Labella. Equational properties of iteration in algebraically complete categories. in: proc. conf. Mathematical Foundations of Computer Science '96, LNCS 1113, Springer-Verlag, 1996, 336\u2013347.","key":"3_CR11","DOI":"10.1007\/3-540-61550-4_160"},{"key":"3_CR12","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"doi-asserted-by":"crossref","unstructured":"P.F. Hoogendijk. Mathematics of Program Construction. 2nd International Conference, June\/July 1992. LNCS 669, pages 163\u2013190. Springer Verlag, 1993.","key":"3_CR13","DOI":"10.1007\/3-540-56625-2_13"},{"doi-asserted-by":"crossref","unstructured":"P. Freyd. Algebraically complete categories. in: Proc. of Category Theory, Como 1990, LNM vol. 1488, Springer-Verlag, 1991, 95\u2013104.","key":"3_CR14","DOI":"10.1007\/BFb0084215"},{"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.","key":"3_CR15","DOI":"10.1017\/CBO9780511525902.006"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0022-0000(79)90032-1","volume":"18","author":"S. Ginali","year":"1979","unstructured":"S. Ginali. Regular trees and the free iterative theory. Journal of Computer and System Sciences, 18(1979), 228\u2013242.","journal-title":"Journal of Computer and System Sciences"},{"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.","key":"3_CR17","DOI":"10.1007\/BFb0063101"},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J. Lambek","year":"1968","unstructured":"J. Lambek. A fixed point theorem for complete categories. Mathematische Zeitschrift, 103(1968), 151\u2013161.","journal-title":"Mathematische Zeitschrift"},{"unstructured":"G. Lallement. Semigroups and Combinatorial Applications. Wiley-Interscience, 1979.","key":"3_CR19"},{"key":"3_CR20","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"},{"doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. in: proc. conf. Gesellschaft f\u00fcr Informatik, LNCS 104, Springer-Verlag, 1981, 167\u2013183.","key":"3_CR21","DOI":"10.1007\/BFb0017309"},{"doi-asserted-by":"crossref","unstructured":"J.B. Wright, J. Thatcher, J. Goguen, and E.G. Wagner. Rational algebraic theories and fixedpoint solutions. In Proc. 17th IEEE Symposium on Foundations of Computing, 1976, 147\u2013158.","key":"3_CR22","DOI":"10.1109\/SFCS.1976.24"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T23:19:56Z","timestamp":1683242396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638889","9783540696612"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0000461","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}