{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:19Z","timestamp":1725490219818},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442332"},{"type":"electronic","value":"9783540457886"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45788-7_12","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:04:02Z","timestamp":1188313442000},"page":"198-211","source":"Crossref","is-referenced-by-count":0,"title":["Descendants and Head Normalization of Higher-Order Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Hideto","family":"Kasuya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiko","family":"Sakai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyoshi","family":"Agusa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"12_CR2","first-page":"4","volume":"1249","author":"I. Durand","year":"1997","unstructured":"I. Durand and A. Middeldorp: Decidable Call by Need Computations in Term Rewriting (Extended Abstract). Proc. 14th CADE, LNAI 1249 (1997) 4\u201318 198","journal-title":"Proc. 14th CADE, LNAI"},{"key":"12_CR3","unstructured":"G. Huet and J.-J. L\u00e9vy: Computations in Orthogonal Rewriting Systems, I and II. Computational Logic, Essays in Honor of Alan Robinson, The MIT Press (1991) 396\u2013443 198, 201, 206"},{"key":"12_CR4","first-page":"1","volume":"40","author":"M. Iwami","year":"1999","unstructured":"M. Iwami and Y. Toyama: Simplification Ordering for Higher-order Rewrite systems. IPSJ Trans. on Programming 40 SIG 4 (PRO 3) (1999) 1\u201310 198","journal-title":"IPSJ Trans. on Programming"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(98)00078-4","volume":"208","author":"J.-P. Jouannaud","year":"1998","unstructured":"J.-P. Jouannaud and A. Rubio: Rewrite Orderings for Higher-order Terms in \u03b7-long \u03b2-normal Form and the Recursive Path Ordering. Theoretical Computer Science 208 (1998) 33\u201358 198, 200","journal-title":"Theoretical Computer Science"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(97)00143-6","volume":"192","author":"R. Mayr","year":"1998","unstructured":"R. Mayr and T. Nipkow: Higher-order Rewrite Systems and their Confluence. Theoretical Computer Science 192 (1998) 3\u201329 198","journal-title":"Theoretical Computer Science"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"A. Middeldorp: Call by Need Computations to Root-Stable Form. Proc. 24th POPL (1997) 94\u2013105 198, 205, 206, 207","DOI":"10.1145\/263699.263711"},{"key":"12_CR8","first-page":"497","volume":"14","author":"D. Miller","year":"1991","unstructured":"D. Miller: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification. Journal of Symbolic Logic 14 (1991) 497\u2013536 200","journal-title":"Journal of Symbolic Logic"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"T. Nipkow: Higher-Order Critical Pairs. Proc. 6th IEEE Symp. Logic in Computer Science (1991) 342\u2013349 198, 201","DOI":"10.1109\/LICS.1991.151658"},{"key":"12_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/BFb0037114","volume-title":"Proc. Int. Conf. Typed Lambda Calculi and Applications","author":"T. Nipkow","year":"1993","unstructured":"T. Nipkow: Orthogonal Higher-Order Rewrite Systems are Confluent. Proc. Int. Conf. Typed Lambda Calculi and Applications, LNCS 664 (1993) 306\u2013317 198"},{"key":"12_CR11","first-page":"198","volume-title":"Confluence for Abstract and Higher-Order Rewriting","author":"V. Oostrom van","year":"1994","unstructured":"V. van Oostrom: Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, (1994) 198"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(93)90240-T","volume":"112","author":"C. Talcott","year":"1993","unstructured":"C. Talcott: A Theory of Binding Structures and Applications to Rewriting. Theoretical Computer Science 112 (1993) 99\u2013143","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45788-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T05:23:08Z","timestamp":1550899388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45788-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442332","9783540457886"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45788-7_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}