A modest model of records, inheritance, and bounded quantification

Information and Computation

Volumn 87, Issue 1-2, 1990, Pages 196-240

  Bruce, Kim B ^a   Longo, Giuseppe ^b  

^a WILLIAMS COLLEGE   (United States)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY;

BOUNDED FUN; BOUNDED QUANTIFICATION; INHERITANCE; RECORDS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0025462449     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(90)90062-M     Document Type: Article

References (56)

1. A fixed point extension of the second-order lambda-calculus: Observable equialences and models
2. Combining language and database advances in an object-oriented development environment
3. Functorial polymorphism
4. Extensional models for polymorphism
5. Inheritance and explicit coercion (preliminary report)
6. A completeness theorem for second-order polymorphic lambda calculus
7. The semantics of second order lambda-calculus
8. An Algebraic Model of Subtype and Inherence
9. F-bounded quantification for Object-Oriented Programming
10. A categorical approach to realizability and polymorphic types
11. A semantics of multiple inheritance
12. Proceedings of International Symposium on the Semantics of Data Types
13. A Semantic Basis for Quest
14. On understanding types data abstraction and polymorphism
15. Constructions: A Higher Order Proof System for Mechanizing Mathematics
16. Coherence of subsumption
17. A categorical semantics of constructions
18. Interprétation fonctionelle et élimination des coupures dans l'arithmetic d'ordre supérieur
19. The effective Topos
20. A small complete category
21. The discrete objects in the effective topos
22. ML with extended pattern matching and subtypes
23. Data abstraction and hierarchy, Addendum
24. On Church's formal theory of functions and functionals
25. From type structures to type theories
26. Constructive natural deduction and its modest interpretation
27. An ideal model for recursive polymorphic types
28. Modelli non estensionali del polimorfismo in programmazione funzionale
29. Relating models of polymorphism
30. Empty types in polymorphic lambda calculus
31. Semantic models for second-order lambda calculus
32. Coercion and type inference
33. A type-inference approach to reduction properties and semantics of polymorphic expressions
34. Polymorphic type inference and containment
35. Symposium on Semantics of Data Types
36. Polymorphism is set theoretic, constructively
37. Towards a theory of type structure
38. Using category theory to design implicit conversions and generic operators
39. Polymorphism is not set-theoretic
40. Categorical semantics for higher order polymorphic lambda calculus
41. An introduction to Trellis/Owl
42. Encapsulation and inheritance in object-oriented programming languages
43. Notes in intuitionistic second order arithmetic
44. Type inference for record concatenation and multiple inheritance