{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:19Z","timestamp":1725663499568},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:07:20Z","timestamp":1330236440000},"page":"143-147","source":"Crossref","is-referenced-by-count":5,"title":["Termination of combined (rewrite and \u03bb-calculus) systems"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Loria-Saenz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Steinbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(91)90037-3","volume":"83","author":"V. Breazu-Tannen","year":"1991","unstructured":"V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic strong normalization. TCS, 83:3\u201328, 1991.","journal-title":"TCS"},{"issue":"3","key":"10_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"N. Dershowitz. Orderings for term-rewriting systems. TCS, 17(3):279\u2013301, 1982.","journal-title":"TCS"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","volume":"75","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and M. Okada. A rationale for conditional equational programming. TCS, 75:111\u2013138, 1990.","journal-title":"TCS"},{"key":"10_CR4","unstructured":"J. R. Hindley and J. P. Seldin. Introduction to Combinators and \u03bb-Calculus. London Mathematical Soc., 1986."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"J.-P. Jouannaud and M. Okada. A computation model for executable higher-order algebraic specification languages. LICS, pages 350\u2013361, 1991.","DOI":"10.1109\/LICS.1991.151659"}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:50:17Z","timestamp":1619556617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}