By Topic

Completeness of type assignment systems with intersection, union, and type quantifiers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yokouchi, H. ; Dept. of Comput. Sci., Gunma Univ., Japan

This paper develops type assignment systems for intersection and union types, and type quantifiers. The known system for these types is not semantically complete. We introduce a certain class of typing statements, called stable statements, which include all statements without type quantifiers, and we show that the known system is complete for stable statements if we add two axiom schemas expressing the distributive laws of intersection over union and existential quantifier, respectively. All the results are obtained in a systematic way with sequent calculi for type assignment and the cut-elimination for them

Published in:

Logic in Computer Science, 1998. Proceedings. Thirteenth Annual IEEE Symposium on

Date of Conference:

21-24 Jun 1998