On Type Inference in the Intersection Type Discipline

Authors:
Gérard Boudol;Pascal Zimmer
Affiliations:
INRIA Sophia Antipolis, BP93, 06902 Sophia Antipolis Cedex, France;INRIA Sophia Antipolis, BP93, 06902 Sophia Antipolis Cedex, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 2

Principal type scheme and unification for intersection type discipline

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Lambda-calculus, types and models

Lambda-calculus, types and models
Intersection type assignment systems

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Domains and lambda-calculi

Domains and lambda-calculi
Une Extension de la Theorie des Types en lambda-Calcul

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
On strong normalization in the intersection type discipline

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications

Intersection types in Java

Proceedings of the 6th international symposium on Principles and practice of programming in Java
The Algebra of Expansion

Fundamenta Informaticae - Intersection Types and Related Systems ITRS

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new unification procedure for the type inference problem in the intersection type discipline. We show that unification exactly corresponds to reduction in an extended @l-calculus, where one never erases arguments that would be discarded by ordinary @b-reduction. We show that our notion of unification allows us to compute a principal typing for any strongly normalizing @l-expression.