{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:35:08Z","timestamp":1693866908537},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":[[1987,1]]},"DOI":"10.1016\/0096-0551(87)90003-8","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:04:53Z","timestamp":1060297493000},"page":"109-121","source":"Crossref","is-referenced-by-count":26,"title":["Abstracting timed preemption with engines"],"prefix":"10.1016","volume":"12","author":[{"given":"Christopher T.","family":"Haynes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel P.","family":"Friedman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0096-0551(87)90003-8_BIB1","series-title":"Conference Record 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(87)90003-8_BIB2","series-title":"The Scheme Programming Language","author":"Dybvig","year":"1987"},{"key":"10.1016\/0096-0551(87)90003-8_BIB3","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(87)90003-8_BIB4","series-title":"TI Scheme Language Reference Manual","year":"1986"},{"key":"10.1016\/0096-0551(87)90003-8_BIB5","article-title":"Scheme: an interpreter for the extended lambda calculus","author":"Sussman","year":"1975","journal-title":"MIT Artificial Intelligence Memo 349"},{"key":"10.1016\/0096-0551(87)90003-8_BIB6","series-title":"The revised3 report on the algorithmic language scheme","first-page":"37","volume":"21","year":"1986"},{"issue":"2\u20133","key":"10.1016\/0096-0551(87)90003-8_BIB7_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":"Commun. ACM"},{"issue":"2\u20133","key":"10.1016\/0096-0551(87)90003-8_BIB7_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":"Commun. ACM"},{"key":"10.1016\/0096-0551(87)90003-8_BIB8","series-title":"Proceedings of the 25th ACM National Conference","first-page":"717","article-title":"Definitional interpreters for higher-order programming languages","author":"Reynolds","year":"1972"},{"key":"10.1016\/0096-0551(87)90003-8_BIB9","doi-asserted-by":"crossref","unstructured":"Felleisen M., Reflections on Landin's J-operator: a partly historical note. Comput. Lang. In press.","DOI":"10.1016\/0096-0551(87)90022-1"},{"key":"10.1016\/0096-0551(87)90003-8_BIB10","series-title":"Program Transformation and Programming Environments","first-page":"263","article-title":"Programming with continuations","author":"Friedman","year":"1984"},{"key":"10.1016\/0096-0551(87)90003-8_BIB11","doi-asserted-by":"crossref","unstructured":"Haynes C. T. and Friedman D. P., Embedding continuations in procedural objects. ACM Trans. Progr. Lang. Sys. In press.","DOI":"10.1145\/29873.30392"},{"key":"10.1016\/0096-0551(87)90003-8_BIB12","series-title":"The Hacker's Dictionary","author":"Steele","year":"1983"},{"key":"10.1016\/0096-0551(87)90003-8_BIB13","series-title":"Conference on New Directions in Algorithmic Languages","article-title":"User-defined types and procedural data structures as complementary approaches to data abstraction","author":"Reynolds","year":"1975"},{"key":"10.1016\/0096-0551(87)90003-8_BIB14","series-title":"Conference Record of the 1980 Lisp Conference","first-page":"19","article-title":"Continuation-based multiprocessing","author":"Wand","year":"1980"},{"key":"10.1016\/0096-0551(87)90003-8_BIB15","series-title":"Lucid, The Dataflow Programming Language","author":"Wadge","year":"1985"},{"key":"10.1016\/0096-0551(87)90003-8_BIB16","series-title":"Computer Programing and Formal Systems","first-page":"33","article-title":"A basis for a mathematical theory of computation","author":"McCarthy","year":"1963"},{"key":"10.1016\/0096-0551(87)90003-8_BIB17","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 \u03bb-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0096-0551(87)90003-8_BIB18","series-title":"Proceedings of the Conference on Formal Description of Programming Concepts","article-title":"Control operators, the SECD-machine, and the \u03bb-calculus","author":"Felleisen","year":"1986"},{"key":"10.1016\/0096-0551(87)90003-8_BIB19","doi-asserted-by":"crossref","unstructured":"Felleisen M., Friedman D. P., Kohlbecker E. and Duba B., A syntactic theory of sequential control. Theoret. Comput. Sci. In press.","DOI":"10.1016\/0304-3975(87)90109-5"},{"key":"10.1016\/0096-0551(87)90003-8_BIB20","series-title":"Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages","first-page":"314","article-title":"A calculus for assignment in higher-order languages","author":"Felleisen","year":"1987"},{"key":"10.1016\/0096-0551(87)90003-8_BIB21","article-title":"An abstraction of timed preemption","author":"Haynes","year":"1985"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055187900038?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0096055187900038?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:34Z","timestamp":1552634554000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0096055187900038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0096055187900038"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(87)90003-8","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}