## Inheritance As Implicit Coercion (1991)

Venue: | Information and Computation |

Citations: | 124 - 3 self |

### BibTeX

@ARTICLE{Breazu-tannen91inheritanceas,

author = {Val Breazu-tannen and Thierry Coquand and Carl A. Gunter and Andre Scedrov},

title = {Inheritance As Implicit Coercion},

journal = {Information and Computation},

year = {1991},

volume = {93}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We present a method for providing semantic interpretations for languages with a type system featuring inheritance polymorphism. Our approach is illustrated on an extension of the language Fun of Cardelli and Wegner, which we interpret via a translation into an extended polymorphic lambda calculus. Our goal is to interpret inheritances in Fun via coercion functions which are definable in the target of the translation. Existing techniques in the theory of semantic domains can be then used to interpret the extended polymorphic lambda calculus, thus providing many models for the original language. This technique makes it possible to model a rich type discipline which includes parametric polymorphism and recursive types as well as inheritance. A central difficulty in providing interpretations for explicit type disciplines featuring inheritance in the sense discussed in this paper arises from the fact that programs can type-check in more than one way. Since interpretations follow the type...

### Citations

1344 |
Smalltalk-80: The Language and its Implementation
- Goldberg, Robson
- 1983
(Show Context)
Citation Context ... in the framework of a rich type discipline which can accommodate strong static type-checking. This endeavor searches for a language that offers some of the flexibility of object-oriented programming =-=[GR83]-=- while maintaining the reliability, and sometimes increased efficiency of programs which type-check at compile-time (see [BBG88] for a related comparison). A type system of Reynolds introduced in [Rey... |

798 | On understanding types, data abstraction, and polymorphism
- Cardelli, Wegner
- 1985
(Show Context)
Citation Context ...ges. Another direction of research investigates expressing inheritance through explicit subtyping mechanisms which are part of the type-checking systems, such as in Cardelli and Wegner's language Fun =-=[CW85]-=- and further work [Car88b, Car89a, CM89]. Cardelli and Wegner sketch a model for Fun based on ideals. An extensional model for Fun was subsequently described by Bruce and Longo [BL88]. Their model int... |

669 | Light linear logic
- Girard
- 1998
(Show Context)
Citation Context ...etic interpretations that we have examined so far are summarized in the following table. The necessary properties for all but the last row can be found in [TT87, HP89b], [CGW89],[ABL86], [CGW87], and =-=[Gir87]-=- respectively. The properties needed for the last row can be checked in a manner similar to [Gir87]. TYPES TERMS COERCIONS VARIANTS Algebraic lattices bistrict maps sep sum of lattices Scott domains c... |

510 | A semantics of multiple inheritance - Cardelli - 1984 |

497 |
The calculus of constructions
- Coquand, Huet
- 1988
(Show Context)
Citation Context ...erivations is the same as giving meaning to derivable judgements. But for other calculi, such as Martin-Lof's Intuitionistic Type Theory (ITT) [Mar84] (see [Sal88]), and the Calculus of Constructions =-=[CH88]-=- (see [Str88]), and---of immediate concern to us---Cardelli and Wegner's Fun, this is not so, and one must prove that derivations yielding the same judgement are given the same meaning. This idea has ... |

379 |
Proofs and Types
- Girard, Lafont, et al.
- 1989
(Show Context)
Citation Context ...ctively) is that the continuous maps from C to D are in one-to-one correspondence with the strict maps from C? to D. Analogous remarks hold for stable maps and linear maps, with !C instead of C? (see =-=[Gir89]-=-, Chapter 8). From a category-theoretic point of view, the main point is that we are dealing with two categories,sone a reflective subcategory of the other, i.e. the inclusion functor has a left adjoi... |

354 |
Intuitionistic Type Theory
- Martin-Löf
- 1984
(Show Context)
Citation Context ...udgement. Therefore, in such calculi, giving meaning to derivations is the same as giving meaning to derivable judgements. But for other calculi, such as Martin-Lof's Intuitionistic Type Theory (ITT) =-=[Mar84]-=- (see [Sal88]), and the Calculus of Constructions [CH88] (see [Str88]), and---of immediate concern to us---Cardelli and Wegner's Fun, this is not so, and one must prove that derivations yielding the s... |

296 | The Lambda Calculus: Its Syntax and Semantics. Volume 103 - Barendregt - 1984 |

252 |
Inheritance is not subtyping
- Cook, Hill, et al.
- 1990
(Show Context)
Citation Context ...xtend to the functional part of Quest [Car89a] and to the language described in [CM89], using the techniques of Coquand [Coq88] and Lamarche [Lam88]. Current work on inheritance and subtyping such as =-=[CHC90]-=- and [Mit90] will provide new challenges. We do not claim that every interesting aspect of inheritance can necessarily be handled in this way. However, our treatment, by showing that inheritance can b... |

226 |
Closed categories
- Eilenberg, Kelly
- 1966
(Show Context)
Citation Context ... has also appeared in the context of category theory and our use of the term "coherence" is partially inspired by its use there, where it means the uniqueness of certain canonical morphisms =-=(see e.g. [KL71]-=- and [LP85]). Although we have not attempted 5 a rigorous connection in this paper, the possibility of unifying coherence results for a variety of different calculi offers an interesting direction of ... |

214 | Order-sorted Algebra I: Equational deduction for multiple inheritance, polymorphism and partial operations - Goguen, Meseguer - 1992 |

151 | Operations on records
- Cardelli, Mitchell
- 1991
(Show Context)
Citation Context ...of polymorphism and the ways in which Fun and related languages can be used to represent similar techniques are an object of considerable current investigation. One recent effort in this direction is =-=[CM89]-=- but several other efforts are under way. Despite its importance we have not explored this issue in this paper since the discussion about it is very unsettled and it will merit independent treatment a... |

151 |
The System F of variable types, fifteen years later
- Girard
- 1986
(Show Context)
Citation Context ...c lambda calculus (see [CGW87] for the semantics of TARGET). Therefore, SOURCE extends with inheritance and bounded generics TARGET, which is at its turn an extension of what Girard calls System F in =-=[Gir86]-=-. Our translation takes derivations of inheritance and typing judgements in SOURCE into derivations of typing judgements in TARGET. We translate the inheritance judgements of SOURCE into definable ter... |

145 | Corrigendum: Complete Type Inference for Simple Objects - Wand - 1988 |

127 |
Metamathematical investigation of intuitionistic Arithmetic andAnalysis
- Troelstra
- 1973
(Show Context)
Citation Context ...ons live) does have coproducts. From a proof-theoretic point of view, it is interesting to note that our solution is similar to the treatment of proof-theoretic commutation rules for disjunction (see =-=[Tro73], 4.1.3, o-=-n page 279 for a presentation of commutation rules). The so-called commutation rules for sums in proof theory are closely related to the equations fVART-CRN?g where P is an "evaluation" map ... |

89 |
Towards a typed foundation for method specialisation and inheritance
- Mitchell
- 1990
(Show Context)
Citation Context ... functional part of Quest [Car89a] and to the language described in [CM89], using the techniques of Coquand [Coq88] and Lamarche [Lam88]. Current work on inheritance and subtyping such as [CHC90] and =-=[Mit90]-=- will provide new challenges. We do not claim that every interesting aspect of inheritance can necessarily be handled in this way. However, our treatment, by showing that inheritance can be uniformly ... |

87 |
A modest model of records, inheritance and bounded quantification
- Bruce, Longo
- 1990
(Show Context)
Citation Context ...r's language Fun [CW85] and further work [Car88b, Car89a, CM89]. Cardelli and Wegner sketch a model for Fun based on ideals. An extensional model for Fun was subsequently described by Bruce and Longo =-=[BL88]-=-. Their model interprets inheritances as identity relations between partial equivalence relations (PER's). Another model of Fun, using the interval interpretation of Cartwright [Car85] has been given ... |

62 | Structural subtyping and the notion of power type - Cardelli - 1988 |

51 |
Using category theory to design implicit conversions and generic operators
- Reynolds
- 1980
(Show Context)
Citation Context ...R83] while maintaining the reliability, and sometimes increased efficiency of programs which type-check at compile-time (see [BBG88] for a related comparison). A type system of Reynolds introduced in =-=[Rey80]-=- captured some basic intuitions about inheritance relations between familiar type expressions built from records, variants (sums) and higher types. A language which exploited this form of type discipl... |

49 | Recursion over realizability structures - Amadio - 1991 |

49 | ML with extended pattern matching and subtypes - Jategaonkar, Mitchell - 1988 |

48 | What is a model of the lambda calculus - Meyer - 1982 |

46 | DI-domains as a model of polymorphism - Coquand, Winskel - 1986 |

45 | The theory of constructions: categorical semantics and topos-theoretic models - Hyland, Pitts - 1987 |

39 |
Proof Theoretic Studies about a Minimal Type System Integrating Inclusion and Parametric Polymorphism
- Ghelli
- 1990
(Show Context)
Citation Context ...oherence proof uses an order-theoretic property (see Lemma 11) which fails for the stronger system for deriving inheritances that uses (FORALL) (for a counterexample, see Giorgio Gelli's dissertation =-=[Ghe90]-=-). Thus, we prove the coherence of the translation of variants (Theorem 13) only for the weaker system with (W-FORALL). Note, however, that we prove coherence in the presence of (FORALL) for the syste... |

35 |
Relational semantics for recursive types and bounded quantification
- Cardone
- 1989
(Show Context)
Citation Context ...rpretations be the same? For a certain fragment of SOURCE (including recursion but not bounded quantification), Cardone has recently answered the question in the affirmative for his form of semantics =-=[Car89b]-=- (where coherence is not an issue because the interpretation of a judgement e: s is given as the equivalence class, in s, of the interpretation of the erasure of e---hence the meaning is not defined i... |

34 | Domain theoretical models of polymorphism
- Coquand, Gunter, et al.
- 1989
(Show Context)
Citation Context ...ill be an adjoint to a fibration over the slice category over v. This follows the analogy with models of polymorphism which are based on adjoints to fibrations over the category of all domains (as in =-=[CGW89]-=- for example). Although we believe that the translation just illustrated is intuitive, we need to show that it is coherent. In other words, we must show that the semantic function is well defined. The... |

33 | Operational semantics of order-sorted algebra - Goguen, Jouannaud, et al. - 1985 |

33 |
Coherence for bicategories and indexed categories
- Lane, Paré
- 1985
(Show Context)
Citation Context ...ppeared in the context of category theory and our use of the term "coherence" is partially inspired by its use there, where it means the uniqueness of certain canonical morphisms (see e.g. [=-=KL71] and [LP85]-=-). Although we have not attempted 5 a rigorous connection in this paper, the possibility of unifying coherence results for a variety of different calculi offers an interesting direction of investigati... |

33 | Type Inference in a Database Programming Language - Ohori, Buneman - 1988 |

31 | A note on inconsistencies caused by fixpoints in a cartesian closed category - Huwig, Poigné - 1990 |

30 |
An algebraic model of subtype and inheritance
- Bruce, Wegner
- 1990
(Show Context)
Citation Context ...J. Meseguer on order-sorted algebras [GJM85, GM]. In particular, the implementation of OBJ2 utilized a form of "inheritance as implicit coercion" approach. Related work by Bruce and Wegner a=-=ppears in [BW90]-=-. Abstract coherence. Since there are many different calculi for which a coherence theorem is interesting, it is very useful to have a more abstract theory from which special instances of coherence 29... |

29 | Relating theories of the lambda-calculus - Scott - 1980 |

28 | Type inference with subtypes - Stansifer - 1988 |

22 |
Computing with coercions
- Breazu-Tannen, Gunter, et al.
- 1990
(Show Context)
Citation Context ...e application of a constant function to a divergent argument will diverge in general. Semantically, this means that terms of higher type must be interpreted as strict functions. In a subsequent paper =-=[BGS90]-=-, three of the authors of the current document have explored the operational semantics of inheritance with a coercion semantics in a call-by-value setting. The results there are intuitively pleasing, ... |

22 |
Coherence of subsumption
- Curien, Ghelli
- 1990
(Show Context)
Citation Context ...writing techniques, Curien and Ghelli have developed a type-theoretic approach to the abstract coherence problem for F which is a subsystem of SOURCE featuring only function and bounded generic types =-=[CG90]-=-. It would be interesting to see this technique extended to all of SOURCE, especially in view of the complications we encountered with variants. Subtyping of bounded quantification. Our main coherence... |

22 | Essays on combinatory logic, lambda calculus and formalism - Curry |

21 | Diagonal arguments and Cartesian closed categories, in Category theory, homology theory and their applications - Lawvere - 1969 |

20 |
Thefinitary projection model for second order lambda calculus and solutions to higher order domain equations
- Amadio, Bruce, et al.
- 1986
(Show Context)
Citation Context ...ions. The domain-theoretic interpretations that we have examined so far are summarized in the following table. The necessary properties for all but the last row can be found in [TT87, HP89b], [CGW89],=-=[ABL86]-=-, [CGW87], and [Gir87] respectively. The properties needed for the last row can be checked in a manner similar to [Gir87]. TYPES TERMS COERCIONS VARIANTS Algebraic lattices bistrict maps sep sum of la... |

19 | Models of the lambda calculus - Koymans - 1982 |

14 |
Correctness and Completeness of a Categorical Semantics of the Calculus of Constructions
- Streicher
- 1989
(Show Context)
Citation Context ...s the same as giving meaning to derivable judgements. But for other calculi, such as Martin-Lof's Intuitionistic Type Theory (ITT) [Mar84] (see [Sal88]), and the Calculus of Constructions [CH88] (see =-=[Str88]-=-), and---of immediate concern to us---Cardelli and Wegner's Fun, this is not so, and one must prove that derivations yielding the same judgement are given the same meaning. This idea has also appeared... |

14 | The system F of variable types, fteen years later - Girard - 1986 |

12 |
Categories of embeddings
- Coquand
- 1989
(Show Context)
Citation Context ... which interpret these inheritances. Moreover, we expect that our methods will extend to the functional part of Quest [Car89a] and to the language described in [CM89], using the techniques of Coquand =-=[Coq88]-=- and Lamarche [Lam88]. Current work on inheritance and subtyping such as [CHC90] and [Mit90] will provide new challenges. We do not claim that every interesting aspect of inheritance can necessarily b... |

6 |
Types as intervals
- Cartwright
- 1985
(Show Context)
Citation Context ... Bruce and Longo [BL88]. Their model interprets inheritances as identity relations between partial equivalence relations (PER's). Another model of Fun, using the interval interpretation of Cartwright =-=[Car85]-=- has been given by Martini [Mar88]. In Martini's semantics, inheritance is interpreted as a form of inclusion between intervals. This model also includes a general recursion operator for functions (bu... |

6 | Coherence and consistency in domains (extended outline - Gunter, Jung - 1988 |

5 |
Typed functional programming for rapid development of reliable software
- Breazu-Tannen, Buneman, et al.
- 1988
(Show Context)
Citation Context ...guage that offers some of the flexibility of object-oriented programming [GR83] while maintaining the reliability, and sometimes increased efficiency of programs which type-check at compile-time (see =-=[BBG88]-=- for a related comparison). A type system of Reynolds introduced in [Rey80] captured some basic intuitions about inheritance relations between familiar type expressions built from records, variants (s... |

5 |
Typeful programming. Research Report 45
- Cardelli
- 1989
(Show Context)
Citation Context ...roofs of the relevant lemmas in this paper hold between the the constant coercions which interpret these inheritances. Moreover, we expect that our methods will extend to the functional part of Quest =-=[Car89a]-=- and to the language described in [CM89], using the techniques of Coquand [Coq88] and Lamarche [Lam88]. Current work on inheritance and subtyping such as [CHC90] and [Mit90] will provide new challenge... |

5 | A completeness theorem for recursively defined types, in - Coppo, Cardone |

5 |
Normal functors� power series� and ��calculus
- Girard
- 1988
(Show Context)
Citation Context ...r a presentation of commutation rules). The so-called commutation rules for sums in proof theory are closely related to the equations fVART-CRN?g where P is an "evaluation" map (see the Appe=-=ndix B of [Gir88]-=-). 7 Conclusions and directions for further investigation The development of calculi for the representation of inheritance polymorphism and the semantics of such calculi is a growing and dynamic area ... |

3 |
Recursion and subtyping in lambda calculi
- Amadio
- 1991
(Show Context)
Citation Context ...erivation). For the full calculus the answer is still unknown as this paper is being written. Amadio's thesis contains some results about the relationship between explicit coercions and PER inclusion =-=[Ama91]-=-. Equational Theory. The reader has probably noted that we have never offered an equational theory for SOURCE, only one for TARGET. At the current time, the proper equational theory for SOURCE is stil... |