Higher-order intersection types and multiple inheritance-Reference-Cited by-同舟云学术

Higher-order intersection types and multiple inheritance

Published:1996-10 Issue:5 Volume:6 Page:469-501
ISSN:0960-1295
Container-title:Mathematical Structures in Computer Science
language:en
Short-container-title:Math. Struct. Comp. Sci.

Author:

Compagnoni Adriana B.,Pierce Benjamin C.

Abstract

We study a natural generalization of SystemFωwith intersection types, establishing basic structural properties and constructing a semantic model based on partial equivalence relations to prove the soundness of typing. As an application of this calculus, we define a simple typed model of object-oriented programming with multiple inheritance.

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,Mathematics (miscellaneous)

Reference41 articles.

1. Data Types as Lattices

2. Pierce B. C. (1991) Programming with Intersection Types and Bounded Polymorphism, Ph.D. thesis, Carnegie Mellon University. (Available as School of Computer Science technical report CMUCS- 91-205.)

3. Mitchell J. C. , Honsell F. and Fisher K. (1993) A lambda calculus of objects and method specialization. In: 1993 IEEE Symposium on Logic in Computer Science.

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Bowtie for a Beast: Overloading, Eta Expansion, and Extensible Data Types in F⋈;Proceedings of the ACM on Programming Languages;2023-01-09

2. A Calculus with Recursive Types, Record Concatenation and Subtyping;Programming Languages and Systems;2022

3. A tale of intersection types;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08

4. Disjoint Polymorphism;Programming Languages and Systems;2017

5. Disjoint intersection types;ACM SIGPLAN Notices;2016-12-05