{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:10Z","timestamp":1725664810653},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:40:56Z","timestamp":1330274456000},"page":"108-122","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A recursive path ordering for higher-order terms in \u03b7-long \u03b2-normal form"],"prefix":"10.1007","author":[{"given":"Jean-Pierre","family":"Jouannaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Rubio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Henk Barendregt. Handbook of Theoretical Computer Science, volume B, chapter Functional Programming and Lambda Calculus, pages 321\u2013364. North-Holland, 1990. J. van Leeuwen ed.","DOI":"10.1016\/B978-0-444-88074-1.50012-3"},{"key":"9_CR2","unstructured":"Henk Barendregt. Handbook of Logic in Computer Science, chapter Typed lambda calculi. Oxford Univ. Press, 1993. eds. Abramsky et al."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Jaco Van de Pol and Helmut Schwichtenberg. Strict functional for termination proofs. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, Edinburgh, Great Britain, 1995.","DOI":"10.1007\/BFb0014064"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Nachum Dershowitz. Orderings for term rewriting systems. Theoretical Computer Science, 17(3):279\u2013301, March 1982.","journal-title":"Theoretical Computer Science"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243\u2013309. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Maribel Fern\u00e1ndez and Jean-Pierre Jouannaud. Modular termination of term rewriting systems revisited. In Egidio Astesiano, Gianni Reggio, and Andrzej Tarlecki, editors, Recent Trends in Data Type Specification, volume 906 of Lecture Notes in Computer Science. Springer-Verlag, 1995. Refereed selection of papers presented at ADT'94.","DOI":"10.1007\/BFb0014432"},{"key":"9_CR7","first-page":"559","volume-title":"LNCS 355","author":"D. Kapur","year":"1989","unstructured":"Deepak Kapur and Han Tao Zhang. An overview of the rewrite rule laboratory (RRL). In Proc. 3rd Rewriting Techniques and Applications, Chapel Hill, LNCS 355, pages 559\u2013563. Springer-Verlag, 1989."},{"key":"9_CR8","unstructured":"Carlos Lor\u00eda-S\u00e1enz. A Theoretical Framework for Reasoning about Program Construction based on Extensions of Rewrite Systems. PhD thesis, Fachbereich Informatik der Universit\u00e4t Kaiserslautern, 1993."},{"key":"9_CR9","series-title":"volume 656 of Lecture Notes in Computer Science","first-page":"143","volume-title":"LNCS 656","author":"C. Lor\u00eda-S\u00e1enz","year":"1992","unstructured":"Carlos Lor\u00eda-S\u00e1enz and Joachim Steinbach. Termination of combined (rewrite and \u03bb-calculus) systems. In Proc. 3rd Int. Workshop on Conditional Term Rewriting Systems, Pont-\u00e0-Mousson, LNCS 656, volume 656 of Lecture Notes in Computer Science, pages 143\u2013147. Springer-Verlag, 1992."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Olav Lysne and Javier Piris. A termination ordering for higher order rewrite systems. In Proc. 6th Rewriting Techniques and Applications, Kaiserslautern, LNCS 914, Kaiserslautern, Germany, 1995.","DOI":"10.1007\/3-540-59200-8_45"},{"key":"9_CR11","volume-title":"Normalised rewriting and normalised completion","author":"C. March\u00e9","year":"1994","unstructured":"Claude March\u00e9. Normalised rewriting and normalised completion. In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, Paris, France, July 1994. IEEE Comp. Soc. Press."},{"key":"9_CR12","unstructured":"Tobias Nipkow. Higher order critical pairs. In Proc. IEEE Symp. on Logic in Comp. Science, Amsterdam, 1991."},{"key":"9_CR13","volume-title":"LNCS 690","author":"P. Nivela","year":"1993","unstructured":"Pilar Nivela and Robert Nieuwenhuis. Practical results on the saturation of full first-order clauses: Experiments with the saturate system. (system description). In C. Kirchner, editor, 5th International Conference on Rewriting Techniques and Applications, LNCS 690, Montreal, Canada, June 16\u201318, 1993. Springer-Verlag."}],"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\/3-540-61464-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:41:16Z","timestamp":1558255276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}