{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:17Z","timestamp":1761610337681,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80286-5","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"105-120","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Space-Profiling Semantics of the Call-by-Value Lambda Calculus and the CPS Transformation"],"prefix":"10.1016","volume":"26","author":[{"given":"Yasuhiko","family":"Minamide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1992","series-title":"Compiling with Continuation","author":"Appel","key":"10.1016\/S1571-0661(05)80286-5_BIB1"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB2","first-page":"213","article-title":"A provably time and space efficient implementation of NESL","author":"Blelloch","year":"1996","journal-title":"In Proc. of ACM SIGPLAN International Conference on Functional. Programming"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB3","first-page":"1","article-title":"Safety consideration for storage allocation optimization","author":"Chase","year":"1988","journal-title":"In Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation"},{"issue":"4","key":"10.1016\/S1571-0661(05)80286-5_BIB4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S0960129500001535","article-title":"Representing control: a study of the CPS transformation","volume":"2","author":"Danvy","year":"1992","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"10.1016\/S1571-0661(05)80286-5_BIB5","doi-asserted-by":"crossref","DOI":"10.1145\/800235.807077","article-title":"Lambda calculus schemata","volume":"7","author":"Fischer","year":"1972","journal-title":"In Proc. of the ACM Conference on Proving Assertions About Programs, SIGPLAN Notices"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB6","first-page":"237","article-title":"The essence of compiling with continuations","author":"Flanagan","year":"1993","journal-title":"In Proc. of ACM SIGPLAN Conference on Programming Language Design and Implementation"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB7","first-page":"309","article-title":"A provably time-efficient parallel implementation of full speculation","author":"Greiner","year":"1996","journal-title":"In Proc. of ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB8","article-title":"A foundation for space-safe transformations of call-by-need programs","author":"Gustavsson","year":"1999","journal-title":"In Proc. of the Third International Workshop on Higher Order Operational Techniques in Semantics (HOOTS99)"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB9","first-page":"177","article-title":"Unboxed objects and polymorphic typing","author":"Leroy","year":"1992","journal-title":"In Proc. of ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB10","first-page":"1","article-title":"On the runtime complexity of type-directed unboxing","author":"Minamide","year":"1998","journal-title":"In Proc. of ACM SIGPLAN International Conference on Functional Programming"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB11","first-page":"66","article-title":"Abstract models of memory management","author":"Morrisett","year":"1995","journal-title":"In Proc. of ACM Symposium on Functional Programming Languages and Computer Architecture"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB12","article-title":"Semantics of memory management for polymorphic languages","author":"Morrisett","year":"1996","journal-title":"Technical report, School of Computer Science, Carnegie Mellon University, CMU-CS-96-176"},{"issue":"2","key":"10.1016\/S1571-0661(05)80286-5_BIB13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by-name, call-by-value and the \u2137-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB14","first-page":"361","article-title":"Complexity analysis for a lazy higher-order language","author":"Sands","year":"1990","journal-title":"In Proc. of European Symposium on Programming"},{"key":"10.1016\/S1571-0661(05)80286-5_BIB15","first-page":"150","article-title":"Space-efficient closure representations","author":"Shao","year":"1994","journal-title":"In Proc. of ACM Conference on Lisp and Functional Programming"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802865?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802865?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:34Z","timestamp":1761610054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":15,"alternative-id":["S1571066105802865"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80286-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Space-Profiling Semantics of the Call-by-Value Lambda Calculus and the CPS Transformation","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80286-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}