{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:31Z","timestamp":1761611071959},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,7,1]],"date-time":"1980-07-01T00:00:00Z","timestamp":331257600000},"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":12069,"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":[[1980,7]]},"DOI":"10.1016\/0304-3975(80)90015-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"227-245","source":"Crossref","is-referenced-by-count":27,"title":["A mathematical semantics for a nondeterministic typed \u03bb-calculus"],"prefix":"10.1016","volume":"11","author":[{"given":"M.C.B.","family":"Hennessy","sequence":"first","affiliation":[]},{"given":"E.A.","family":"Ashcroft","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90015-8_BIB1","author":"Egli","year":"1975","journal-title":"A mathematical model for nondeterministic computations"},{"key":"10.1016\/0304-3975(80)90015-8_BIB2","series-title":"IO and OI, DAIMIPB-47","author":"Engelfnet","year":"1975"},{"key":"10.1016\/0304-3975(80)90015-8_BIB3","article-title":"Parameter passing mechanisms and nondeterminism","author":"Hennessy","year":"1977","journal-title":"Proc. 9th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(80)90015-8_BIB4","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1145\/361454.361460","article-title":"Fixpoint approach to the theory of computation","volume":"15","author":"Manna","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(80)90015-8_BIB5","article-title":"Models of LCF","volume":"AIM-186","author":"Milner","year":"1973","journal-title":"Stanford Artificial Intelligence Laboratory Memo"},{"key":"10.1016\/0304-3975(80)90015-8_BIB6","first-page":"157","article-title":"Processes: a mathematical model for computing agents","volume":"80","author":"Milner","year":"1975"},{"key":"10.1016\/0304-3975(80)90015-8_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed \u03bb-calculi","volume":"4","author":"Milner","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90015-8_BIB8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90015-8_BIB9","series-title":"Memo SAI-RM-4","article-title":"Lambda definability and local relations","author":"Plotkin","year":"1973"},{"key":"10.1016\/0304-3975(80)90015-8_BIB10","doi-asserted-by":"crossref","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","author":"Plotkin","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(80)90015-8_BIB11","article-title":"Outline of a mathematical theory of computation","author":"Scott","year":"1970","journal-title":"Proc. 4th Annual Princeton Conference on Information Sciences and Systems"},{"key":"10.1016\/0304-3975(80)90015-8_BIB12","first-page":"579","article-title":"Data types as lattices","volume":"499","author":"Scott","year":"1975"},{"key":"10.1016\/0304-3975(80)90015-8_BIB13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","article-title":"Powerdomains","volume":"16","author":"Smyth","year":"1978","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(80)90015-8_BIB14","doi-asserted-by":"crossref","first-page":"198","DOI":"10.2307\/2271658","article-title":"Intentional interpretations of functionals of finite type","volume":"I","author":"Tait","year":"1967","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(80)90015-8_BIB15","article-title":"Semantics and axiomatics of a simple programming language","author":"Vuillemin","year":"1974","journal-title":"Rapport de Recherche no. 60"},{"key":"10.1016\/0304-3975(80)90015-8_BIB16","article-title":"The relationship between \u03bb-expressions and their denotations in Scott's model of the \u03bb-calculus","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900158?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:24:52Z","timestamp":1555125892000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,7]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,7]]}},"alternative-id":["0304397580900158"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90015-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,7]]}}}