{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:38:07Z","timestamp":1757543887200},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,8,1]],"date-time":"1986-08-01T00:00:00Z","timestamp":523238400000},"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":9847,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1986,8]]},"DOI":"10.1016\/0022-0000(86)90041-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"2-46","source":"Crossref","is-referenced-by-count":5,"title":["Fully abstract submodels of typed lambda calculi"],"prefix":"10.1016","volume":"33","author":[{"given":"Ketan","family":"Mulmuley","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(86)90041-3_BIB1","article-title":"Full Abstraction for Sequential Languages: The State of the Art","author":"Berry","year":"1983","journal-title":"Report INRIA"},{"key":"10.1016\/0022-0000(86)90041-3_BIB2","article-title":"Some Syntactic and Categorical Constructions of Lambda-Calculus Models","author":"Berry","year":"1981","journal-title":"Report No. 80 INRIA"},{"key":"10.1016\/0022-0000(86)90041-3_BIB3","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01744293","article-title":"Infinite trees in normal form and recursive equations having a unique solution","volume":"13","author":"Courcelle","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(86)90041-3_BIB4","article-title":"Computations in Nonambiguous Linear Term Rewriting Systems","author":"Huet","year":"1979","journal-title":"INRIA-LABORIA Report No. 359"},{"key":"10.1016\/0022-0000(86)90041-3_BIB5","series-title":"Formal Language Theory","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/0022-0000(86)90041-3_BIB6","series-title":"A Theory of Programming Language Semantics","author":"Milne","year":"1976"},{"issue":"1","key":"10.1016\/0022-0000(86)90041-3_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed lambda-calculi","volume":"4","author":"Milner","year":"1977","journal-title":"Theoret. Comput. Science"},{"key":"10.1016\/0022-0000(86)90041-3_BIB8","series-title":"Proceedings, Seventh International Conference on Automated Deduction","article-title":"The mechanization of existence proofs of recursive predicates","author":"Mulmuley","year":"1984"},{"key":"10.1016\/0022-0000(86)90041-3_BIB9","unstructured":"K. Mulmuley, A mechanizable theory for the existence proofs of inclusive predicates, submitted for publication."},{"key":"10.1016\/0022-0000(86)90041-3_BIB10","article-title":"The Y-combinator in Scott's Lambda Calculus Models","author":"Park","year":"1976"},{"issue":"1","key":"10.1016\/0022-0000(86)90041-3_BIB11","article-title":"LCF considered as a programming language","volume":"13","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(86)90041-3_BIB12","first-page":"452","article-title":"A power domain construction","volume":"5","author":"Plotkin","year":"1976"},{"key":"10.1016\/0022-0000(86)90041-3_BIB13","series-title":"Proceedings, Second Colloquium 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\/0022-0000(86)90041-3_BIB14","article-title":"Lectures on a Mathematical Theory of Computation","author":"Scott","year":"1981"},{"key":"10.1016\/0022-0000(86)90041-3_BIB15","series-title":"Denotational Semantics","author":"Stoy","year":"1977"},{"key":"10.1016\/0022-0000(86)90041-3_BIB16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(81)90037-2","article-title":"The congruence of two programming language definitions","volume":"13","author":"Stoy","year":"1981","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:52:53Z","timestamp":1550325173000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000086900413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,8]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,8]]}},"alternative-id":["0022000086900413"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(86)90041-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1986,8]]}}}