{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:43Z","timestamp":1725516223521},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_26","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"381-391","source":"Crossref","is-referenced-by-count":1,"title":["Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations"],"prefix":"10.1007","author":[{"given":"Yoshihito","family":"Toyama","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0168-0072(94)00056-9","volume":"75","author":"W. Buchholz","year":"1995","unstructured":"Buchholz, W.: Proof-theoretic analysis of termination proofs. Ann. Pure Appl. Logic\u00a075, 57\u201365 (1995)","journal-title":"Ann. Pure Appl. Logic"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-540-30124-0_11","volume-title":"Computer Science Logic","author":"J.E. Dawson","year":"2004","unstructured":"Dawson, J.E., Gor\u00e9, R.: A general theorem on termination of rewriting. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 100\u2013114. Springer, Heidelberg (2004)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Ordering for term-rewriting systems. Theoretical Comput. Sci.\u00a017, 279\u2013301 (1982)","journal-title":"Theoretical Comput. Sci."},{"key":"26_CR5","unstructured":"Ferreira, M.C.F.: Termination of term rewriting: Well-foundedness, totality and transformation, PhD thesis, Dep. of Comput. Sci., Utrecht University (1995)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/3-540-44802-0_34","volume-title":"Proc. of the 15th International Workshop Computer Science Logic","author":"J. Goubault-Larrecq","year":"2001","unstructured":"Goubault-Larrecq, J.: Well-founded recursive relations. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 484\u2013497. Springer, Heidelberg (2001)"},{"key":"26_CR7","first-page":"1","volume":"54","author":"J.-P. Jouannaud","year":"2007","unstructured":"Jouannaud, J.-P., Rubio, A.: Polymorphic higher-order recursive path orderings. J.\u00a0ACM\u00a054, Article 2, 1\u201348 (2007)","journal-title":"J.\u00a0ACM"},{"key":"26_CR8","unstructured":"Kamin, S., Levy, J.-J.: Two generalizations of the recursive path ordering, University of Illinois (unpublished manuscript) (1980)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"210","DOI":"10.2307\/1993287","volume":"95","author":"B. Kruskal","year":"1960","unstructured":"Kruskal, B.: Well quasi ordering, the tree theorem and Vazsonyi\u2019s conjecture. Trans. Am. Math. Soc.\u00a095, 210\u2013225 (1960)","journal-title":"Trans. Am. Math. Soc."},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BFb0055142","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Linfantsev","year":"1998","unstructured":"Linfantsev, M., Bachmair, L.: An LPO-based termination ordering for higher-order terms without \u03bb-abstraction. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol.\u00a01479, pp. 277\u2013293. Springer, Heidelberg (1998)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-59200-8_45","volume-title":"Rewriting Techniques and Applications","author":"O. Lysne","year":"1995","unstructured":"Lysne, O., Piris, J.: A termination ordering for higher order rewrite systems. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 26\u201340. Springer, Heidelberg (1995)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/BFb0055080","volume-title":"Automata, Languages and Programming","author":"P.-A. Mellies","year":"1998","unstructured":"Mellies, P.-A.: On a duality between Kruskal and Dershowitz theorems. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 518\u2013529. Springer, Heidelberg (1998)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0304-3975(96)00172-7","volume":"175","author":"A. Middeldorp","year":"1997","unstructured":"Middeldorp, A., Zantema, H.: Simple termination of rewrite systems. Theoretical Comput. Sci.\u00a0175, 127\u2013158 (1997)","journal-title":"Theoretical Comput. Sci."},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1017\/S0305004100003844","volume":"59","author":"C.S..J.A. Nash-Williams","year":"1963","unstructured":"Nash-Williams, C.St.J.A.: On well-quasi-ordering finite trees. Proc. of the Cambridge Phil. Soc.\u00a059, 833\u2013835 (1963)","journal-title":"Proc. of the Cambridge Phil. Soc."},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-45127-7_20","volume-title":"Rewriting Techniques and Applications","author":"F. Raamsdonk van","year":"2001","unstructured":"van Raamsdonk, F.: On termination of higher-order rewriting. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 261\u2013275. Springer, Heidelberg (2001)"},{"key":"26_CR16","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-540-25979-4_3","volume-title":"Rewriting Techniques and Applications","author":"Y. Toyama","year":"2004","unstructured":"Toyama, Y.: Termination of S-expression rewriting systems: Lexicographic path ordering for higher-order terms. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 40\u201354. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:23:53Z","timestamp":1620015833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}