Strong Normalization and Typability with Intersection Types

A simple proof is given of the property that the set of strongly normalizing lambda terms coincides with the set of lambda terms typable in certain intersection type assignment systems
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1305/ndjfl/1040067315
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,829
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
A Classification of Intersection Type Systems.M. W. Bunder - 2002 - Journal of Symbolic Logic 67 (1):353-368.
The Emptiness Problem for Intersection Types.Pawel Urzyczyn - 1999 - Journal of Symbolic Logic 64 (3):1195-1215.
Strong Normalization for Typed Terms with Surjective Pairing.A. S. Troelstra - 1986 - Notre Dame Journal of Formal Logic 27 (4):547-550.

Monthly downloads

Added to index


Total downloads

7 ( #529,001 of 2,178,232 )

Recent downloads (6 months)

1 ( #316,504 of 2,178,232 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums