{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:00:12Z","timestamp":1780725612907,"version":"3.54.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":7168,"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":[[1993,12]]},"DOI":"10.1016\/0304-3975(93)90095-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"411-440","source":"Crossref","is-referenced-by-count":146,"title":["A type-theoretical alternative to ISWIM, CUCH, OWHY"],"prefix":"10.1016","volume":"121","author":[{"given":"Dana S.","family":"Scott","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90095-B_BIB1","article-title":"The Lambda Calculus \u2013 Its Syntax and Semantics","volume":"Vol. 103","author":"Barendregt","year":"1984"},{"key":"10.1016\/0304-3975(93)90095-B_BIB2","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0048939","article-title":"Definable operations in general algebras, and the theory of automata and flowcharts","author":"Beki\u0107","year":"1969"},{"key":"10.1016\/0304-3975(93)90095-B_BIB3","series-title":"Formal Language Description Languages for Computer Programming, IFIP Working Conference on Formal Language Description Languages","first-page":"179","article-title":"The CUCH as a formal and description language","author":"B\u00f6hm","year":"1966"},{"key":"10.1016\/0304-3975(93)90095-B_BIB4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","article-title":"A formulation of the simple theory of types","volume":"5","author":"Church","year":"1940","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(93)90095-B_BIB5","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","year":"1980"},{"key":"10.1016\/0304-3975(93)90095-B_BIB6","series-title":"J.W. de Bakker, 25 Jaar Semantiek: Liber Amicorum","first-page":"1","article-title":"A theory of programs, IBM Seminar, Vienna, August 1969","author":"de Bakker","year":"1989"},{"key":"10.1016\/0304-3975(93)90095-B_BIB7","series-title":"Logic Colloquium 76","first-page":"407","article-title":"Computable and recursively countable functions of higher type","author":"Gandy","year":"1977"},{"key":"10.1016\/0304-3975(93)90095-B_BIB8","article-title":"Edinburgh LCF","volume":"Vol. 78","author":"Gordon","year":"1979"},{"key":"10.1016\/0304-3975(93)90095-B_BIB9","series-title":"Semantics of Programming Languages \u2014 Structures and Techniques","author":"Gunter","year":"1992"},{"key":"10.1016\/0304-3975(93)90095-B_BIB10","series-title":"Handbook of Theoretical Computer Science","first-page":"633","article-title":"Semantic domains","author":"Gunter","year":"1990"},{"key":"10.1016\/0304-3975(93)90095-B_BIB11","series-title":"Ph.D. Thesis","article-title":"Recursion theory on the countable functionals","author":"Hyland","year":"1975"},{"key":"10.1016\/0304-3975(93)90095-B_BIB12","series-title":"Category Theory, Proc. Como 1990","article-title":"First steps in synthetic domain theory","volume":"Vol. 1488","author":"Hyland","year":"1990"},{"key":"10.1016\/0304-3975(93)90095-B_BIB13","series-title":"The University Series in Higher Mathematics","article-title":"Introduction to Metamathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(93)90095-B_BIB14","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"},{"key":"10.1016\/0304-3975(93)90095-B_BIB15","series-title":"Computer Programming and Formal Systems","first-page":"33","article-title":"A basis for a mathematical theory of computation","author":"McCarthy","year":"1963"},{"key":"10.1016\/0304-3975(93)90095-B_BIB16","series-title":"A Theory of Programming Language Semantics","author":"Milne","year":"1976"},{"key":"10.1016\/0304-3975(93)90095-B_BIB17","series-title":"Ph.D. Thesis","article-title":"Lambda calculus models of programming languages","author":"Morris","year":"1968"},{"key":"10.1016\/0304-3975(93)90095-B_BIB18","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(94)90014-0","article-title":"A co-induction principle for recursively defined domains","author":"Pitts","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90095-B_BIB19","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1993.287597","article-title":"Relational properties of recursively defined domains","author":"Pitts","year":"1993","journal-title":"Proc. 8th Ann. IEEE Symp. of Logics in Computer Science"},{"key":"10.1016\/0304-3975(93)90095-B_BIB20","series-title":"Ph.D. Thesis","article-title":"Foundations of recursion theory","author":"Platek","year":"1966"},{"key":"10.1016\/0304-3975(93)90095-B_BIB21","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(93)90095-B_BIB22","series-title":"Theoretical Foundations of Programming Methodology","first-page":"145","article-title":"Lectures on a mathematical theory of computation","author":"Scott","year":"1982"},{"key":"10.1016\/0304-3975(93)90095-B_BIB23","first-page":"641","article-title":"Topology","volume":"Vol. 1","author":"Smyth","year":"1992"},{"key":"10.1016\/0304-3975(93)90095-B_BIB24","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(93)90095-B_BIB25","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1109\/LICS.1991.151640","article-title":"The fixed point property is synthetic domain theory","author":"Taylor","year":"1991","journal-title":"Proc. 6th Ann. IEEE Symp. of Logics in Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390095B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390095B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:18:03Z","timestamp":1580901483000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390095B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["030439759390095B"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90095-b","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}