{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:46:50Z","timestamp":1767926810482,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"3","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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0304-3975(87)90109-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"205-237","source":"Crossref","is-referenced-by-count":126,"title":["A syntactic theory of sequential control"],"prefix":"10.1016","volume":"52","author":[{"given":"Matthias","family":"Felleisen","sequence":"first","affiliation":[]},{"given":"Daniel P.","family":"Friedman","sequence":"additional","affiliation":[]},{"given":"Eugene","family":"Kohlbecker","sequence":"additional","affiliation":[]},{"given":"Bruce","family":"Duba","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90109-5_BIB1","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1981"},{"key":"10.1016\/0304-3975(87)90109-5_BIB2","series-title":"Formal Description of Programming Concepts III","first-page":"193","article-title":"Control operators, the SECD-machine, and the \u03bb-calculus","author":"Felleisen","year":"1986"},{"key":"10.1016\/0304-3975(87)90109-5_BIB3","first-page":"131","article-title":"Reasoning with continuations","author":"Felleisen","year":"1986","journal-title":"Proc. First Symp. on Logic in Computer Science"},{"issue":"1","key":"10.1016\/0304-3975(87)90109-5_BIB4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/800235.807077","article-title":"Lambda calculus schemata","volume":"7","author":"Fischer","year":"1972","journal-title":"Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices"},{"key":"10.1016\/0304-3975(87)90109-5_BIB5","series-title":"Program Transformations and Programming Environments","first-page":"263","article-title":"Programming with continuations","author":"Friedman","year":"1985"},{"issue":"4","key":"10.1016\/0304-3975(87)90109-5_BIB6","doi-asserted-by":"crossref","DOI":"10.1145\/29873.30392","article-title":"Embedding continuations in procedural objects","volume":"9","author":"Haynes","year":"1987","journal-title":"TOPLAS"},{"issue":"2","key":"10.1016\/0304-3975(87)90109-5_BIB7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0743-1066(87)90016-1","article-title":"Logic continuations","volume":"4","author":"Haynes","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(87)90109-5_BIB8","first-page":"438","article-title":"An abstract machine for designers of computing languages","author":"Landin","year":"1965","journal-title":"Proc. IFIP Congress"},{"issue":"4","key":"10.1016\/0304-3975(87)90109-5_BIB9","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","article-title":"The mechanical evaluation of expressions","volume":"6","author":"Landin","year":"1964","journal-title":"Comput. Journal"},{"key":"10.1016\/0304-3975(87)90109-5_BIB10_1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00995174","article-title":"A network of microprocessors to execute reduction languages","volume":"8","author":"Mag\u00f3","year":"1979","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0304-3975(87)90109-5_BIB10_2","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/BF00995498","article-title":"A network of microprocessors to execute reduction languages","volume":"8","author":"Mag\u00f3","year":"1979","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0304-3975(87)90109-5_BIB11","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0019-9958(71)90355-X","article-title":"Proving algorithms by tail functions","volume":"18","author":"Mazurkiewicz","year":"1971","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(87)90109-5_BIB12","series-title":"Implementations of Prolog","first-page":"147","article-title":"Integrating Prolog in the POPLOG environment","author":"Mellish","year":"1984"},{"key":"10.1016\/0304-3975(87)90109-5_BIB13","series-title":"Ph.D. Thesis","article-title":"Lambda-calculus models of programming languages","author":"Morris","year":"1968"},{"key":"10.1016\/0304-3975(87)90109-5_BIB14","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."},{"issue":"12","key":"10.1016\/0304-3975(87)90109-5_BIB15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/15042.15043","article-title":"The revised3 report on the algorithmic language Scheme","volume":"21","author":"Rees","year":"1986","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0304-3975(87)90109-5_BIB16","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1145\/800194.805852","article-title":"Definitional interpreters for higher-order programming languages","author":"Reynolds","year":"1972","journal-title":"Proc. ACM Annual Conference"},{"issue":"5","key":"10.1016\/0304-3975(87)90109-5_BIB17","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":"Comm. ACM"},{"key":"10.1016\/0304-3975(87)90109-5_BIB18","year":"1966"},{"key":"10.1016\/0304-3975(87)90109-5_BIB19","series-title":"Technical Monograph PRG-11","article-title":"Continuations: A mathematical semantics for handling full jumps","author":"Strachey","year":"1974"},{"key":"10.1016\/0304-3975(87)90109-5_BIB20","series-title":"Memo 349","article-title":"Scheme: An interpreter for extended lambda calculus","author":"Sussman","year":"1975"},{"key":"10.1016\/0304-3975(87)90109-5_BIB21","series-title":"Ph.D. Dissertation","article-title":"The essence of rum\u2014a theory of the intensional and extensional aspects of Lisp-type computation","author":"Talcott","year":"1985"},{"issue":"1","key":"10.1016\/0304-3975(87)90109-5_BIB22","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/322169.322183","article-title":"Continuation-based program transformation strategies","volume":"27","author":"Wand","year":"1980","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587901095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587901095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:35Z","timestamp":1555127555000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587901095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587901095"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90109-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}