{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:42Z","timestamp":1725455922302},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055873X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013823","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T02:24:11Z","timestamp":1132712651000},"page":"115-127","source":"Crossref","is-referenced-by-count":1,"title":["On the relation between primitive recursion, schematization, and divergence"],"prefix":"10.1007","author":[{"given":"Miki","family":"Hermann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-7118-2","volume-title":"Canonical equational proofs","author":"L. Bachmair","year":"1991","unstructured":"L. Bachmair. Canonical equational proofs. Birkh\u00e4user, Boston, 1991."},{"key":"9_CR2","first-page":"20","volume-title":"volume 510 of Lecture Notes in Computer Science","author":"H. Chen","year":"1991","unstructured":"H. Chen and J. Hsiang. Logic programming with recurrence domains. In J. Leach Albert, B. Monien, and M. Rodr\u00edguez Artalejo, editors, Proceedings 18th ICALP Conference, Madrid (Spain), volume 510 of Lecture Notes in Computer Science, pages 20\u201334. Springer-Verlag, July 1991."},{"key":"9_CR3","first-page":"100","volume-title":"volume 516 of Lecture Notes in Computer Science","author":"H. Chen","year":"1990","unstructured":"H. Chen, J. Hsiang, and H.-C. Kong. On finite representations of infinite sequences of terms. In S. Kaplan and M. Okada, editors, Proceedings 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal (Canada), volume 516 of Lecture Notes in Computer Science, pages 100\u2013114. Springer-Verlag, June 1990."},{"key":"9_CR4","volume-title":"Research report 699","author":"H. Comon","year":"1991","unstructured":"H. Comon. Completion of rewrite systems with membership constraints. Research report 699, Laboratoire de Recherche en Informatique, Orsay, France, 1991."},{"key":"9_CR5","first-page":"243","volume-title":"Handbook of Theoretical Computer Science B: Formal Methods and Semantics","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science B: Formal Methods and Semantics, chapter 6, pages 243\u2013309. North-Holland, Amsterdam, 1990. Also as: Research report 478, LRI, Univ. Paris-Sud, Orsay, France."},{"key":"9_CR6","first-page":"162","volume":"43","author":"N. Dershowitz","year":"1991","unstructured":"N. Dershowitz and J.-P. Jouannaud. Notations for rewriting. Bulletin of the European Association for Theoretical Computer Science, 43:162\u2013172, February 1991.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"issue":"1","key":"9_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(86)90175-1","volume":"43","author":"F. Fages","year":"1986","unstructured":"F. Fages and G. Huet. Complete sets of unifiers and matchers in equational theories. Theoretical Computer Science, 43(1):189\u2013200, 1986.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1137\/0212012","volume":"12","author":"J.V. Guttag","year":"1983","unstructured":"J.V. Guttag, D. Kapur, and D.R. Musser. On proving uniform termination and restricted termination of rewrite systems. SIAM Journal on Computing, 12(1):189\u2013214, February 1983.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR9","volume-title":"SEKI Report SR-88-18","author":"B. Gramlich","year":"1988","unstructured":"B. Gramlich. Unification of term schemes \u2014 theory and applications. SEKI Report SR-88-18, Universit\u00e4t Kaiserslautern, Germany, 1988."},{"issue":"3","key":"9_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01888225","volume":"2","author":"M. Hermann","year":"1990","unstructured":"M. Hermann. Chain properties of rule closures. Formal Aspects of Computing, 2(3):207\u2013225, 1990.","journal-title":"Formal Aspects of Computing"},{"key":"9_CR11","first-page":"148","volume-title":"Avanc\u00e9es en Programation\u201d \u2014 Journ\u00e9es AFCET-GROPLAN","author":"M. Hermann","year":"1990","unstructured":"M. Hermann. Vademecum of divergent term rewriting systems. In \u201cAvanc\u00e9es en Programation\u201d \u2014 Journ\u00e9es AFCET-GROPLAN, Nice (France), volume 70, pages 148\u2013164. BIGRE, January 1990."},{"key":"9_CR12","first-page":"143","volume-title":"volume 516 of Lecture Notes in Computer Science","author":"H. Kirchner","year":"1990","unstructured":"H. Kirchner and M. Hermann. Meta-rule synthesis from crossed rewrite systems. In S. Kaplan and M. Okada, editors, Proceedings 2nd International Workshop on Conditional and Typed Rewriting Systems, Montreal (Canada), volume 516 of Lecture Notes in Computer Science, pages 143\u2013154. Springer-Verlag, June 1990."},{"issue":"2\u20133","key":"9_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(89)90007-8","volume":"67","author":"H. Kirchner","year":"1989","unstructured":"H. Kirchner. Schematization of infinite sets of rewrite rules generated by divergent completion process. Theoretical Computer Science, 67(2\u20133):303\u2013332, October 1989.","journal-title":"Theoretical Computer Science"},{"key":"9_CR14","first-page":"374","volume-title":"volume 488 of Lecture Notes in Computer Science","author":"A. Sattler-Klein","year":"1991","unstructured":"A. Sattler-Klein. Divergence phenomena during completion. In R.V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy), volume 488 of Lecture Notes in Computer Science, pages 374\u2013385. Springer-Verlag, April 1991."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013823.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T10:08:10Z","timestamp":1607335690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055873X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0013823","relation":{},"subject":[]}}