{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T21:44:24Z","timestamp":1693863864507},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":5645,"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":[[1998,2]]},"DOI":"10.1016\/s0304-3975(96)00300-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"75-96","source":"Crossref","is-referenced-by-count":21,"title":["Bounded existentials and minimal typing"],"prefix":"10.1016","volume":"193","author":[{"given":"Giorgio","family":"Ghelli","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Pierce","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00300-3_BIB1","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/3857.3859","article-title":"Galileo: a strongly typed, interactive conceptual language","volume":"10","author":"Albano","year":"1985","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0304-3975(96)00300-3_BIB2","article-title":"An implementation of F\u2a7d","author":"Cardelli","year":"1993"},{"key":"10.1016\/S0304-3975(96)00300-3_BIB3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1006\/inco.1994.1013","article-title":"An extension of system F with subtyping","volume":"109","author":"Cardelli","year":"1994","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/S0304-3975(96)00300-3_BIB4","doi-asserted-by":"crossref","DOI":"10.1145\/6041.6042","article-title":"On understanding types, data abstraction, and polymorphism","volume":"17","author":"Cardelli","year":"1985","journal-title":"Comput. Surveys"},{"key":"10.1016\/S0304-3975(96)00300-3_BIB5_1","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129500001134","article-title":"Coherence of subsumption: minimum typing and type-checking in F\u2a7d","volume":"2","author":"Curien","year":"1992","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00300-3_BIB5_2","series-title":"Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design","year":"1994"},{"key":"10.1016\/S0304-3975(96)00300-3_BIB6","series-title":"Proc. Internat. Conf. on Typed Lambda Calculi and Applications (TLCA)","first-page":"146","article-title":"Recursive types are not conservative over F\u2a7d","volume":"Vol. 664","author":"Ghelli","year":"1993"},{"key":"10.1016\/S0304-3975(96)00300-3_BIB7","article-title":"Proof theoretic studies about a minimal type system intergrating inclusion and parametric polymorphism","author":"Ghelli","year":"1990"},{"key":"10.1016\/S0304-3975(96)00300-3_BIB8","unstructured":"Tech. Report TD 6\/90, Dipartimento di Informatica, Universita di Pisa."},{"key":"10.1016\/S0304-3975(96)00300-3_BIB9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(94)00037-J","article-title":"Divergence of F\u2a7d type checking","volume":"139","author":"Ghelli","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00300-3_BIB10","article-title":"Interpr\u00e9tation fonctionelle et \u00e9limination des coupures de l'arithm\u00e9tique d'ordre sup\u00e9ricur","author":"Girard","year":"1972"},{"key":"10.1016\/S0304-3975(96)00300-3_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/44501.45065","article-title":"Abstract types have existential type","volume":"10","author":"Mitchell","year":"1988","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/S0304-3975(96)00300-3_BIB12_1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/inco.1994.1055","article-title":"Bounded quantification is undecidable","volume":"112","author":"Pierce","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(96)00300-3_BIB12_2","series-title":"Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003003?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003003?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:00:12Z","timestamp":1555419612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596003003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0304397596003003"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00300-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}