{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:07:37Z","timestamp":1763467657174,"version":"3.44.0"},"reference-count":61,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:00:00Z","timestamp":1164758400000},"content-version":"vor","delay-in-days":5630,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1016\/0890-5401(91)90055-7","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"172-221","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":114,"title":["Inheritance as implicit coercion"],"prefix":"10.1016","volume":"93","author":[{"given":"Val","family":"Breazu-Tannen","sequence":"first","affiliation":[]},{"given":"Thierry","family":"Coquand","sequence":"additional","affiliation":[]},{"given":"Carl A.","family":"Gunter","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90055-7_BIB1","series-title":"Logic in Computer Science","first-page":"122","article-title":"The finitary projection model for second order lambda calculus and solutions to higher order domain equations","author":"Amadio","year":"1986"},{"year":"1989","author":"Amadio","key":"10.1016\/0890-5401(91)90055-7_BIB2"},{"key":"10.1016\/0890-5401(91)90055-7_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90074-C","article-title":"Recursion over realizability structures","volume":"91","author":"Amadio","year":"1991","journal-title":"Inform. and Comput."},{"article-title":"Recursion and Subtyping in Lambda Calculi","year":"1991","author":"Amadio","key":"10.1016\/0890-5401(91)90055-7_BIB4"},{"key":"10.1016\/0890-5401(91)90055-7_BIB5","article-title":"The Lambda Calculus: Its Syntax and Semantics","volume":"Vol. 103","author":"Barendregt","year":"1984"},{"key":"10.1016\/0890-5401(91)90055-7_BIB6","series-title":"Productivity: Progress, Prospects and Payoff","first-page":"115","article-title":"Typed functional programming for the rapid development of reliable software","author":"Breazu-Tannen","year":"1988"},{"key":"10.1016\/0890-5401(91)90055-7_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(88)90097-7","article-title":"Extensional models for polymorphsim","volume":"59","author":"Breazu-Tannen","year":"1988","journal-title":"Theoret. Computer Sci."},{"key":"10.1016\/0890-5401(91)90055-7_BIB8","series-title":"Logic in Computer Science","first-page":"112","article-title":"Inheritance and explict coercion (preliminary report)","author":"Breazu-Tannen","year":"1989"},{"year":"1989","author":"Breazu-Tannen","key":"10.1016\/0890-5401(91)90055-7_BIB9"},{"key":"10.1016\/0890-5401(91)90055-7_BIB10","series-title":"Lisp and Functional Programming","first-page":"44","article-title":"Computing with coercions","author":"Breazu-Tannen","year":"1990"},{"key":"10.1016\/0890-5401(91)90055-7_BIB11","series-title":"Logic in Computer Science","first-page":"38","article-title":"A modest model of records, inheritance and bounded quantification","author":"Bruce","year":"1988"},{"key":"10.1016\/0890-5401(91)90055-7_BIB12","series-title":"Advances in Database Programming Languages","first-page":"75","article-title":"An algebraic model of subtype and inheritance","author":"Bruce","year":"1990"},{"key":"10.1016\/0890-5401(91)90055-7_BIB13","series-title":"Semantics of Data Types","first-page":"51","article-title":"A semantics of multiple inheritance","volume":"Vol. 173","author":"Cardelli","year":"1984"},{"key":"10.1016\/0890-5401(91)90055-7_BIB14","series-title":"Combinators and Functional Programming Languages","first-page":"21","article-title":"Amber","volume":"Vol. 242","author":"Cardelli","year":"1986"},{"key":"10.1016\/0890-5401(91)90055-7_BIB15","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0890-5401(88)90007-7","article-title":"A semantics of multiple inheritance","volume":"76","author":"Cardelli","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90055-7_BIB16","series-title":"Symposium on Principles of Programming Languages","first-page":"70","article-title":"Structural subtyping and the notion of power type","author":"Cardelli","year":"1988"},{"year":"1989","author":"Cardelli","key":"10.1016\/0890-5401(91)90055-7_BIB17"},{"key":"10.1016\/0890-5401(91)90055-7_BIB18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/S0960129500000049","article-title":"Operations on records","volume":"1","author":"Cardelli","year":"1991","journal-title":"Math. Structures in Comput. Sci."},{"issue":"4","key":"10.1016\/0890-5401(91)90055-7_BIB19","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":"ACM Comput. Surveys"},{"key":"10.1016\/0890-5401(91)90055-7_BIB20","series-title":"International Colloquium on Automata, Languages and Programs","first-page":"164","article-title":"Relational semantics for recursive types and bounded quantification","volume":"Vol. 372","author":"Cardone","year":"1989"},{"key":"10.1016\/0890-5401(91)90055-7_BIB21","series-title":"Symposium on Principles of Programming Languages","article-title":"Types as intervals","author":"Cartwright","year":"1985"},{"key":"10.1016\/0890-5401(91)90055-7_BIB22","series-title":"Principles of Programming Languages","first-page":"125","article-title":"Inheritance is not subtyping","author":"Cook","year":"1990"},{"key":"10.1016\/0890-5401(91)90055-7_BIB23","series-title":"International Colloquium on Automata, Languages and Programs","first-page":"120","article-title":"A completeness theorem for recursively defined types","volume":"Vol. 194","author":"Coppo","year":"1985"},{"key":"10.1016\/0890-5401(91)90055-7_BIB24","series-title":"Symposium on Logic in Computer Science","first-page":"218","article-title":"Type inference and logical relations","author":"Coppo","year":"1986"},{"key":"10.1016\/0890-5401(91)90055-7_BIB25","series-title":"Logic in Computer Science","first-page":"256","article-title":"Categories of embeddings","author":"Coquand","year":"1988"},{"key":"10.1016\/0890-5401(91)90055-7_BIB26","series-title":"Category Theory and Computer Science","first-page":"40","article-title":"An equational presentation of higher-order logic","volume":"Vol. 283","author":"Coquand","year":"1987"},{"key":"10.1016\/0890-5401(91)90055-7_BIB27","series-title":"Mathematical Foundations of Programming Language Semantics","first-page":"344","article-title":"DI-domains as a model of polymorphism","volume":"Vol. 298","author":"Coquand","year":"1987"},{"key":"10.1016\/0890-5401(91)90055-7_BIB28","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0890-5401(89)90068-0","article-title":"Domain theoretic models of polymorphism","volume":"81","author":"Coquand","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90055-7_BIB29","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","article-title":"The calculus of constructions","volume":"76","author":"Coquand","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90055-7_BIB30","series-title":"Proceedings CAAP'90, LNCS 431","article-title":"Coherence of subsumption","author":"Curien","year":"1990"},{"key":"10.1016\/0890-5401(91)90055-7_BIB31","series-title":"Logic in Computer Science","first-page":"498","article-title":"Recursive types reduced to inductive types","author":"Freyd","year":"1990"},{"key":"10.1016\/0890-5401(91)90055-7_BIB32","series-title":"Logic in Computer Science","first-page":"346","article-title":"Extensional PERs","author":"Freyd","year":"1990"},{"article-title":"Proff-Theoretic Studies about a Minimal Type System Integrating Inclusion and Parametric Polymorphism","year":"1990","author":"Ghelli","key":"10.1016\/0890-5401(91)90055-7_BIB33"},{"key":"10.1016\/0890-5401(91)90055-7_BIB34","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90044-7","article-title":"The system F of variable types: Fifteen years later","volume":"45","author":"Girard","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90055-7_BIB35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90055-7_BIB36","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0168-0072(88)90025-5","article-title":"Normal functors, power series, and \u03bb-calculus","volume":"37","author":"Girard","year":"1988","journal-title":"Ann. Pure Appl. Logic"},{"year":"1989","author":"Girard","key":"10.1016\/0890-5401(91)90055-7_BIB37"},{"key":"10.1016\/0890-5401(91)90055-7_BIB38","series-title":"International Colloquium on Automata, Languages and Programs","first-page":"221","article-title":"Operational semantics for order-sorted algebra","volume":"Vol. 194","author":"Goguen","year":"1985"},{"key":"10.1016\/0890-5401(91)90055-7_BIB61","unstructured":"Goguen, J. A., and Meseguer, J. (unpublished manuscript), Order-sorted algebra. I. Equational deduction for multiple inheritance, overloading, exceptions and partial operations."},{"year":"1983","author":"Goldberg","key":"10.1016\/0890-5401(91)90055-7_BIB39"},{"key":"10.1016\/0890-5401(91)90055-7_BIB40","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0022-4049(90)90055-M","article-title":"Coherence and consistency in domains (extended outline)","volume":"63","author":"Gunter","year":"1990","journal-title":"J. Pure Appl. Algebro"},{"key":"10.1016\/0890-5401(91)90055-7_BIB41","article-title":"A note on inconsistencies caused by fixpoints in a cartesian closed category","author":"Huwig","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90055-7_BIB42","series-title":"Categories in Computer Science and Ligic","first-page":"137","article-title":"The theory of constructions: Categorical semantics and topos-theoretic models","volume":"Vol. 92","author":"Hyland","year":"1989"},{"key":"10.1016\/0890-5401(91)90055-7_BIB43","series-title":"Symposium on LISP and Functional Programming","first-page":"198","article-title":"ML with extended pattern matching and subtypes","author":"Jategaonkar","year":"1988"},{"key":"10.1016\/0890-5401(91)90055-7_BIB44","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0022-4049(71)90013-2","article-title":"Coherence in closed categories","volume":"1","author":"Kelly","year":"1971","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/0890-5401(91)90055-7_BIB45","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0019-9958(82)90796-3","article-title":"Models of the lambda calculus","volume":"52","author":"Koymans","year":"1982","journal-title":"Inform. and Control"},{"article-title":"Modelling Polymorphism with Categories","year":"1988","author":"Lamarche","key":"10.1016\/0890-5401(91)90055-7_BIB46"},{"key":"10.1016\/0890-5401(91)90055-7_BIB47","series-title":"Category Theory, Homology Theory, and Their Applications II","first-page":"134","article-title":"Diagonal arguments and cartesian closed categories","volume":"Vol. 92","author":"Lawvere","year":"1969"},{"key":"10.1016\/0890-5401(91)90055-7_BIB48","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0022-4049(85)90087-8","article-title":"Coherence for bicategories and indexed categories","volume":"37","author":"MacLane","year":"1985","journal-title":"J. Pure Appl. Algebra"},{"year":"1984","author":"Martin-L\u00f6f","key":"10.1016\/0890-5401(91)90055-7_BIB49"},{"key":"10.1016\/0890-5401(91)90055-7_BIB50","series-title":"Symposium on LISP and Functional Programming","first-page":"164","article-title":"Bounded quantifiers have interval models","author":"Martini","year":"1988"},{"key":"10.1016\/0890-5401(91)90055-7_BIB51","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","article-title":"What is a model of the lambda calculus?","volume":"52","author":"Meyer","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90055-7_BIB52","series-title":"Principles of Programming Languages","first-page":"109","article-title":"Toward a typed foundation for method specialization and inheritance","author":"Mitchell","year":"1990"},{"key":"10.1016\/0890-5401(91)90055-7_BIB53","series-title":"Symposium on LISP and Functional Programming","first-page":"174","article-title":"Type inference in a database programming language","author":"Ohori","year":"1988"},{"key":"10.1016\/0890-5401(91)90055-7_BIB54","series-title":"Semantics-Directed Compiler Generation","first-page":"211","article-title":"Using category theory to design implicit conversions and generic operators","volume":"Vol. 94","author":"Reynolds","year":"1980"},{"key":"10.1016\/0890-5401(91)90055-7_BIB55","series-title":"Technical Report","article-title":"Polymorphism and monomorphism in Martin-L\u00f6f's type theory","author":"Salvesen","year":"1988"},{"key":"10.1016\/0890-5401(91)90055-7_BIB56","series-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"403","article-title":"Relating theories of the lambda calculus","author":"Scott","year":"1980"},{"key":"10.1016\/0890-5401(91)90055-7_BIB57","series-title":"Symposium on Principles of Programming Languages","first-page":"88","article-title":"Type inference with subtypes","author":"Stansifer","year":"1988"},{"article-title":"Correctness and Completeness of a Categorical Semantics of the Calculus of Constructions","year":"1988","author":"Streicher","key":"10.1016\/0890-5401(91)90055-7_BIB58"},{"key":"10.1016\/0890-5401(91)90055-7_BIB59","article-title":"Metamathematical Investigations of Intuitionistic Arithmetic and Analysis","volume":"Vol. 344","author":"Troelstra","year":"1973"},{"key":"10.1016\/0890-5401(91)90055-7_BIB60","series-title":"Symposium on Logic in Computer Science","first-page":"37","article-title":"Complete type inference for simple objects","author":"Wand","year":"1987"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900557?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900557?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T15:10:17Z","timestamp":1757517017000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540191900557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["0890540191900557"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90055-7","relation":{},"ISSN":["0890-5401"],"issn-type":[{"type":"print","value":"0890-5401"}],"subject":[],"published":{"date-parts":[[1991,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Inheritance as implicit coercion","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0890-5401(91)90055-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}