A complete type inference algorithm for simple intersection types

M. Coppo; P. Giannini

Conference Proceedings

A complete type inference algorithm for simple intersection types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 581 LNCS 102-123

DOI: 10.1007/3-540-55251-0_6

16Citations

17Readers

Get full text

Abstract

In this paper we present a decidable restriction of the intersection type discipline, obtained by combining intersection and universal quantification over types. The system, which has a notion of principal type, is a proper extension of the ML type system. A sound and complete type checking algorithm is presented and proved correct.

Cite

CITATION STYLE

APA

Coppo, M., & Giannini, P. (1992). A complete type inference algorithm for simple intersection types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 581 LNCS, pp. 102–123). Springer Verlag. https://doi.org/10.1007/3-540-55251-0_6

A complete type inference algorithm for simple intersection types

Abstract

Cite

Register to see more suggestions