{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T23:11:22Z","timestamp":1693869082808},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":[[1994,3]]},"DOI":"10.1016\/0096-0551(94)90014-0","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:04:53Z","timestamp":1060283093000},"page":"53-68","source":"Crossref","is-referenced-by-count":2,"title":["First-class stores and partial continuations in a programming language and environment"],"prefix":"10.1016","volume":"20","author":[{"given":"Gregory F","family":"Johnson","sequence":"first","affiliation":[]},{"given":"Dominic","family":"Duggan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(94)90014-0_BIB1","series-title":"Eighteenth Annual ACM Symposium on Theory of Computing","first-page":"109","article-title":"Making data structures persistent","author":"Driscoll","year":"1986"},{"key":"10.1016\/0096-0551(94)90014-0_BIB2","first-page":"11","article-title":"The revised report on the algorithmic language scheme","volume":"21","author":"Rees","year":"1986","journal-title":"SIG-PLAN Notices"},{"key":"10.1016\/0096-0551(94)90014-0_BIB3","article-title":"Towards a mathematical semantics for computer languages","author":"Scott","year":"1971"},{"key":"10.1016\/0096-0551(94)90014-0_BIB4","article-title":"Continuations: a mathematical semantics for handling full jumps","author":"Strachey","year":"1974"},{"key":"10.1016\/0096-0551(94)90014-0_BIB5","series-title":"Principles of Programming Languages","author":"Tennent","year":"1981"},{"key":"10.1016\/0096-0551(94)90014-0_BIB6","first-page":"496","article-title":"Deriving target code as a representation of continuation semantics","author":"Wand","year":"1982"},{"key":"10.1016\/0096-0551(94)90014-0_BIB7","series-title":"Proc. 12th ACM Symp. Principles of Programming Languages","article-title":"Constraining control","author":"Friedman","year":"1985"},{"key":"10.1016\/0096-0551(94)90014-0_BIB8","article-title":"Scheme: an interpreter for an extended lambda calculus","author":"Sussman","year":"1975","journal-title":"MIT Artificial Intelligence Memo 349"},{"key":"10.1016\/0096-0551(94)90014-0_BIB9","series-title":"Proc. SIGPLAN 91 Conference on Programming Language Design and Implementation","first-page":"293","article-title":"CML: a higher order concurrent language","author":"Reppy","year":"1991"},{"key":"10.1016\/0096-0551(94)90014-0_BIB10","series-title":"Fifteenth ACM Symposium on Principles of Programming Languages","first-page":"180","article-title":"The theory and practice of first-class prompts","author":"Felleisen","year":"1988"},{"key":"10.1016\/0096-0551(94)90014-0_BIB11","series-title":"Proc. Lisp and Functional Programming","article-title":"Debugging standard ML without reverse engineering","author":"Tolmach","year":"1990"},{"key":"10.1016\/0096-0551(94)90014-0_BIB12","series-title":"Proc. SIGPLAN '87 Symposium on Interpreters and Interpretive Techniques","first-page":"241","article-title":"Memory allocation and higher-order functions","author":"Danvy","year":"1987"},{"issue":"7","key":"10.1016\/0096-0551(94)90014-0_BIB13","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1145\/74818.74848","article-title":"Demonic memory for process histories","volume":"24","author":"Wilson","year":"1989","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0096-0551(94)90014-0_BIB14","series-title":"Workshop on State in Programming Languages","article-title":"Refining first-class stores","author":"Morrisett","year":"1993"},{"key":"10.1016\/0096-0551(94)90014-0_BIB15","series-title":"1984 ACM Symposium on Lisp and Functional Programming","article-title":"A proposal for standard ML","author":"Milner","year":"1984"},{"key":"10.1016\/0096-0551(94)90014-0_BIB16","series-title":"CACM 13","first-page":"308","article-title":"GEDANKEN\u2014a simple typeless language based on the principle of completeness and the reference concept","author":"Reynolds","year":"1970"},{"key":"10.1016\/0096-0551(94)90014-0_BIB17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","article-title":"The next 700 programming languages","volume":"3","author":"Landin","year":"1966","journal-title":"Comm. ACM 9"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900140?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055194900140?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:26:35Z","timestamp":1552620395000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055194900140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0096055194900140"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(94)90014-0","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}