{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:27:47Z","timestamp":1725488867190},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439165"},{"type":"electronic","value":"9783540456100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45610-4_17","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T06:47:11Z","timestamp":1186901231000},"page":"237-251","source":"Crossref","is-referenced-by-count":5,"title":["Rewriting Strategies for Instruction Selection"],"prefix":"10.1007","author":[{"given":"Martin","family":"Bravenboer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eelco","family":"Visser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/69558.75700","volume":"11","author":"A. V. Aho","year":"1989","unstructured":"A. V. Aho, M. Ganapathi, and S. W. K. Tjiang. Code generation using tree pattern matching and dynamic programming. ACM Transactions on Programming Languages and Systems, 11(4):491\u2013516, October 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1145\/321958.321970","volume":"23","author":"A. V. Aho","year":"1976","unstructured":"A. V. Aho and S. C. Johnson. Optimimal code generation for expression trees. Journal of the ACM, 23(3):488\u2013501, 1976.","journal-title":"Journal of the ACM"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"A. W. Appel. Modern Compiler Implementation in ML. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9780511811449"},{"key":"17_CR4","series-title":"AMAST Series in Computing","volume-title":"Language Prototyping. An Algebraic Specification Approach","year":"1996","unstructured":"A. van Deursen, J. Heering, and P. Klint, editors. Language Prototyping. An Algebraic Specification Approach, volume 5 of AMAST Series in Computing. World Scientific, Singapore, September 1996."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"H. Emmelmann, F.-W. Schroer, and R. Landwehr. BEG-a generator for efficient back ends. In ACM SIGPLAN 1989 Conference on Programming Language Design and Implementation (PLDI\u201989), pages 227\u2013237. ACM, July 1989.","DOI":"10.1145\/73141.74838"},{"issue":"1","key":"17_CR6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. H. Hoffmann","year":"1982","unstructured":"C. H. Hoffmann and M. J. O\u2019Donnell. Pattern matching in trees. Journal of the ACM, 29(1):68\u201395, January 1982.","journal-title":"Journal of the ACM"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"P. Johann and E. Visser. Fusing logic and control with local transformations: An example optimization. In B. Gramlich and S. Lucas, editors, Workshop on Reduction Strategies in Rewriting and Programming (WRS\u201901), volume 57 of Electronic Notes in Theoretical Computer Science, Utrecht, The Netherlands, May 2001. El-sevier Science Publishers.","DOI":"10.1016\/S1571-0661(04)00271-3"},{"issue":"3","key":"17_CR8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/203095.203098","volume":"17","author":"T. A. Proebsting","year":"1995","unstructured":"T. A. Proebsting. BURS automata generation. ACM Transactions on Programming Languages and Systems, 17(3):461\u2013486, May 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"E. Visser. Scoped dynamic rewrite rules. In M. van den Brand and R. Verma, editors, Rule Based Programming (RULE\u201901), volume 59\/4 of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, September 2001.","DOI":"10.1016\/S1571-0661(04)00298-1"},{"key":"17_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45127-7_27","volume-title":"Rewriting Techniques and Applications (RTA\u2019 01)","author":"E. Visser","year":"2001","unstructured":"E. Visser. Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In A. Middeldorp, editor, Rewriting Techniques and Applications (RTA\u2019 01), volume 2051 of Lecture Notes in Computer Science, pages 357\u2013361. Springer-Verlag, May 2001."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"E. Visser, Z.-e.-A. Benaissa, and A. Tolmach. Building program optimizers with rewriting strategies. In Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP\u201998), pages 13\u201326. ACM Press, September 1998.","DOI":"10.1145\/289423.289425"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45610-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T20:25:45Z","timestamp":1587846345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45610-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439165","9783540456100"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45610-4_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}