{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T03:50:28Z","timestamp":1777175428320,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":7624,"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":[[1992,9]]},"DOI":"10.1016\/0304-3975(92)90014-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"235-271","source":"Crossref","is-referenced-by-count":288,"title":["The revised report on the syntactic theories of sequential control and state"],"prefix":"10.1016","volume":"103","author":[{"given":"Matthias","family":"Felleisen","sequence":"first","affiliation":[]},{"given":"Robert","family":"Hieb","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90014-7_BIB1","series-title":"Proc. 17th ACM Symposium on Principles of Programming Languages","first-page":"31","article-title":"Explicit substitution","author":"Abadi","year":"1990"},{"key":"10.1016\/0304-3975(92)90014-7_BIB2","article-title":"The Lambda Calculus: Its Syntax and Semantics","volume":"Vol. 103","author":"Barendregt","year":"1984"},{"key":"10.1016\/0304-3975(92)90014-7_BIB3","series-title":"Introduction to Mathematical Logic","author":"Church","year":"1956"},{"key":"10.1016\/0304-3975(92)90014-7_BIB4","series-title":"Proc. 10th ACM Symp. Principles of Programming Languages","first-page":"59","article-title":"Making variables abstract: an equational theory for Russell","author":"Demers","year":"1983"},{"key":"10.1016\/0304-3975(92)90014-7_BIB5","series-title":"Ph.D. Dissertation","article-title":"The calculi of lambda-\u03c5-CS-conversion: a syntactic theory of control and state in imperative higher-order programming languages","author":"Felleisen","year":"1987"},{"key":"10.1016\/0304-3975(92)90014-7_BIB6","series-title":"Proc. 15th ACM Symp. Principles of Programming Languages","first-page":"180","article-title":"The theory and practice of first-class prompts","author":"Felleisen","year":"1988"},{"key":"10.1016\/0304-3975(92)90014-7_BIB7","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(92)90014-7_BIB8_1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(89)90069-8","article-title":"A syntactic theory of sequential state","volume":"69","author":"Felleisen","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90014-7_BIB8_2","series-title":"Proc. 14th ACM Symp. Principles of Programming Languages","first-page":"314","article-title":"A syntactic theory of sequential state","author":"Felleisen","year":"1987"},{"key":"10.1016\/0304-3975(92)90014-7_BIB9_1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","article-title":"A syntactic theory of sequential control","volume":"52","author":"Felleisen","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90014-7_BIB9_2","series-title":"Proc. Symp. Logic in Computer Science","first-page":"131","article-title":"A syntactic theory of sequential control","author":"Felleisen","year":"1986"},{"key":"10.1016\/0304-3975(92)90014-7_BIB10","first-page":"47","article-title":"A formulae-as-types notion of control","author":"Griffin","year":"1990"},{"issue":"3","key":"10.1016\/0304-3975(92)90014-7_BIB11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","article-title":"The next 700 programming languages","volume":"9","author":"Landin","year":"1966","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/0304-3975(92)90014-7_BIB12","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. J."},{"key":"10.1016\/0304-3975(92)90014-7_BIB13","first-page":"105","article-title":"Equivalences of first-order Lisp programs","author":"Mason","year":"1986","journal-title":"Proc. Symp. Logic in Computer Science"},{"key":"10.1016\/0304-3975(92)90014-7_BIB14","first-page":"574","article-title":"Programming, transforming, and proving with function abstractions and memories","volume":"Vol. 372","author":"Mason","year":"1989"},{"key":"10.1016\/0304-3975(92)90014-7_BIB15","series-title":"Proc. Symp. Logic in Computer Science","first-page":"284","article-title":"A sound and complete axiomatization of operational equivalence between programs with memory","author":"Mason","year":"1989"},{"key":"10.1016\/0304-3975(92)90014-7_BIB16","series-title":"The Definition of Standard ML","author":"Milner","year":"1990"},{"key":"10.1016\/0304-3975(92)90014-7_BIB17","series-title":"Proc. Symp. Logic in Computer Science","first-page":"14","article-title":"Computational lambda-calculus and monads","author":"Moggi","year":"1989"},{"key":"10.1016\/0304-3975(92)90014-7_BIB18","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(92)90014-7_BIB19","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/15042.15043","volume":"21","year":"1986","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0304-3975(92)90014-7_BIB20","series-title":"Common Lisp\u2014The Language","author":"Steele","year":"1984"},{"key":"10.1016\/0304-3975(92)90014-7_BIB21","series-title":"Memo 349","article-title":"Scheme: An interpreter for extended lambda calculus, Memo","author":"Sussman","year":"1975"},{"key":"10.1016\/0304-3975(92)90014-7_BIB22","first-page":"3","article-title":"Rum: An intensional theory with function and control abstractions","volume":"Vol. 306","author":"Talcott","year":"1988"},{"key":"10.1016\/0304-3975(92)90014-7_BIB23","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592900147?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592900147?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:20:17Z","timestamp":1555129217000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592900147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["0304397592900147"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90014-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}