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

Abstract
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)
Options
 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
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,819
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Similar books and articles
Gilles Dowek & Benjamin Werner (2003). Proof Normalization Modulo. Journal of Symbolic Logic 68 (4):1289-1316.
Stefan Hetzl (2012). The Computational Content of Arithmetical Proofs. Notre Dame Journal of Formal Logic 53 (3):289-296.
Carlo Cellucci (2000). Analytic Cut Trees. Logic Journal of the Igpl 8:733-750.
Analytics

Monthly downloads

Sorry, there are not enough data points to plot this chart.

Added to index

2010-08-24

Total downloads

1 ( #453,748 of 1,099,914 )

Recent downloads (6 months)

0

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.