{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:13Z","timestamp":1725566653829},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_2","type":"book-chapter","created":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T20:20:02Z","timestamp":1285618802000},"page":"2-16","source":"Crossref","is-referenced-by-count":2,"title":["Generalized Innermost Rewriting"],"prefix":"10.1007","author":[{"given":"Jaco","family":"van de Pol","sequence":"first","affiliation":[]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","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. Cambr. Univ. Pr., Cambridge (1998)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(89)90006-6","volume":"67","author":"J.C.M. Baeten","year":"1989","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W., Weijland, W.P.: Term rewriting systems with rule priorities. Theoretical Computer Science\u00a067, 283\u2013301 (1989)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/345099.345102","volume":"22","author":"W.J. Fokkink","year":"2000","unstructured":"Fokkink, W.J., Kamperman, J.F.T., Walters, H.R.: Lazy rewriting and eager machinery. ACM Transactions on Programming Languages and Systems\u00a022(1), 45\u201386 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"2_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6541-0","volume-title":"Software Engineering with OBJ: algebraic specification in action","author":"J. Goguen","year":"2000","unstructured":"Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P.: Introducing OBJ. In: Goguen, J., Malcolm, G. (eds.) Software Engineering with OBJ: algebraic specification in action, Kluwer, Dordrecht (2000)"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/FI-1995-24121","volume":"24","author":"B. Gramlich","year":"1995","unstructured":"Gramlich, B.: Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae\u00a024, 3\u201323 (1995)","journal-title":"Fundamenta Informaticae"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/S0890-5401(02)93176-7","volume":"178","author":"S. Lucas","year":"2002","unstructured":"Lucas, S.: Context-sensitive rewriting strategies. Information and Computation\u00a0178, 294\u2013343 (2002)","journal-title":"Information and Computation"},{"key":"2_CR7","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"The 3rd Int. W. on Rewriting \/ Logic and its Applications (WRLA 2000)","author":"M. Nakamura","year":"2001","unstructured":"Nakamura, M., Ogata, K.: The evaluation strategy for head normal form with and without on-demand flags. In: Futatsugi, K. (ed.) The 3rd Int. W. on Rewriting \/ Logic and its Applications (WRLA 2000). Electronic Notes in Theoretical Computer Science, vol.\u00a036, Elsevier, Amsterdam (2001)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08531-9","volume-title":"Computing in Systems Described by Equations","author":"M.J. O\u2019Donnell","year":"1977","unstructured":"O\u2019Donnell, M.J.: Computing in Systems Described by Equations. LNCS, vol.\u00a058. Springer, Heidelberg (1977)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Toyama, Y.: Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters\u00a025, 141\u2013143 (1987)","journal-title":"Information Processing Letters"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"van de Pol, J.C.: Just-in-time: on strategy annotations. In Int. Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001). Electronic Notes in Theoretical Computer Science, vol.\u00a057 (2001)","DOI":"10.1016\/S1571-0661(04)00267-1"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-45610-4_26","volume-title":"Rewriting Techniques and Applications","author":"J.C. Pol van de","year":"2002","unstructured":"van de Pol, J.C.: JITty: a rewriter with strategy annotations. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 367\u2013370. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T01:32:48Z","timestamp":1591925568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}