Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
