{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:17:06Z","timestamp":1725520626564},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894384"},{"type":"electronic","value":"9783540894391"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89439-1_48","type":"book-chapter","created":{"date-parts":[[2008,11,15]],"date-time":"2008-11-15T03:03:10Z","timestamp":1226718190000},"page":"697-711","source":"Crossref","is-referenced-by-count":4,"title":["A Higher-Order Iterative Path Ordering"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Kop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Femke","family":"van Raamsdonk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"48_CR1","first-page":"171","volume":"37","author":"J. Bergstra","year":"1985","unstructured":"Bergstra, J., Klop, J.W.: Algebra of communicating processes. Theoretical Computer Science\u00a037(1), 171\u2013199 (1985)","journal-title":"Theoretical Computer Science"},{"key":"48_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87531-4_1","volume-title":"Computer Science Logic","author":"F. Blanqui","year":"2008","unstructured":"Blanqui, F., Jouannaud, J.-P., Rubio, A.: The computability path ordering: The end of a quest. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 1\u201314. Springer, Heidelberg (2008)"},{"issue":"1\u20132","key":"48_CR3","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. Annals of Pure and Applied Logic\u00a075(1\u20132), 57\u201365 (1995)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"48_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.: Orderings for term rewriting systems. Theoretical Computer Science\u00a017(3), 279\u2013301 (1982)","journal-title":"Theoretical Computer Science"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Okada, M.: A computation model for executable higher-order algebraic specification languages. In: Proceedings of LICS 1991, Amsterdam, The Netherlands, pp. 350\u2013361 (July 1991)","DOI":"10.1109\/LICS.1991.151659"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Rubio, A.: The higher-order recursive path ordering. In: Proceedings of LICS 1999, Trento, Italy, pp. 402\u2013411 (July 1999)","DOI":"10.1109\/LICS.1999.782635"},{"key":"48_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/11805618_29","volume-title":"Term Rewriting and Applications","author":"J.-P. Jouannaud","year":"2006","unstructured":"Jouannaud, J.-P., Rubio, A.: Higher-order orderings for normal rewriting. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 387\u2013399. Springer, Heidelberg (2006)"},{"issue":"1","key":"48_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1206035.1206037","volume":"54","author":"J.-P. Jouannaud","year":"2007","unstructured":"Jouannaud, J.-P., Rubio, A.: Polymorphic higher-order recursive path orderings. Journal of the ACM\u00a054(1), 1\u201348 (2007)","journal-title":"Journal of the ACM"},{"key":"48_CR9","unstructured":"Kamin, S., L\u00e9vy, J.-J.: Two generalizations of the recursive path ordering. University of Illinois (1980)"},{"key":"48_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/11780274_28","volume-title":"Algebra, Meaning, and Computation","author":"J.W. Klop","year":"2006","unstructured":"Klop, J.W., van Oostrom, V., de Vrijer, R.: Iterative lexicographic path orders. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol.\u00a04060, pp. 541\u2013554. Springer, Heidelberg (2006)"},{"key":"48_CR11","unstructured":"Koprowski, A.: Coq formalization of the higher-order recursive path ordering. Technical Report CSR-06-21, Eindhoven University of Technology (August 2006)"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Nipkow, T.: Higher-order critical pairs. In: Proceedings of LICS 1991, Amsterdam, The Netherlands, pp. 342\u2013349 (July 1991)","DOI":"10.1109\/LICS.1991.151658"},{"key":"48_CR13","unstructured":"van Oostrom, V.: Personal communication (2008)"},{"key":"48_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)"},{"issue":"2","key":"48_CR15","doi-asserted-by":"publisher","first-page":"198","DOI":"10.2307\/2271658","volume":"32","author":"W.W. Tait","year":"1967","unstructured":"Tait, W.W.: Intensional interpretations of functionals of finite type I. Journal of Symbolic Logic\u00a032(2), 198\u2013212 (1967)","journal-title":"Journal of Symbolic Logic"},{"key":"48_CR16","unstructured":"Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89439-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T02:03:45Z","timestamp":1551665025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89439-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540894384","9783540894391"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89439-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}