Inheritance as implicit coercion

Information and Computation

Volumn 93, Issue 1, 1991, Pages 172-221

  Breazu Tannen, Val ^a   Coquand, Thierry ^b   Gunter, Carl A ^a   Scedrov, Andre ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b INRIA Domaine de Voluceau 78150 Roquencourt Cedex France ^*

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES - THEORY;

COERCION FUNCTIONS; FUN LANGUAGE; IMPLICIT COERCION; INHERITANCE POLYMORPHISM; LAMBDA CALCULUS; SEMANTIC INTERPRETATIONS;

COMPUTER METATHEORY;

EID: 0026190144     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(91)90055-7     Document Type: Article

References (61)

1. The finitary projection model for second order lambda calculus and solutions to higher order domain equations
2. Recursion over realizability structures
3. Recursion and Subtyping in Lambda Calculi
4. The Lambda Calculus: Its Syntax and Semantics
5. Typed functional programming for the rapid development of reliable software
6. Extensional models for polymorphsim
7. Inheritance and explict coercion (preliminary report)
8. Computing with coercions
9. A modest model of records, inheritance and bounded quantification
10. An algebraic model of subtype and inheritance
11. A semantics of multiple inheritance
12. Amber
13. A semantics of multiple inheritance
14. Structural subtyping and the notion of power type
15. Operations on records
16. On understanding types, data abstraction and polymorphism
17. Relational semantics for recursive types and bounded quantification
18. Types as intervals
19. Inheritance is not subtyping
20. A completeness theorem for recursively defined types
21. Type inference and logical relations
22. Categories of embeddings
23. An equational presentation of higher-order logic
24. DI-domains as a model of polymorphism
25. Domain theoretic models of polymorphism
26. The calculus of constructions
27. Coherence of subsumption
28. Recursive types reduced to inductive types
29. Extensional PERs
30. Proff-Theoretic Studies about a Minimal Type System Integrating Inclusion and Parametric Polymorphism
31. The system F of variable types: Fifteen years later
32. Linear logic
33. Normal functors, power series, and λ-calculus
34. Operational semantics for order-sorted algebra
35. Coherence and consistency in domains (extended outline)
36. A note on inconsistencies caused by fixpoints in a cartesian closed category
37. The theory of constructions: Categorical semantics and topos-theoretic models
38. ML with extended pattern matching and subtypes
39. Coherence in closed categories
40. Models of the lambda calculus
41. Modelling Polymorphism with Categories
42. Diagonal arguments and cartesian closed categories
43. Coherence for bicategories and indexed categories
44. Bounded quantifiers have interval models
45. What is a model of the lambda calculus?
46. Toward a typed foundation for method specialization and inheritance
47. Type inference in a database programming language
48. Using category theory to design implicit conversions and generic operators
49. Polymorphism and monomorphism in Martin-Löf's type theory
50. Relating theories of the lambda calculus
51. Type inference with subtypes
52. Correctness and Completeness of a Categorical Semantics of the Calculus of Constructions
53. Metamathematical Investigations of Intuitionistic Arithmetic and Analysis
54. Complete type inference for simple objects