{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:53:03Z","timestamp":1754484783563},"reference-count":24,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"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":6438,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1016\/0167-6423(95)00010-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:52:44Z","timestamp":1051141964000},"page":"81-116","source":"Crossref","is-referenced-by-count":8,"title":["A theory of primitive objects"],"prefix":"10.1016","volume":"25","author":[{"given":"Mart\u00edn","family":"Abadi","sequence":"first","affiliation":[]},{"given":"Luca","family":"Cardelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(95)00010-0_BIB1","series-title":"Proc. IEEE Symposium on Logic in Computer Science","first-page":"332","article-title":"A semantics of object types","author":"Abadi","year":"1994"},{"key":"10.1016\/0167-6423(95)00010-0_BIB2","series-title":"Proc. Theoretical Aspects of Computer Software","article-title":"A theory of primitive objects: untyped and first-order systems","author":"Abadi","year":"1994"},{"key":"10.1016\/0167-6423(95)00010-0_BIB3","series-title":"Proc. TAPSOFT'95","first-page":"471","article-title":"An imperative object calculus","author":"Abadi","year":"1995"},{"key":"10.1016\/0167-6423(95)00010-0_BIB4","series-title":"Proc. ECOOP'95","article-title":"On subtyping and matching","author":"Abadi","year":"1995"},{"key":"10.1016\/0167-6423(95)00010-0_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(85)90135-5","article-title":"Automatic synthesis of typed \u03bb-programs on term algebras","volume":"39","author":"B\u00f6hm","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/0167-6423(95)00010-0_BIB6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800001039","article-title":"A paradigmatic object-oriented programming language: design, static typing and semantics","volume":"4","author":"Bruce","year":"1994","journal-title":"J. Func. Programming"},{"key":"10.1016\/0167-6423(95)00010-0_BIB7","article-title":"The Hopkins Objects Group","author":"Bruce","year":"1995"},{"key":"10.1016\/0167-6423(95)00010-0_BIB8","series-title":"Theoretical Aspects of Object-Oriented Programming","first-page":"373","article-title":"Extensible records in a pure calculus of subtyping","author":"Cardelli","year":"1994"},{"key":"10.1016\/0167-6423(95)00010-0_BIB9","series-title":"Proc. Theoretical Aspects of Computer Software","first-page":"750","article-title":"An extension of system F with subtyping","volume":"Vol. 526","author":"Cardelli","year":"1991"},{"issue":"4","key":"10.1016\/0167-6423(95)00010-0_BIB10","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/6041.6042","article-title":"On understanding types, data abstraction and polymorphism","volume":"17","author":"Cardelli","year":"1985","journal-title":"Computing Surveys"},{"issue":"1","key":"10.1016\/0167-6423(95)00010-0_BIB11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1017\/S0960129500001134","article-title":"Coherence of subsumption, minimum typing and type-checking in F\u2264","volume":"2","author":"Curien","year":"1992","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/0167-6423(95)00010-0_BIB12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/365813.365819","article-title":"Simula, an Algol-based simulation language","volume":"9","author":"Dahl","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(95)00010-0_BIB13","series-title":"Proc. Theoretical Aspects of Computer Software","first-page":"844","article-title":"Notes on typed object-oriented programming","author":"Fisher","year":"1994"},{"key":"10.1016\/0167-6423(95)00010-0_BIB14","article-title":"Interpr\u00e9tation fonctionelle et \u00e9limination des coupures dans l'arithm\u00e9tique d'ordre sup\u00e9rieur","author":"Girard","year":"1972"},{"key":"10.1016\/0167-6423(95)00010-0_BIB15","series-title":"Proofs and Types","author":"Girard","year":"1989"},{"key":"10.1016\/0167-6423(95)00010-0_BIB16","series-title":"Object-oriented Software Construction","author":"Meyer","year":"1988"},{"key":"10.1016\/0167-6423(95)00010-0_BIB17","series-title":"Proc. 8th Annual IEEE Symp. on Logic in Computer Science","article-title":"A lambda calculus of objects and method specialization","author":"Mitchell","year":"1993"},{"key":"10.1016\/0167-6423(95)00010-0_BIB18","series-title":"Proc. 12th Annual ACM Symp. on Principles of Programming Languages","article-title":"Abstract types have existential type","author":"Mitchell","year":"1985"},{"key":"10.1016\/0167-6423(95)00010-0_BIB19","series-title":"Systems Programming with Modula-3","year":"1991"},{"key":"10.1016\/0167-6423(95)00010-0_BIB20","series-title":"Proc. 9th Annual IEEE Symp. on Logic in Computer Science","first-page":"186","article-title":"Efficient inference for object types","author":"Palsberg","year":"1994"},{"key":"10.1016\/0167-6423(95)00010-0_BIB21","series-title":"Proc. IEEE Symp. on Logic in Computer Science","first-page":"310","article-title":"Subtyping and parametricity","author":"Plotkin","year":"1994"},{"key":"10.1016\/0167-6423(95)00010-0_BIB22","series-title":"Proc. Colloquium sur la programmation","first-page":"408","article-title":"Towards a theory of type structure","volume":"Vol. 19","author":"Reynolds","year":"1974"},{"key":"10.1016\/0167-6423(95)00010-0_BIB23","article-title":"Engineering a programming language: the type and class system of Sather","author":"Szypersky","year":"1993"},{"key":"10.1016\/0167-6423(95)00010-0_BIB24","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","article-title":"Some unusual \u03bb-calculus numeral systems","author":"Wadsworth","year":"1980"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642395000100?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642395000100?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T03:54:59Z","timestamp":1555473299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642395000100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":24,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["0167642395000100"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(95)00010-0","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}