{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:58:53Z","timestamp":1648987133555},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"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":10821,"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":[[1983,12]]},"DOI":"10.1016\/0022-0000(83)90049-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"389-399","source":"Crossref","is-referenced-by-count":0,"title":["The insensitivity theorem for nonreducing reflexive types"],"prefix":"10.1016","volume":"27","author":[{"given":"Egidio","family":"Astesiano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerardo","family":"Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90049-1_BIB1","series-title":"2me Coll. Les Arbres en Alg\u00e8bre et en Programmation","first-page":"29","article-title":"On algebraic semantics of polyadic recursive schemas","author":"Astesiano","year":"1977"},{"key":"10.1016\/0022-0000(83)90049-1_BIB2","series-title":"Proceedings of ICALP '80","first-page":"38","article-title":"Languages with reducing reflexive types","volume":"Vol. 85","author":"Astesiano","year":"1980"},{"key":"10.1016\/0022-0000(83)90049-1_BIB3","series-title":"Proceedings of the International Colloquium on Formalization of Programming Concepts","first-page":"210","article-title":"Reducing types in applicative languages with structured data","volume":"Vol. 107","author":"Astesiano","year":"1981"},{"key":"10.1016\/0022-0000(83)90049-1_BIB4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90049-1_BIB5","series-title":"5th ICALP, Udine '80","first-page":"72","article-title":"Stable models of typed \u03bb-calculi","volume":"Vol. 62","author":"Berry","year":"1980"},{"key":"10.1016\/0022-0000(83)90049-1_BIB6","article-title":"Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des \u03bb-calculs types","author":"Berry","year":"1979","journal-title":"Th\u00e9se d'Etat Univ. Paris VII"},{"key":"10.1016\/0022-0000(83)90049-1_BIB7","article-title":"Algorithmis d'\u00e9quivalence et de r\u00e9duction a des expressions minimales dans une classe d'\u00e9quations r\u00e9cursives simples","author":"Courcelle","year":"1973","journal-title":"Rapport IRIA No. 37"},{"key":"10.1016\/0022-0000(83)90049-1_BIB8","series-title":"Implementation and Design of Algorithmic Languages","first-page":"111","article-title":"Modes in Algol Y","author":"Lehmann","year":"1977"},{"key":"10.1016\/0022-0000(83)90049-1_BIB9","article-title":"Reductions correctes et optimales dans le \u03bb-calcul","author":"Levy","year":"1978"},{"key":"10.1016\/0022-0000(83)90049-1_BIB10","series-title":"Proving and Improving Programs","article-title":"A logic for computable functions with reflexive and polymorphic types","author":"Milner","year":"1975"},{"key":"10.1016\/0022-0000(83)90049-1_BIB11","first-page":"157","article-title":"Processes, A Mathematical Model for Computing Agents","volume":"Vol. 80","author":"Milner","year":"1975"},{"key":"10.1016\/0022-0000(83)90049-1_BIB12","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\/0022-0000(83)90049-1_BIB13","series-title":"Notes on a Lattice Theoretic Approach to the Theory of Computation","author":"Reynolds","year":"1972"},{"issue":"3","key":"10.1016\/0022-0000(83)90049-1_BIB14","doi-asserted-by":"crossref","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90049-1_BIB15","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties of Scott's D\u221e model of the \u03bb-calculi","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900491?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900491?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:19Z","timestamp":1550307079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0022000083900491"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90049-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}