{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:22:51Z","timestamp":1779315771303,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0304-3975(82)90123-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:07:16Z","timestamp":1027652836000},"page":"297-310","source":"Crossref","is-referenced-by-count":10,"title":["Semantics of interference control"],"prefix":"10.1016","volume":"27","author":[{"given":"R.D.","family":"Tennent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/0304-3975(82)90123-2_BIB1","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1145\/361454.361473","article-title":"Structured multiprogramming","volume":"15","author":"Brinch Hansen","year":"1972","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(82)90123-2_BIB2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF00264468","article-title":"Locations considered unnecessary","volume":"8","author":"Donahue","year":"1977","journal-title":"Acta Inf."},{"key":"10.1016\/0304-3975(82)90123-2_BIB3","series-title":"Third Internat. Coll. on Automata, Languages and Programming","first-page":"257","article-title":"CONS should not evaluate its arguments","author":"Friedman","year":"1976"},{"key":"10.1016\/0304-3975(82)90123-2_BIB4","series-title":"The Denotational Description of Programming Languages","author":"Gordon","year":"1979"},{"key":"10.1016\/0304-3975(82)90123-2_BIB5","article-title":"Edinburgh LCF","volume":"78","author":"Gordon","year":"1979"},{"key":"10.1016\/0304-3975(82)90123-2_BIB6","series-title":"Conf. Record 3rd ACM Symp. on Principles of Programming Languages","first-page":"95","article-title":"A lazy evaluator","author":"Henderson","year":"1978"},{"key":"10.1016\/0304-3975(82)90123-2_BIB7","series-title":"Symposium on Semantics of Algorithmic Languages","article-title":"Procedures and parameters, an axiomatic approach","volume":"188","author":"Hoare","year":"1971"},{"key":"10.1016\/0304-3975(82)90123-2_BIB8","series-title":"Tech. Rept. CS-403","article-title":"Hints on Programming Language Design","author":"Hoare","year":"1973"},{"key":"10.1016\/0304-3975(82)90123-2_BIB9","series-title":"Ph.D. Thesis","article-title":"The formal semantics of computer languages and their implementations","author":"Milne","year":"1974"},{"key":"10.1016\/0304-3975(82)90123-2_BIB10","series-title":"A Theory of Programming Language Semantics","author":"Milne","year":"1976"},{"key":"10.1016\/0304-3975(82)90123-2_BIB11","series-title":"Proc. 2nd Internat. Coll. on Automata, Languages, and Programming","first-page":"141","article-title":"On the relation between direct and continuation semantics","author":"Reynolds","year":"1974"},{"key":"10.1016\/0304-3975(82)90123-2_BIB12","series-title":"Conf. Record 5th ACM Symp. on Principles of Programming Languages","first-page":"39","article-title":"Syntactic control of interference","author":"Reynolds","year":"1978"},{"key":"10.1016\/0304-3975(82)90123-2_BIB13","series-title":"The Craft of Programming","author":"Reynolds","year":"1981"},{"key":"10.1016\/0304-3975(82)90123-2_BIB14","series-title":"Algorithmic Languages","article-title":"The essence of ALGOL","author":"Reynolds","year":"1981"},{"key":"10.1016\/0304-3975(82)90123-2_BIB15","series-title":"Tech. Rept.","article-title":"Idealized ALGOL and its specification logic","author":"Reynolds","year":"1981"},{"key":"10.1016\/0304-3975(82)90123-2_BIB16","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(82)90123-2_BIB17","series-title":"Principles of Programming Languages","author":"Tennent","year":"1981"},{"key":"10.1016\/0304-3975(82)90123-2_BIB18","series-title":"Ph.D. Thesis","article-title":"Semantics and pragmatics of the lambda calculus","author":"Wadsworth","year":"1971"},{"key":"10.1016\/0304-3975(82)90123-2_BIB19","article-title":"On the design of programming language","volume":"74","author":"Wirth","year":"1975"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901232?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582901232?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T22:24:58Z","timestamp":1555194298000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582901232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0304397582901232"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90123-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}