{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:38Z","timestamp":1725565418913},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_3","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T21:32:53Z","timestamp":1284154373000},"page":"40-54","source":"Crossref","is-referenced-by-count":10,"title":["Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms"],"prefix":"10.1007","author":[{"given":"Yoshihito","family":"Toyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"67","volume":"44, SIG-4","author":"T. Aoto","year":"2003","unstructured":"Aoto, T., Yamada, T.: Proving termination of simply typed term rewriting systems automatically. IPSJ Trans. on Prog.\u00a044, SIG-4, 67\u201377 (2003) (in Japanese)","journal-title":"IPSJ Trans. on Prog."},{"key":"3_CR2","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":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-17660-8_48","volume-title":"TAPSOFT \u201987 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987.","author":"F. Bellegarde","year":"1987","unstructured":"Bellegarde, F., Lescanne, P.: Transformation orderings. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol.\u00a0249, pp. 69\u201380. Springer, Heidelberg (1987)"},{"key":"3_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":"3_CR5","unstructured":"Ferreira, M.: Termination of term rewriting: Well-foundedness, totality and transformation, PhD thesis, Dep. of Comput. Sci., Utrecht University (1995)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Rubio, A.: Higher-Order Recursive Path Orderings. Procs. In: 14th IEEE Symp. on Logic in Comput. Sci., pp. 402\u2013411 (1999)","DOI":"10.1109\/LICS.1999.782635"},{"key":"3_CR7","unstructured":"Kamin, S., Levy, J.-J.: Two generalizations of the recursive path ordering, Unpublished Manuscript, University of Illinois (1980)"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1006\/jsco.1996.0002","volume":"21","author":"R. Kennaway","year":"1996","unstructured":"Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: Comparing Curried and Uncurried Rewriting. J. Symb. Comput.\u00a021(1), 15\u201339 (1996)","journal-title":"J. Symb. Comput."},{"key":"3_CR9","first-page":"210","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":"3_CR10","first-page":"35","volume":"42, SIG-7","author":"K. Kusakari","year":"2001","unstructured":"Kusakari, K.: On Proving Termination of Term Rewriting Systems with Higher- Order Variables. IPSJ Trans. on Prog.\u00a042, SIG-7, 35\u201345 (2001)","journal-title":"IPSJ Trans. on Prog."},{"key":"3_CR11","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 higherorder terms without \u03bb-abstraction. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol.\u00a01479, pp. 277\u2013293. Springer, Heidelberg (1998)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Lysne, O., Piri, J.: A termination ordering for higher order rewrite systems. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 26\u201324. Springer, Heidelberg (1995)","DOI":"10.1007\/3-540-59200-8_45"},{"key":"3_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":"3_CR14","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":"3_CR15","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T06:07:38Z","timestamp":1553062058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}