{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T10:34:10Z","timestamp":1779878050187,"version":"3.53.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"3-4","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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/0096-0551(86)90007-x","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"143-153","source":"Crossref","is-referenced-by-count":56,"title":["Obtaining coroutines with continuations"],"prefix":"10.1016","volume":"11","author":[{"given":"Christopher T.","family":"Haynes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel P.","family":"Friedman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mitchell","family":"Wand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(86)90007-X_BIB1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10256-6","article-title":"Coroutines: A Programming Methodology, a Language Design and an Implementation","author":"Marlin","year":"1980"},{"key":"10.1016\/0096-0551(86)90007-X_BIB2","article-title":"The Scheme 84 Interim Reference Manual","author":"Friedman","year":"1985","journal-title":"Indiana University Computer Science Department Technical Report No. 153"},{"key":"10.1016\/0096-0551(86)90007-X_BIB3","series-title":"Conf. Record of the 1980 Lisp Conference","first-page":"19","article-title":"Continuation-based multiprocessing","author":"Wand","year":"1980"},{"key":"10.1016\/0096-0551(86)90007-X_BIB4","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1145\/362349.362364","article-title":"GEDANKEN\u2014A simple typeless language based on the principle of completeness and the reference concept","volume":"13","author":"Reynolds","year":"1970","journal-title":"CACM"},{"key":"10.1016\/0096-0551(86)90007-X_BIB5","article-title":"The revised report on Scheme: a dialect of Lisp","author":"Steele","year":"1978","journal-title":"MIT Artificial Intelligence Memo 452"},{"key":"10.1016\/0096-0551(86)90007-X_BIB6","article-title":"Scheme: an interpreter for extended lambda calculus","author":"Sussman","year":"1975","journal-title":"MIT Artificial Intelligence Memo 349"},{"key":"10.1016\/0096-0551(86)90007-X_BIB7_1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0004-3702(77)90033-9","article-title":"Viewing control structures as patterns of passing messages","volume":"8","author":"Hewitt","year":"1977","journal-title":"Artif. Intell."},{"key":"10.1016\/0096-0551(86)90007-X_BIB7_2","series-title":"Artificial Intelligence: an MIT Perspective","article-title":"Viewing control structures as patterns of passing messages","author":"Hewitt","year":"1979"},{"key":"10.1016\/0096-0551(86)90007-X_BIB8","series-title":"The Revised Report on Scheme","year":"1985"},{"key":"10.1016\/0096-0551(86)90007-X_BIB9_1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/363744.363749","article-title":"A correspondence between ALGOL 60 and Church's lambda notation","volume":"8","author":"Landin","year":"1965","journal-title":"CACM"},{"key":"10.1016\/0096-0551(86)90007-X_BIB9_2","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/363791.363804","article-title":"A correspondence between ALGOL 60 and Church's lambda notation","volume":"8","author":"Landin","year":"1965","journal-title":"CACM"},{"key":"10.1016\/0096-0551(86)90007-X_BIB10","series-title":"ACM Conference Proceedings 1972","first-page":"717","article-title":"Definitional interpreters for higher order programming languages","author":"Reynolds","year":"1972"},{"key":"10.1016\/0096-0551(86)90007-X_BIB11","series-title":"Structured Programming","first-page":"157","article-title":"Hierarchical program structures","author":"Dahl","year":"1972"},{"key":"10.1016\/0096-0551(86)90007-X_BIB12","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/366663.366704","article-title":"Design of a separable transition-diagram compiler","volume":"6","author":"Conway","year":"1963","journal-title":"CACM"},{"key":"10.1016\/0096-0551(86)90007-X_BIB13","series-title":"Program Transformation and Programming Environments","first-page":"263","article-title":"Programming with continuations","author":"Friedman","year":"1984"},{"key":"10.1016\/0096-0551(86)90007-X_BIB14","series-title":"Conf. Rec. of the 1984 ACM Symposium on Lisp and Functional Programming","first-page":"18","article-title":"Engines build process abstractions","author":"Haynes","year":"1984"},{"key":"10.1016\/0096-0551(86)90007-X_BIB15","series-title":"UNIX Programmer's Manual","year":"1984"},{"key":"10.1016\/0096-0551(86)90007-X_BIB16","series-title":"Conf. Rec. of the 1984 ACM Symposium on Lisp and Functional Programming","first-page":"18","article-title":"A proposal for Standard ML","author":"Milner","year":"1984"},{"key":"10.1016\/0096-0551(86)90007-X_BIB17","series-title":"The Scheme Programming Language","author":"Dybvig","year":"1986"},{"key":"10.1016\/0096-0551(86)90007-X_BIB18","series-title":"Conf. Rec. of the IEEE Symposium on Logic in Computer Science","article-title":"Reasoning with continuations","author":"Felleisen","year":"1986"},{"key":"10.1016\/0096-0551(86)90007-X_BIB19","series-title":"Conf. Rec. of the Twelfth Annual ACM Symposium on Principles of Programming Languages","first-page":"245","article-title":"Constraining control","author":"Friedman","year":"1985"},{"key":"10.1016\/0096-0551(86)90007-X_BIB20","series-title":"Proc. of the Third International Conference on Logic Programming","first-page":"671","article-title":"Logic continuations","volume":"Vol. 225","author":"Haynes","year":"1986"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605518690007X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605518690007X?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:22:07Z","timestamp":1552634527000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009605518690007X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":22,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["009605518690007X"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(86)90007-x","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}