{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T15:10:10Z","timestamp":1747581010806,"version":"3.40.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Categorical Structures"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1023\/a:1008708924144","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T16:37:32Z","timestamp":1040575052000},"page":"173-216","source":"Crossref","is-referenced-by-count":7,"title":["Iteration 2-theories"],"prefix":"10.1007","volume":"9","author":[{"given":"S. L.","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Labella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. G.","family":"Manes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"256719_CR1","series-title":"Prentice-Hall Series in Automatic Computation","volume-title":"The theory of Parsing, Translation, and Compiling. Vol. I: Parsing","author":"A. Aho","year":"1972","unstructured":"Aho, A. and Ullman, J.: The theory of Parsing, Translation, and Compiling. Vol. I: Parsing, Prentice-Hall Series in Automatic Computation, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1972."},{"key":"256719_CR2","doi-asserted-by":"crossref","unstructured":"Backhouse, R., Birjsterveld, M., van Geldrop, R. and van derWoude, J.: Categorical fixed point calculus, in Category Theory and Computer Science\u2019 95, Lecture Notes in Comput. Sci. 953, Springer-Verlag, 1995, pp. 159-179.","DOI":"10.1007\/3-540-60164-3_25"},{"key":"256719_CR3","first-page":"26","volume":"9","author":"S. L. Bloom","year":"1980","unstructured":"Bloom, S. L., Elgot, C. C. and Wright, J. B.: Solutions of the iteration equation and extension of the scalar iteration operation, SIAM J. Comput.\n9 (1980), 26-45.","journal-title":"SIAM J. Comput."},{"key":"256719_CR4","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/0209039","volume":"9","author":"S. L. Bloom","year":"1980","unstructured":"Bloom, S. L., Elgot, C. C. and Wright, J. B.: Vector iteration in pointed iterative theories, SIAM J. Comput.\n9 (1980), 525-540.","journal-title":"SIAM J. Comput."},{"key":"256719_CR5","doi-asserted-by":"crossref","unstructured":"Bloom, S. L. and \u00c9sik, Z.: Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monogr. Theoret. Comput. Sci., Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-78034-9"},{"key":"256719_CR6","doi-asserted-by":"crossref","unstructured":"Bloom, S. L. and \u00c9sik, Z.: Some quasi varieties of iteration theories, in Mathematical Foundations of Programming Semantics\u2019 93, Lecture Notes in Comput. Sci. 802, Springer-Verlag, 1994, pp. 378-409.","DOI":"10.1007\/3-540-58027-1_19"},{"key":"256719_CR7","doi-asserted-by":"crossref","unstructured":"Bloom, S. L., \u00c9sik, Z., Labella, A. and Manes, E.: Iteration 2-theories, Extended abstract, in Algebraic Methodology and Software Technology, 6th International Conference AMAST 97, Lecture Notes in Comput. Sci. 1349, Springer-Verlag, 1997, pp. 30-44.","DOI":"10.1007\/BFb0000461"},{"key":"256719_CR8","doi-asserted-by":"crossref","unstructured":"Borceux, F.: Handbook of Categorical Algebra 1, Basic Category Theory, Encyclopedia Math. Appl., Vol. 50, Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511525858"},{"key":"256719_CR9","doi-asserted-by":"crossref","unstructured":"Corradini, A. and Gadducci, F.: CPO models for infinite trem rewriting, in Proc. Conf. Algebraic Methodology and Software Technology\u2019 95, Lecture Notes in Comput. Sci. 936, Springer-Verlag, 1995, pp. 368-384.","DOI":"10.1007\/3-540-60043-4_65"},{"key":"256719_CR10","doi-asserted-by":"crossref","unstructured":"Corradini, A. and Gadducci, F.: Rational term rewriting, in Proc. Conf. Foundations of Software Science and Computation Structures (Lisbon, 1998), Lecture Notes in Comput. Sci. 1378, Springer-Verlag, 1998, pp. 156-171.","DOI":"10.1007\/BFb0053548"},{"key":"256719_CR11","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","volume":"16","author":"C. C. Elgot","year":"1978","unstructured":"Elgot, C. C., Bloom, S. L. and Tindell, R.: On the algebraic structure of rooted trees, J. Comput. System Sci.\n16 (1978), 362-399.","journal-title":"J. Comput. System Sci."},{"key":"256719_CR12","first-page":"183","volume":"14","author":"Z. \u00c9sik","year":"1980","unstructured":"\u00c9sik, Z.: Identities in iterative and rational algebraic theories, Computational Linguistics and Computer Languages\n14 (1980), 183-207.","journal-title":"Computational Linguistics and Computer Languages"},{"key":"256719_CR13","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(88)90020-7","volume":"36","author":"Z. \u00c9sik","year":"1988","unstructured":"\u00c9sik, Z.: The independence of the equational axioms of iteration theories, J. Comput. System Sci.\n36 (1988), 66-76.","journal-title":"J. Comput. System Sci."},{"key":"256719_CR14","doi-asserted-by":"crossref","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, Theoret. Comput. Sci.\n177 (1997), 217-283.","journal-title":"Theoret. Comput. Sci."},{"key":"256719_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"Z. \u00c9sik","year":"1999","unstructured":"\u00c9sik, Z.: Group axioms for iteration, Inform. and Comput.\n148 (1999), 131-180.","journal-title":"Inform. and Comput."},{"key":"256719_CR16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0304-3975(97)00158-8","volume":"195","author":"Z. \u00c9sik","year":"1998","unstructured":"\u00c9sik, Z. and Labella, A.: Equational properties of iteration in algebraically complete categories, Theoret. Comput. Sci.\n195 (1998), 61-89.","journal-title":"Theoret. Comput. Sci."},{"key":"256719_CR17","doi-asserted-by":"crossref","unstructured":"Freyd, P.: Algebraically complete categories, in Proc. of Category Theory, Como 1990, Lecture Notes in Math. 1488, Springer-Verlag, 1991, pp. 95-104.","DOI":"10.1007\/BFb0084215"},{"key":"256719_CR18","doi-asserted-by":"crossref","unstructured":"Freyd, P.: Remarks on algebraically compact categories, in Applications of Categories in Computer Science, London Math. Society Lecture Notes Ser. 77, Cambridge University Press, 1992, pp. 95-106.","DOI":"10.1017\/CBO9780511525902.006"},{"key":"256719_CR19","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F. and Steinby, M.: Tree Automata, Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"256719_CR20","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0022-0000(79)90032-1","volume":"18","author":"S. Ginali","year":"1979","unstructured":"Ginali, S.: Regular trees and the free iterative theory, J. Comput. System Sci.\n18 (1979), 228-242.","journal-title":"J. Comput. System Sci."},{"key":"256719_CR21","doi-asserted-by":"crossref","unstructured":"Kelly, G. M. and Street, R.: Review of the elements of 2-categories, in Lecture Notes in Math. 420, Springer-Verlag, 1974, pp. 76-103.","DOI":"10.1007\/BFb0063101"},{"key":"256719_CR22","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01110627","volume":"103","author":"J. Lambek","year":"1968","unstructured":"Lambek, J.: A fixed point theorem for complete categories, Math. Z.\n103 (1968), 151-161.","journal-title":"Math. Z."},{"key":"256719_CR23","unstructured":"Lallement, G.: Semigroups and Combinatorial Applications, Wiley, 1979."},{"key":"256719_CR24","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1073\/pnas.50.5.869","volume":"50","author":"F. L. Lawvere","year":"1963","unstructured":"Lawvere, F. L.: Functorial semantics of algebraic theories, Proc. Nat. Acad. Sci. U.S.A.\n50 (1963), 869-873.","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"256719_CR25","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency, Theoret. Comput. Sci.\n96 (1992), 73-155.","journal-title":"Theoret. Comput. Sci."},{"key":"256719_CR26","doi-asserted-by":"crossref","unstructured":"Park, D.: Concurrency and automata on infinite sequences, in Proc. Conf. Gesellschaft f\u00fcr Informatik, Lecture Notes in Comput. Sci. 104, Springer-Verlag, 1981, pp. 167-183.","DOI":"10.1007\/BFb0017309"},{"key":"256719_CR27","doi-asserted-by":"crossref","unstructured":"Power, A. J.: An abstract formulation for rewrite systems, in Proc. Conf. Category Theory and Computer Science, Lecture Notes in Comput. Sci. 389, Springer-Verlag, 1989, pp. 300-312.","DOI":"10.1007\/BFb0018358"},{"key":"256719_CR28","doi-asserted-by":"crossref","unstructured":"Wright, J. B., Thatcher, J., Goguen, J. andWagner, E. G.: Rational algebraic theories and fixedpoint solutions, in Proc. 17th IEEE Symposium on Foundations of Computing, 1976, pp. 147-158.","DOI":"10.1109\/SFCS.1976.24"}],"container-title":["Applied Categorical Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008708924144.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008708924144\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008708924144.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:29:42Z","timestamp":1747578582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008708924144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["256719"],"URL":"https:\/\/doi.org\/10.1023\/a:1008708924144","relation":{},"ISSN":["0927-2852","1572-9095"],"issn-type":[{"type":"print","value":"0927-2852"},{"type":"electronic","value":"1572-9095"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}