{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:19Z","timestamp":1761610399564,"version":"build-2065373602"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80724-8","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"3-33","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Building continuous webbed models for system F"],"prefix":"10.1016","volume":"35","author":[{"given":"S.","family":"Berardi","sequence":"first","affiliation":[]},{"given":"C.","family":"Berline","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80724-8_BIB1","unstructured":"R. Amadio, K. Bruce, and G. Longo, The finitary projection model for 2nd order calculus, IEEE Conference on Logic in Computer Science, Boston, June 1986."},{"key":"10.1016\/S1571-0661(05)80724-8_BIB2","unstructured":"F. Barbanera, S. Berardi, A domain of domains model of polymorphism, Technical Report, University of Turin, 1997, article en preparation."},{"volume":"103","year":"1984","author":"Barendregt","key":"10.1016\/S1571-0661(05)80724-8_BIB3"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB4","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0890-5401(91)90038-4","article-title":"Retractions on dl-Domains as a model for Type:Type","volume":"94","author":"Berardi","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB5","unstructured":"S. Berardi and C. Berline, A \u03b2\u03b7-complete model for System F, preprint, June 1998."},{"key":"10.1016\/S1571-0661(05)80724-8_BIB6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1051\/ita\/1992260100591","article-title":"Retractions et interpr\u00e9tation interne du polymorphisme : le probl\u00e8me de la retraction universelle","volume":"26 n\u00b01","author":"Berline","year":"1992","journal-title":"Informatique Theorique et Applications\/Theoretical Informatics and Applications"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB7","unstructured":"C. Berline, Chapitre \"Th\u00e9or\u00e8mes de normalisation et Systeme E\" from a course in \u03bb-calculus, available at http:\/\/www.logique.jussieu.fr\/www.berline\/index.html"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB8","unstructured":"C. Berline, From Computations to Foundations : the \u03bb-calculus and its webbed models, preprint, 69 p., 1997, on the author's www main page http:\/\/www.logique.jussieu.fr\/www.berline\/index.html, a revised version should be available end of October 1998."},{"key":"10.1016\/S1571-0661(05)80724-8_BIB9","series-title":"Logic Colloquium'82","first-page":"241","article-title":"Extended type structures and filter \u03bb-models","author":"Coppo","year":"1984"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB10","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-19020-1_18","article-title":"DI-domains as a model of polymorphism","volume":"298","author":"Coquand","year":"1987","journal-title":"3rd Workshop on Mathematical Foundations of Programming Language Semantics (April 87), LNCS"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0890-5401(89)90068-0","article-title":"Domain theoretical models of polymorphism","volume":"81","author":"Coquand","year":"1989","journal-title":"Information and Computation"},{"issue":"3","key":"10.1016\/S1571-0661(05)80724-8_BIB12","first-page":"289","article-title":"Algebras and combinators","volume":"13","author":"Engeler","year":"1981","journal-title":"Alg. Univ."},{"key":"10.1016\/S1571-0661(05)80724-8_BIB13","article-title":"Equality between functionals","volume":"453","author":"Friedman","year":"1975"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB14","doi-asserted-by":"crossref","unstructured":"J.Y. Girard, Une extension de l'interpr\u00e9tation de G\u00f6del \u00e0 I'analyse, et son application a l\u00e9limination des coupures et a la theorie des types, Proceedings of the 2nd Scandinavian Logic Symposium, J.E. Fenstadt, ed., North Holland, 1971, p.63-92.","DOI":"10.1016\/S0049-237X(08)70843-7"},{"year":"1972","series-title":"\u201cInterpretation fonctionnelle et \u00e9limination des coupures de l'Arithmetique d'ordre superieure,\" Th\u00e8se","author":"Girard","key":"10.1016\/S1571-0661(05)80724-8_BIB15"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","article-title":"System F of variable types, fifteen years later","volume":"45","author":"Girard","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB17","first-page":"252","article-title":"Universal retractions on dl-domains","volume":"119 n\u00b02","author":"Jiang","year":"1995","journal-title":"Information and Computation"},{"year":"1990","series-title":"\u201cLambda-calcul, types et mod\u00e8les\"","author":"Krivine","key":"10.1016\/S1571-0661(05)80724-8_BIB18"},{"year":"1993","series-title":"\u201cLambda-calculus, types and models,\u201d","author":"Krivine","key":"10.1016\/S1571-0661(05)80724-8_BIB19"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-13346-1_5","article-title":"Using information systems to solve recursive domain equations","volume":"173","author":"Larsen","year":"1984","journal-title":"In Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(93)90093-9","article-title":"The genericity theorem and the notion of parametricity in the polymorphic \u03bb-calculus","volume":"121","author":"Longo","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB22","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","article-title":"Set-theoretical models of \u03bb-calculus: theories, expansions and isomorphisms","volume":"24","author":"Longo","year":"1983","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB23","unstructured":"N. McCracken, A Finitary Retract Model for the Polymorphic \u03bb-calculus, unpublished, 1984."},{"key":"10.1016\/S1571-0661(05)80724-8_BIB24","article-title":"Petri nets, event structures and domains","volume":"13","author":"Nielsen","year":"1981","journal-title":"Part I, Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB25","first-page":"227","article-title":"Parametric Polymorphism","volume":"59","author":"O'Hearn","year":"1996"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB26","series-title":"Theory of Computation Report 13, Department of Computer Science","article-title":"The Y combinator in Scott's Lambda-calculus models","author":"Park","year":"1976"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB27","series-title":"Memorandum MIP-R-95, School of artificial intelligence","article-title":"A set-theoretical definition of application","author":"Plotkin","year":"1972"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB28","first-page":"408","article-title":"Toward a theory of type structures","volume":"19","author":"Reynolds","year":"1974","journal-title":"Colloque sur la programmation, SLNCS"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB29","unstructured":"J. Reynolds, Types, Abstraction and Parametric Polymorphism, in: Information Processing 83, Proceedings of the IFIP 9th World Computer Science Congress, Paris, September 1983, ed. by R.E.A. Mason, Elsevier Science Publishers B.V. (North Holland), Amsterdam, 1983, pp.513-523."},{"key":"10.1016\/S1571-0661(05)80724-8_BIB30","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"n\u00b03","author":"Scott","year":"1976","journal-title":"SIAM Journal of Computing 5"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB31","unstructured":"D. Scott, A space of retracts, manuscript, 1980"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB32","doi-asserted-by":"crossref","unstructured":"D. Scott, Domains for denotational semantics, in: Proceedings of ICALP'82, LNCS 140 (1982), p.577-613.","DOI":"10.1007\/BFb0012801"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB33","doi-asserted-by":"crossref","unstructured":"A. Simpson, Categorical completeness results for the simply-typed \u03bb-calculus, in: M. Dezani-Ciancaglini and G. Plotkin eds., Proceedings of TLCA'95, Lecture Notes in Computer Science 902 (1995), p.414-427.","DOI":"10.1007\/BFb0014068"},{"key":"10.1016\/S1571-0661(05)80724-8_BIB34","doi-asserted-by":"crossref","unstructured":"A. S. Troelstra, Notes on second order arithmetic, in: Mathias and Rogers, eds., Cambridge Summer Scool in Mathematical Logic, Lecture Notes in Mathematics 337 (1973), p. 171-205.","DOI":"10.1007\/BFb0066774"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105807248?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105807248?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:50Z","timestamp":1761610130000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105807248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":34,"alternative-id":["S1571066105807248"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80724-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Building continuous webbed models for system F","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80724-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}