Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing

This paper defines reduction on derivations (cut-elimination) in the Strict Intersection Type Assignment System of an earlier paper and shows a strong normalization result for this reduction. Using this result, new proofs are given for the approximation theorem and the characterization of normalizability of terms using intersection types
Keywords intersection types   lambda calculus   termination   cut-elimination
Categories (categorize this paper)
DOI 10.1305/ndjfl/1094155278
 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: 26,178
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

10 ( #423,815 of 2,153,481 )

Recent downloads (6 months)

1 ( #399,080 of 2,153,481 )

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