{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:47:55Z","timestamp":1759146475994},"reference-count":37,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0304-3975(90)90145-8","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"177-211","source":"Crossref","is-referenced-by-count":15,"title":["Code selection by inversion of order-sorted derivors"],"prefix":"10.1016","volume":"73","author":[{"given":"Robert","family":"Giegerich","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90145-8_BIB1","first-page":"334","article-title":"Efficient tree pattern matching: an aid to code generation","author":"Aho","year":"1985","journal-title":"Proc. 12th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90145-8_BIB2","series-title":"Code generation using tree matching and dynamic programming","author":"Aho","year":"1986"},{"issue":"3","key":"10.1016\/0304-3975(90)90145-8_BIB3","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/321958.321970","article-title":"Optimal code generation for expression trees","volume":"23","author":"Aho","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90145-8_BIB4","series-title":"Report TUM-18524","article-title":"Tree grammars as a pattern matching mechanism for code generation","author":"Benk","year":"1985"},{"key":"10.1016\/0304-3975(90)90145-8_BIB5","series-title":"PROSPECTRA-Report M.1.3-12-7.0","article-title":"CED\u2014A system for conditional equational completion, User Manual (Version 1.0)","author":"Bertling","year":"1988"},{"key":"10.1016\/0304-3975(90)90145-8_BIB6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","article-title":"Tree generating regular systems","volume":"14","author":"Brainerd","year":"1969","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90145-8_BIB7","series-title":"Dissertation","article-title":"Formalization and automatic derivation of code generators","author":"Cattell","year":"1978"},{"key":"10.1016\/0304-3975(90)90145-8_BIB8","article-title":"An improvement to bottom-up tree pattern matching","author":"Chase","year":"1987","journal-title":"Proc. 14th ACM Symp. on Principles of Programming Languages"},{"issue":"6","key":"10.1016\/0304-3975(90)90145-8_BIB9","article-title":"Using dynamic programming to generate optimized code in a Graham-Glanville style code generator","volume":"19","author":"Christopher","year":"1984","journal-title":"Proc. SIGPLAN '84 Symp. on Compiler Construction, SIGPLAN Notices"},{"key":"10.1016\/0304-3975(90)90145-8_BIB10","first-page":"52","article-title":"Principles of OBJ2","author":"Futatsugi","year":"1985","journal-title":"Proc. 12th ACM Symp. on Principles of Programming Languages"},{"issue":"6","key":"10.1016\/0304-3975(90)90145-8_BIB11","first-page":"70","article-title":"Attribute coupled grammars","volume":"19","author":"Ganzinger","year":"1984","journal-title":"Proc. 2nd SIGPLAN '84 Symp. on Compiler Construction, SIGPLAN Notices"},{"key":"10.1016\/0304-3975(90)90145-8_BIB12","series-title":"Report TUM-18412","article-title":"Code generation phase models based on abstract machine description","author":"Giegerich","year":"1984"},{"key":"10.1016\/0304-3975(90)90145-8_BIB13","series-title":"Programs as Data Objects","article-title":"Logic specification of code generation techniques","volume":"217","author":"Giegerich","year":"1985"},{"key":"10.1016\/0304-3975(90)90145-8_BIB14","series-title":"Proc. ESOP '88","article-title":"Code selection techniques: pattern matching, tree parsing, and inversion of derivors","volume":"300","author":"Giegerich","year":"1988"},{"key":"10.1016\/0304-3975(90)90145-8_BIB15","series-title":"Proc. ICALP '85","first-page":"221","article-title":"Operational semantics of order sorted algebra","volume":"194","author":"Goguen","year":"1985"},{"key":"10.1016\/0304-3975(90)90145-8_BIB16","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","volume":"Vol. IV","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(90)90145-8_BIB17","series-title":"Dissertation","article-title":"A machine independent algorithm for code generation and its use in retargetable compilers","author":"Glanville","year":"1977"},{"key":"10.1016\/0304-3975(90)90145-8_BIB18","series-title":"Report No. 14","article-title":"Order sorted algebra. Semantics and theory of computation","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(90)90145-8_BIB19","first-page":"231","article-title":"A new method for compiler code generation","author":"Glanville","year":"1977","journal-title":"Proc. 5th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90145-8_BIB20","series-title":"Diploma Thesis","article-title":"Ausarbeitung und Implementierung des Ansatzes von Davidson\/Fraser zur maschinenspezifischen Optimierung","author":"Greve","year":"1988"},{"issue":"6","key":"10.1016\/0304-3975(90)90145-8_BIB21","article-title":"High quality code generation via bottom-up tree pattern matching","volume":"21","author":"Hatcher","year":"1986","journal-title":"Proc. SIGPLAN '86 Symp. on Compiler Construction, SIGPLAN Notices"},{"key":"10.1016\/0304-3975(90)90145-8_BIB22","article-title":"Graham-Glanville code generators","author":"Henry","year":"1984","journal-title":"Dissertation"},{"issue":"1","key":"10.1016\/0304-3975(90)90145-8_BIB23","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","article-title":"Pattern matching in trees","volume":"29","author":"Hoffman","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90145-8_BIB24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/MS.1987.230704","article-title":"An alternative to the Graham-Glanville code-generation method","author":"Horspool","year":"1987","journal-title":"IEEE Software"},{"key":"10.1016\/0304-3975(90)90145-8_BIB25","first-page":"96","article-title":"Proofs by induction in equational theories with constructors","author":"Huet","year":"1980","journal-title":"Proc. 21st SFCS"},{"key":"10.1016\/0304-3975(90)90145-8_BIB26","series-title":"Formal Language Theory: Perspectives and Open Problems","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(90)90145-8_BIB27","series-title":"Report 49","article-title":"Code generation based on operator identification","author":"Kastens","year":"1988"},{"key":"10.1016\/0304-3975(90)90145-8_BIB28","article-title":"Tree templates and subtree transformational grammars","author":"Kron","year":"1975","journal-title":"Dissertation"},{"key":"10.1016\/0304-3975(90)90145-8_BIB29","series-title":"Rapport de Recherche","article-title":"Code generation based on template-driven target term rewriting","author":"Mazaud","year":"1986"},{"key":"10.1016\/0304-3975(90)90145-8_BIB30","article-title":"Optimal code generation for expression trees: an application of BURS theory","author":"Pelegr\u00ed-Llopart","year":"1988","journal-title":"Proc. 15th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(90)90145-8_BIB31","series-title":"Dissertation","article-title":"Formale Beschreibung von Maschinen, Implementierungen und optimierender Maschinencodeerzeungung aus attributuerten Programmgraphen","author":"Ripken","year":"1977"},{"key":"10.1016\/0304-3975(90)90145-8_BIB32","series-title":"Proc. 1st Conf. on Rewriting Techniques and Applications","first-page":"141","article-title":"NARROWER: a new algorithm for unification and its application to logic programming","volume":"202","author":"Rety","year":"1985"},{"key":"10.1016\/0304-3975(90)90145-8_BIB33","series-title":"SEKI-Report SR-87-14","article-title":"Order sorted equational computation","author":"Smolka","year":"1987"},{"issue":"9","key":"10.1016\/0304-3975(90)90145-8_BIB34","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1145\/358172.358182","article-title":"A practical tool kit for making portable compilers","volume":"26","author":"Tanenbaum","year":"1983","journal-title":"Comm. ACM"},{"issue":"12","key":"10.1016\/0304-3975(90)90145-8_BIB35","doi-asserted-by":"crossref","DOI":"10.1145\/15042.15054","article-title":"Up-down parsing with prefix grammars","volume":"21","author":"Turner","year":"1986","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0304-3975(90)90145-8_BIB36","unstructured":"B. Weisgerber, Private communication."},{"key":"10.1016\/0304-3975(90)90145-8_BIB37","series-title":"Workshop \u201cCompiler-Compilers and High Speed Compilation\u201d","article-title":"Two tree pattern matchers for code generation","author":"Weisgerber","year":"1988"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590901458?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397590901458?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:21:00Z","timestamp":1555179660000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397590901458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0304397590901458"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90145-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}