Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees

Intersection types and type constants representing unsolvability and singleton sets of λ-terms are incorporated into the Curry version of a simple type assignment system. Two restricted forms of typability in the system turn out to be equivalent to finiteness of Böhm-trees.

Authors

• Toshihiko Kurata

Keywords

No keywords are indexed for this paper.