{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:01:23Z","timestamp":1794337283910,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540513711","type":"print"},{"value":"9783540462019","type":"electronic"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035765","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T04:00:28Z","timestamp":1133409628000},"page":"249-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Infinite normal forms"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"St\u00e9phane","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David A.","family":"Plaisted","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"J. Goguen, J. Thatcher, E. Wagner, Initial algebra semantics and continuous algebras, JACM 24(1), pp.69\u201395 (1977)","journal-title":"JACM"},{"issue":"1&2","key":"18_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz, Termination of rewritting, J. of Symbolic Computation, 3(1&2), pp. 69\u2013115; 4(3), pp. 409\u2013410 (1987).","journal-title":"J. of Symbolic Computation"},{"key":"18_CR3","unstructured":"N. Dershowitz, J.-P. Jouannaud, Rewriting systems, in Handbook of Theoretical Computer Science, J. van Leeuwen, ed., North-Holland, Amsterdam (to appear 1989)."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz, S. Kaplan, Rewrite, rewrite, rewrite, rewrite, rewrite, Principles of Programming Languages, pp. 250\u2013259, Austin, TX (1989).","DOI":"10.1145\/75277.75299"},{"key":"18_CR5","unstructured":"H. Ehrig, F. Parisi-Presicce, P. Boehm, C. Rieckhoff, C. Dmitrovici, and M. Gro\u00dfe-Rhode, Algebraic data type and process specifications based on projection spaces. In Recent Trends in Data Type Specifications: Selected Papers from the Fifth Workshop on Specification of Abstract Data Types, Gullane, Scotland. Lecture Notes in Computer Science 332, Springer, pp. 23\u201343 (1988)."},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems, JACM 27, 4, pp. 797\u2013821 (1980).","journal-title":"JACM"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/B978-0-12-115350-2.50017-8","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"G. Huet, D. C. Oppen, Equations and rewrite rules: A survey, in Formal Language Theory: Perspectives and Open Problems, R. Book, ed., Academic Press, New York, pp. 349\u2013405 (1980)."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"S. Kaplan, Conditional rewrite rules, TCS 33, pp. 175\u2013193 (1984).","journal-title":"TCS"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"S. Kaplan, J.-L. R\u00e9my, Completion algorithms for conditional rewriting systems, in Resolution of Equations in Algebraic Structures, H. Ait-Kaci & M. Nivat, eds., Academic Press, pp. 141\u2013170 (1989).","DOI":"10.1016\/B978-0-12-046371-8.50011-0"},{"key":"18_CR10","first-page":"143","volume":"32","author":"J.-W. Klop","year":"1987","unstructured":"J.-W. Klop, Term rewriting systems: a tutorial, Bulletin of the EATCS, 32, pp. 143\u2013183 (1987).","journal-title":"Bulletin of the EATCS"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"B. Moeller, On the specification of infinite objects \u2014 ordered and continuous models of algebraic types, Acta Informatica (1984).","DOI":"10.1007\/BF00267044"},{"key":"18_CR12","volume-title":"LOG(F): An optimal combination of logic programming, rewriting and lazy evaluation","author":"S. Narain","year":"1988","unstructured":"S. Narain, LOG(F): An optimal combination of logic programming, rewriting and lazy evaluation, Ph.D. thesis, Department of Computer Science, UCLA, Los Angeles, CA (1988)."},{"key":"18_CR13","first-page":"255","volume":"15","author":"M. Nivat","year":"1975","unstructured":"M. Nivat, On the interpretation of recursive polyadic program schemes, Symposium Math. 15, pp. 255\u2013281, Rome (1975).","journal-title":"Symposium Math."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"M. J. O'Donnell, Computing in systems described by equations, Lecture Notes in Computer Science 58, Springer (1977).","DOI":"10.1007\/3-540-08531-9"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"D. Scott, Data types as lattices, SIAM Journal of Computing 5 (1976)","DOI":"10.1137\/0205037"},{"key":"18_CR16","volume-title":"Denotational semantics: The Scott-Strachey approach to programming languages","author":"J. Stoy","year":"1977","unstructured":"J. Stoy, Denotational semantics: The Scott-Strachey approach to programming languages, M.I.T. Press, Cambridge (1977)"},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.3233\/FI-1986-9106","volume":"9","author":"A. Tarlecki","year":"1986","unstructured":"A. Tarlecki, M. Wirsing, Continuous abstract data types, Fundamenta Informaticae 9, pp. 95\u2013126 (1986).","journal-title":"Fundamenta Informaticae"},{"key":"18_CR18","volume-title":"Handbook of Theoretical Computer Science","author":"M. Wirsing","year":"1989","unstructured":"M. Wirsing, Algebraic specification, in Handbook of Theoretical Computer Science, J. van Leeuwen, ed., North-Holland, Amsterdam (to appear 1989)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:13:34Z","timestamp":1706753614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035765"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0035765","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0035746","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"29 November 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}