乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T11:22:58Z","timestamp":1720437778250},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0167-6423(86)90012-2","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T11:44:35Z","timestamp":1048592675000},"page":"297-312","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["Compiling and optimizing methods for the functional language ASL\/F"],"prefix":"10.1016","volume":"7","author":[{"given":"Katsuro","family":"Inoue","sequence":"first","affiliation":[]},{"given":"Hiroyuki","family":"Seki","sequence":"additional","affiliation":[]},{"given":"Kenichi","family":"Taniguchi","sequence":"additional","affiliation":[]},{"given":"Tadao","family":"Kasami","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(86)90012-2_BIB1","series-title":"Principles of Compiler Design","author":"Aho","year":"1977"},{"key":"10.1016\/0167-6423(86)90012-2_BIB2_1","first-page":"66","article-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0167-6423(86)90012-2_BIB2_2","first-page":"78","article-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"issue":"1","key":"10.1016\/0167-6423(86)90012-2_BIB3","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/322108.322122","article-title":"Minimal and optimal computation of recursive programs","volume":"26","author":"Berry","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(86)90012-2_BIB4","series-title":"Proc. ACM Conference on Functional Programming Languages and Computer Architecture","article-title":"Programming with concrete data structures and sequential algorithms","author":"Berry","year":"1981"},{"issue":"1","key":"10.1016\/0167-6423(86)90012-2_BIB5","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321992.321996","article-title":"A translation system for developing recursive programs","volume":"24","author":"Burstall","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(86)90012-2_BIB6","series-title":"Proc. International Symposium on Functional Programming Languages and Computer Architecture","first-page":"50","article-title":"The categorical abstract machine","volume":"201","author":"Cousineau","year":"1985"},{"key":"10.1016\/0167-6423(86)90012-2_BIB7","series-title":"Proc. 3rd ICALP","first-page":"257","article-title":"CONS should not evaluate its arguments","author":"Friedman","year":"1976"},{"key":"10.1016\/0167-6423(86)90012-2_BIB8","first-page":"218","article-title":"Functional Programming, Application and Implementation","author":"Henderson","year":"1980"},{"key":"10.1016\/0167-6423(86)90012-2_BIB9","series-title":"Proc. 3rd POPL","first-page":"95","article-title":"A lazy evaluator","author":"Henderson","year":"1976"},{"key":"10.1016\/0167-6423(86)90012-2_BIB10","series-title":"Formal Languages: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: A survey","author":"Huet","year":"1980"},{"issue":"6","key":"10.1016\/0167-6423(86)90012-2_BIB11","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1109\/TSE.1984.5010311","article-title":"An algebraic specification of HDLC procedures and its verification","volume":"10","author":"Higashino","year":"1984","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0167-6423(86)90012-2_BIB12","series-title":"Papers of Technical Group on Electronic Computers","first-page":"61","article-title":"Code optimization at compilation of functional programming language ASL-F programs","author":"Inoue","year":"1982"},{"issue":"4","key":"10.1016\/0167-6423(86)90012-2_BIB13","first-page":"458","article-title":"Functional programming language ASL\/F and its optimizing compiler","volume":"67-D","author":"Inoue","year":"1984","journal-title":"Trans. IECE Japan"},{"key":"10.1016\/0167-6423(86)90012-2_BIB14","series-title":"Proc. 8th ICALP","first-page":"129","article-title":"Algorithmic specifications of abstract data types","volume":"115","author":"Loecks","year":"1981"},{"key":"10.1016\/0167-6423(86)90012-2_BIB15","series-title":"International Symposium on Programming","first-page":"269","article-title":"The theory and practice of transforming call-by-name into call-by-value","volume":"83","author":"Mycroft","year":"1980"},{"key":"10.1016\/0167-6423(86)90012-2_BIB16","series-title":"1979 National Convention Record on Information and System Section","first-page":"402","article-title":"A system supporting program design\u2014program derivation from an algebraic specification","author":"Nakanishi","year":"1979"},{"key":"10.1016\/0167-6423(86)90012-2_BIB17_1","first-page":"98","article-title":"ALGOL 60 Implementation","author":"Randell","year":"1964"},{"key":"10.1016\/0167-6423(86)90012-2_BIB17_2","first-page":"214","article-title":"ALGOL 60 Implementation","author":"Randell","year":"1964"},{"issue":"1","key":"10.1016\/0167-6423(86)90012-2_BIB18","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree manipulating systems and Church-Rosser theorems","volume":"20","author":"Rosen","year":"1973","journal-title":"J. ACM"},{"issue":"10","key":"10.1016\/0167-6423(86)90012-2_BIB19","first-page":"1115","article-title":"Optimization of functional language programs\u2014optimizing compiler for ASL\/F","volume":"67-D","author":"Seki","year":"1984","journal-title":"Trans. IECE Japan"},{"key":"10.1016\/0167-6423(86)90012-2_BIB20","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(82)90015-9","article-title":"Pebble game for studying storage sharing","volume":"19","author":"Sethi","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(86)90012-2_BIB21","series-title":"Proc. 7th International Conference on Software Engineering","first-page":"463","article-title":"Functional programming and logical programming for the telegram analysis problem","author":"Torii","year":"1984"},{"key":"10.1016\/0167-6423(86)90012-2_BIB22","first-page":"76","article-title":"Algorithms + Data Structures = Programs","author":"Wirth","year":"1976"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900122?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900122?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T11:50:22Z","timestamp":1553428222000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642386900122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":24,"alternative-id":["0167642386900122"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90012-2","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}