Translator Disclaimer
2004 Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing
Steffen van Bakel
Notre Dame J. Formal Logic 45(1): 35-63 (2004). DOI: 10.1305/ndjfl/1094155278

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.

Citation

Download Citation

Steffen van Bakel. "Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing." Notre Dame J. Formal Logic 45 (1) 35 - 63, 2004. https://doi.org/10.1305/ndjfl/1094155278

Information

Published: 2004
First available in Project Euclid: 2 September 2004

zbMATH: 1095.03058
MathSciNet: MR2133083
Digital Object Identifier: 10.1305/ndjfl/1094155278

Subjects:
Primary: 03B15, 03F05
Secondary: 68Q55

Rights: Copyright © 2004 University of Notre Dame

JOURNAL ARTICLE
29 PAGES


SHARE
Vol.45 • No. 1 • 2004
Back to Top