{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T14:30:48Z","timestamp":1693837848277},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":[[1983,1]]},"DOI":"10.1016\/0096-0551(83)90003-6","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:11:16Z","timestamp":1060297876000},"page":"15-25","source":"Crossref","is-referenced-by-count":2,"title":["The contraction of control implementations"],"prefix":"10.1016","volume":"8","author":[{"given":"Lawrence A.","family":"Coon","sequence":"first","affiliation":[]},{"given":"John P.","family":"Kearns","sequence":"additional","affiliation":[]},{"given":"Mary Lou","family":"Soffa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(83)90003-6_BIB1","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/357062.357063","article-title":"Backtracking in a generalized control setting","volume":"1","author":"Lindstrom","year":"1979","journal-title":"ACM Trans. Programm. Lang. Syst."},{"key":"10.1016\/0096-0551(83)90003-6_BIB2","series-title":"Proposed Standard Document","article-title":"Reference manual for Ada","author":"Ichbiah","year":"1980"},{"key":"10.1016\/0096-0551(83)90003-6_BIB3","first-page":"591","article-title":"A model and stack implementation of multiple environments","volume":"16","author":"Bobrow","year":"1973","journal-title":"Commun. Ass. Comput. Mach."},{"key":"10.1016\/0096-0551(83)90003-6_BIB4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF00975882","article-title":"Time required for reference count management in retention block-structured languages","volume":"7","author":"Berry","year":"1978","journal-title":"Int. J. Comp. Inf. Sci."},{"key":"10.1016\/0096-0551(83)90003-6_BIB5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/TSE.1982.234951","article-title":"Performance evaluation of control implementations","volume":"SE-8","author":"Kearns","year":"1982","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0096-0551(83)90003-6_BIB6","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF00991820","article-title":"Time required for garbage collection in retention block-structured languages","volume":"7","author":"Berry","year":"1978","journal-title":"Int. J. Comp. Inf. Sci."},{"key":"10.1016\/0096-0551(83)90003-6_BIB7","article-title":"Module retention in a coroutine environment","author":"Kearns","year":"1981"},{"key":"10.1016\/0096-0551(83)90003-6_BIB8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1109\/TC.1982.1675961","article-title":"A performance analysis of the implementation of addressing methods in block-structured languages","volume":"C-31","author":"DePrycker","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"No. 10","key":"10.1016\/0096-0551(83)90003-6_BIB9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/C-M.1977.217523","article-title":"Measurement and evaluation of alternative computer architectures","volume":"10","author":"Fuller","year":"1977","journal-title":"Computer"},{"issue":"No. 4","key":"10.1016\/0096-0551(83)90003-6_BIB10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.1979.1658691","article-title":"Architectural efficiency measures: an overview of three studies","volume":"10","author":"Dietz","year":"1979","journal-title":"Computer"},{"key":"10.1016\/0096-0551(83)90003-6_BIB11","article-title":"Coroutine Pascal: a case study in separable control","author":"Lemon","year":"1976"},{"key":"10.1016\/0096-0551(83)90003-6_BIB12","first-page":"282","article-title":"Dynamic space sharing in computer systems","volume":"12","author":"Belady","year":"1969","journal-title":"Commun. Ass. Comput. Mach."},{"key":"10.1016\/0096-0551(83)90003-6_BIB13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00265769","article-title":"Fundamental operational laws of computer system performance","volume":"7","author":"Buzen","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/0096-0551(83)90003-6_BIB14","first-page":"36","article-title":"Segment sizes and lifetimes in Algol 60 programs","volume":"20","author":"Batson","year":"1977","journal-title":"Commun. Ass. Comput. Mach."},{"key":"10.1016\/0096-0551(83)90003-6_BIB15","series-title":"Proceedings of the 3rd Annual Symposium on Computer Architecture","first-page":"151","article-title":"Design data for Algol-60 machines","author":"Batson","year":"1977"},{"key":"10.1016\/0096-0551(83)90003-6_BIB16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/spe.4380100305","article-title":"Coroutine behavior and implementation","volume":"10","author":"Pauli","year":"1980","journal-title":"Software-Pract. Expr."},{"key":"10.1016\/0096-0551(83)90003-6_BIB17","series-title":"Proc. 5th IEEE COMPSAC","first-page":"213","article-title":"Performance comparison of copy-less coroutine implementations","author":"Kearns","year":"1981"},{"key":"10.1016\/0096-0551(83)90003-6_BIB18","article-title":"The contraction of control implementations","author":"Coon","year":"1982"},{"key":"10.1016\/0096-0551(83)90003-6_BIB19","article-title":"An optimistic implementation of the stack-heap","author":"Stephenson","year":"1983"},{"key":"10.1016\/0096-0551(83)90003-6_BIB20","article-title":"Performance evaluation of the stack-berry-heap","author":"Borger","year":"1983"},{"key":"10.1016\/0096-0551(83)90003-6_BIB21","article-title":"Stack-heap storage management for backtracking","author":"Consiglio","year":"1983"},{"key":"10.1016\/0096-0551(83)90003-6_BIB22","article-title":"The impact of a register set upon storage management for retentive control","author":"Reichard","year":"1983"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055183900036?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055183900036?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T09:24:49Z","timestamp":1552641889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055183900036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["0096055183900036"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(83)90003-6","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}