{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:23:28Z","timestamp":1648859008612},"reference-count":22,"publisher":"Elsevier BV","issue":"1","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)90027-1","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"11-23","source":"Crossref","is-referenced-by-count":2,"title":["Creating efficient programs by exchanging data for procedures"],"prefix":"10.1016","volume":"14","author":[{"given":"John","family":"Franco","sequence":"first","affiliation":[]},{"given":"Daniel P.","family":"Friedman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(89)90027-1_BIB1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0096-0551(89)90027-1_BIB2","series-title":"The Scheme Programming Language","author":"Dybvig","year":"1987"},{"key":"10.1016\/0096-0551(89)90027-1_BIB3","article-title":"Syntactic extensions in the programming language LISP","author":"Kohlbecker","year":"1986"},{"key":"10.1016\/0096-0551(89)90027-1_BIB4","series-title":"Proc. 1986 ACM Conf. on Lisp and Functional Programming","first-page":"151","article-title":"Hygienic macro extension","author":"Kohlbecker","year":"1986"},{"key":"10.1016\/0096-0551(89)90027-1_BIB5","series-title":"Conf. Rec. 14 ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","first-page":"77","article-title":"Macro-by-example: Deriving syntactic transformations from their specifications","author":"Kohlbecker","year":"1987"},{"key":"10.1016\/0096-0551(89)90027-1_BIB6","series-title":"Formal Description of Programming Concepts","first-page":"391","article-title":"On the essence of compilation","author":"Ershov","year":"1978"},{"key":"10.1016\/0096-0551(89)90027-1_BIB7","series-title":"Proc. RIMS Symposia on Software Science and Engineering","article-title":"Partial computation of programs","author":"Futamura","year":"1982"},{"key":"10.1016\/0096-0551(89)90027-1_BIB8","series-title":"Proc. 1st Int. Conf. on Rewriting Techniques and Applications","first-page":"124","article-title":"An experiment in partial evaluation: The generation of a compiler generator","author":"Jones","year":"1985"},{"key":"10.1016\/0096-0551(89)90027-1_BIB9","first-page":"247","article-title":"Incremental computation","volume":"Vol. 8","author":"Lombardi","year":"1967"},{"key":"10.1016\/0096-0551(89)90027-1_BIB10","series-title":"Proc. Programs as Data Objects","first-page":"257","article-title":"Program transformation by supercompilation","author":"Turchin","year":"1985"},{"key":"10.1016\/0096-0551(89)90027-1_BIB11","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/321992.321996","article-title":"A transformation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0096-0551(89)90027-1_BIB12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00263742","article-title":"A system which automatically improves programs","volume":"6","author":"Darlington","year":"1976","journal-title":"Acta Informatica"},{"key":"10.1016\/0096-0551(89)90027-1_BIB13","series-title":"Functional Programming and its Applications","article-title":"Program transformation","author":"Darlington","year":"1982"},{"key":"10.1016\/0096-0551(89)90027-1_BIB14","series-title":"Proc. 1981 Conference on Functional Programming, Languages, and Computer Architecture","first-page":"11","article-title":"FP with data abstraction and strong typing","author":"Guttag","year":"1981"},{"key":"10.1016\/0096-0551(89)90027-1_BIB15","series-title":"Conf. Rec. 8th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","first-page":"41","article-title":"Program improvement by internal specification","author":"Scherlis","year":"1981"},{"key":"10.1016\/0096-0551(89)90027-1_BIB16","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0096-0551(89)90027-1_BIB17","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/42190.42347","article-title":"ACE: An automatic complexity evaluator","volume":"10","author":"Le Metayer","year":"1988","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/0096-0551(89)90027-1_BIB18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/579.586","article-title":"Translation of attribute grammars into procedures","volume":"6","author":"Katayama","year":"1984","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/0096-0551(89)90027-1_BIB19","first-page":"259","article-title":"Fundamental Algorithms: The Art of Computer Programming","author":"Knuth","year":"1968"},{"key":"10.1016\/0096-0551(89)90027-1_BIB20","series-title":"Proc. 3rd IEEE Symposium on Logic in Computer Science","first-page":"372","article-title":"Notational definition\u2014A formal account","author":"Griffin","year":"1988"},{"key":"10.1016\/0096-0551(89)90027-1_BIB21","series-title":"Proc. 1988 ACM Symposium on LISP and Functional Programming","first-page":"96","article-title":"Syntactic closures","author":"Bawden","year":"1988"},{"key":"10.1016\/0096-0551(89)90027-1_BIB22","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055189900271?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:17Z","timestamp":1552634597000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055189900271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0096055189900271"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(89)90027-1","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}