Strongly normalising cut-elimination with strict intersection types

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Abstract

This paper defines reduction on derivations in the strict intersection type assignment system of [2] by generalising cut-elimination, and shows a strong normalisation result for this reduction. Using this result, new proofs are given for the approximation theorem and the characterisation of normalisability using intersection types. © 2003 Published by Elsevier Science B.V.

Cite

CITATION STYLE

APA

Van Bakel, S. (2003). Strongly normalising cut-elimination with strict intersection types. In Electronic Notes in Theoretical Computer Science (Vol. 70, pp. 21–38). https://doi.org/10.1016/S1571-0661(04)80488-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free