{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:39Z","timestamp":1725456999180},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032045","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"370-385","source":"Crossref","is-referenced-by-count":4,"title":["Nonoblivious normalization algorithms for nonlinear rewrite systems"],"prefix":"10.1007","author":[{"given":"Rakesh M.","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","first-page":"108","volume":"21","author":"P. Chew","year":"1980","unstructured":"Paul Chew. An improved algorithm for computing with equations. In Proceedings of the IEEE Conference on Foundations of Computer Science, volume 21, pages 108\u2013117, 1980.","journal-title":"Proceedings of the IEEE Conference on Foundations of Computer Science"},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Nachum Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J. Goguen, J.A. Jounnaud, and J.-P. Meseguer. Principles of OBJ2. In Proceedings of the ACM Symposium on Principles of Programming Languages, 1985.","DOI":"10.1145\/318593.318610"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"J. Guttag, E. Horowitz, and D. Musser. Abstract data types and software validation. Information Science Research Report ISI\/RR-76-48, University of Southern California, 1976.","DOI":"10.21236\/ADA029896"},{"issue":"4","key":"29_CR5","doi-asserted-by":"crossref","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. Journal of the Association for Computing Machinery, 27(4):797\u2013821, 1980. Also in the 18th IEEE Symposium on Foundations of Computer Science, 1977.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"29_CR6","volume-title":"Combinatory Reduction Systems","author":"J.W. Klop","year":"1980","unstructured":"J.W. Klop. Combinatory Reduction Systems. PhD thesis, Mathematisch Centrum, Amsterdam, 1980."},{"key":"29_CR7","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D.E. Knuth","year":"1970","unstructured":"D.E. Knuth and P. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013297. Oxford, Pergammon Press, 1970."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Michael J. O'Donnell. Computing in Systems Described by Equations, volume 58 of Lecture Notes in Computer Science. Springer-Verlag, 1977.","DOI":"10.1007\/3-540-08531-9"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Michael J. O'Donnell. Equational Logic as a Programming Language. MIT Press, 1985.","DOI":"10.1007\/3-540-15648-8_20"},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B.K. Rosen","year":"1973","unstructured":"B.K. Rosen. Tree manipulating systems and church-rosser theorems. Journal of the Association for Computing Machinery, 20:160\u2013187, 1973. Also in the 2nd ACM Symposium on Theory of Computing.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"29_CR11","unstructured":"Rakesh M. Verma and I.V. Ramakrishnan. Nonoblivious graph reduction for declarative programs. Technical Report UH-CS-90-05, University of Houston, 1990."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T21:19:58Z","timestamp":1683321598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0032045","relation":{},"subject":[]}}