{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:26:49Z","timestamp":1649017609294},"reference-count":36,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0096-0551(89)90005-2","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"193-204","source":"Crossref","is-referenced-by-count":2,"title":["Prolog based retargetable code generation"],"prefix":"10.1016","volume":"14","author":[{"given":"Mahadevan","family":"Ganapathi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/0096-0551(89)90005-2_BIB1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/MC.1980.1653739","article-title":"Translator writing systems: Where do they now stand?","volume":"13","author":"Aho","year":"1980","journal-title":"IEEE Comput."},{"key":"10.1016\/0096-0551(89)90005-2_BIB2","series-title":"Proc. 12th POPL Conf.","first-page":"334","article-title":"Efficient tree pattern matching: an aid to code generation","author":"Aho","year":"1985"},{"issue":"3","key":"10.1016\/0096-0551(89)90005-2_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\/0096-0551(89)90005-2_BIB4","series-title":"AT&T Bell Laboratories","article-title":"Code generation using tree matching and dynamic programming","author":"Aho","year":"1986"},{"key":"10.1016\/0096-0551(89)90005-2_BIB5","series-title":"Compilers, Principles, Techniques and Tools","author":"Aho","year":"1986"},{"issue":"2","key":"10.1016\/0096-0551(89)90005-2_BIB6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/357094.357097","article-title":"Automatic derivation of code generators from machine descriptions","volume":"2","author":"Cattell","year":"1980","journal-title":"TOPLAS"},{"key":"10.1016\/0096-0551(89)90005-2_BIB7","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"issue":"4","key":"10.1016\/0096-0551(89)90005-2_BIB8","doi-asserted-by":"crossref","DOI":"10.1145\/1780.1783","article-title":"Code selection through object code optimization","volume":"6","author":"Davidson","year":"1984","journal-title":"TOPLAS"},{"key":"10.1016\/0096-0551(89)90005-2_BIB9","article-title":"Automatic generation of code generators","author":"Fraser","year":"1977"},{"key":"10.1016\/0096-0551(89)90005-2_BIB10","series-title":"Proc. 6th POPL Conf.","first-page":"1","article-title":"A compact machine-independent peephole optimizer","author":"Fraser","year":"1979"},{"key":"10.1016\/0096-0551(89)90005-2_BIB11","series-title":"Proc. '86 Symp. on Compiler Construction","article-title":"Integrating code generation and optimization","author":"Fraser","year":"1986"},{"issue":"4","key":"10.1016\/0096-0551(89)90005-2_BIB12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/spe.4380140406","article-title":"Attributed linear intermediate representations for retargetable code generators","volume":"14","author":"Ganapathi","year":"1984","journal-title":"Software\u2014Pract. Exper."},{"issue":"4","key":"10.1016\/0096-0551(89)90005-2_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/4472.4486","article-title":"Affix grammar driven code generation","volume":"7","author":"Ganapathi","year":"1985","journal-title":"TOPLAS"},{"key":"10.1016\/0096-0551(89)90005-2_BIB14","series-title":"Proc. 20th Hawaii International Conf. on System Sciences","first-page":"307","article-title":"Semantic attributes integrate code generation and optimization","author":"Ganapathi","year":"1987"},{"issue":"1","key":"10.1016\/0096-0551(89)90005-2_BIB15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF00268846","article-title":"Integrating code generation and peephole optimization","volume":"25","author":"Ganapathi","year":"1988","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/0096-0551(89)90005-2_BIB16","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1145\/356893.356897","article-title":"Retargetable compiler code generation","volume":"14","author":"Ganapathi","year":"1982","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/0096-0551(89)90005-2_BIB17","series-title":"Proc. '86 Symp. on Compiler Construction","article-title":"Efficient instruction scheduling for a pipelined architecture","author":"Gibbons","year":"1986"},{"issue":"3","key":"10.1016\/0096-0551(89)90005-2_BIB18","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1145\/2166.357219","article-title":"A formal framework for the derivation of machine specific optimizers","volume":"5","author":"Giegerich","year":"1983","journal-title":"TOPLAS"},{"key":"10.1016\/0096-0551(89)90005-2_BIB19","series-title":"Proc. 5th POPL Conf.","first-page":"231","article-title":"A new method for compiler code generation","author":"Glanville","year":"1978"},{"issue":"8","key":"10.1016\/0096-0551(89)90005-2_BIB20","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/MC.1980.1653744","article-title":"Table-driven code generation","volume":"13","author":"Graham","year":"1980","journal-title":"IEEE Comput."},{"issue":"12","key":"10.1016\/0096-0551(89)90005-2_BIB21","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1109\/TC.1984.1676395","article-title":"VLSI processor architecture","volume":"C-33","author":"Hennessy","year":"1984","journal-title":"IEEE Trans. on Comput."},{"issue":"3","key":"10.1016\/0096-0551(89)90005-2_BIB22","doi-asserted-by":"crossref","DOI":"10.1145\/2166.357217","article-title":"Postpass code optimization of pipeline constraints","volume":"5","author":"Hennessy","year":"1983","journal-title":"ACM Trans. Prog. Lang. Systems"},{"key":"10.1016\/0096-0551(89)90005-2_BIB23","article-title":"Graham-Glanville code generators","author":"Henry","year":"1984"},{"key":"10.1016\/0096-0551(89)90005-2_BIB24","article-title":"Register allocation for VLSI processors","author":"Hsu","year":"1985"},{"key":"10.1016\/0096-0551(89)90005-2_BIB25","series-title":"Proc. 5th POPL Conf.","first-page":"97","article-title":"A portable compiler: Theory and practice","author":"Johnson","year":"1978"},{"key":"10.1016\/0096-0551(89)90005-2_BIB26","series-title":"Proc. '84 Symp. on Compiler Construction","first-page":"106","article-title":"Peep\u2014An architectural-description-driven peephole optimizer","author":"Kessler","year":"1984"},{"key":"10.1016\/0096-0551(89)90005-2_BIB27","series-title":"Proc. '86 Symp. on Compiler Construction","article-title":"Discovering machine-specific code improvements","author":"Kessler","year":"1986"},{"key":"10.1016\/0096-0551(89)90005-2_BIB28","article-title":"Topics in code generation and register allocation","author":"Leverett","year":"1982","journal-title":"Carnegie-Mellon University, Computer Science Department; Technical Report CMU-CS-82-130"},{"issue":"8","key":"10.1016\/0096-0551(89)90005-2_BIB29","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/363534.363549","article-title":"On compiling algorithms for arithmetic expressions","volume":"10","author":"Nakata","year":"1967","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/0096-0551(89)90005-2_BIB30","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/2465.214917","article-title":"Reduced instruction set computers","volume":"28","author":"Patterson","year":"1985","journal-title":"Commun. ACM"},{"key":"10.1016\/0096-0551(89)90005-2_BIB31","series-title":"Proc. SIGARCH\/SIGPLAN Symp. on Architectural Support for Programming Languages and Operating Systems","first-page":"39","article-title":"The 801 Minicomputer","author":"Radin","year":"1982"},{"issue":"2","key":"10.1016\/0096-0551(89)90005-2_BIB32","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/2.19831","article-title":"Code optimization across procedures","volume":"22","author":"Richardson","year":"1989","journal-title":"IEEE Comput."},{"issue":"4","key":"10.1016\/0096-0551(89)90005-2_BIB33","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/321607.321620","article-title":"The generation of optimal code for arithmetic expressions","volume":"17","author":"Sethi","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/0096-0551(89)90005-2_BIB34","series-title":"Computer Science Department, Carnegie-Mellon University: Technical Report","article-title":"Delayed Binding in PQCC","author":"Wulf","year":"1982"},{"key":"10.1016\/0096-0551(89)90005-2_BIB35","series-title":"The Design of an Optimizing Compiler","author":"Wulf","year":"1975"},{"issue":"8","key":"10.1016\/0096-0551(89)90005-2_BIB36","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MC.1980.1653748","article-title":"An overview of the production quality compiler-compiler project","volume":"13","author":"Wulf","year":"1980","journal-title":"IEEE Comput."}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900052?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900052?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T07:23:24Z","timestamp":1552634604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055189900052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0096055189900052"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(89)90005-2","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}