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 [1] 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 of terms, using intersection types. ”
منابع مشابه
Cut-elimination in the Strict Intersection Type Assignment System Is Strongly Normalising
This paper defines reduction on derivations in the strict intersection type assignment system of [1], 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.
متن کاملStrongly Normalising Cut-Elimination with Strict Intersection Types
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.
متن کاملCharacterizing Strongly Normalizing Terms of a Calculus with Generalized Applications via Intersection Types
An intersection type assignment system for the extension ΛJ of the untyped λ-calculus, introduced by Joachimski and Matthes, is given and proven to characterize the strongly normalizing terms of ΛJ. Since ΛJ’s generalized applications naturally allow permutative/commuting conversions, this is the first analysis of a term rewrite system with permutative conversions by help of intersection types....
متن کاملComplete Restrictions of the Intersection Type Discipline
In this paper the intersection type discipline as defined in [Barendregt et al. ’83] is studied. We will present two different and independent complete restrictions of the intersection type discipline. The first restricted system, the strict type assignment system, is presented in section two. Its major feature is the absence of the derivation rule (≤) and it is based on a set of strict types. ...
متن کاملBounding normalization time through intersection types
Intersection types were originally introduced as idempotent, i.e., modulo the equivalence σ ∧σ = σ . In fact, they have been used essentially for semantic purposes, for building filter models for λ -calculus, where the interpretation of types as properties of terms induces naturally the idempotence property. Recently it has been observed that, when dropping idempotency, intersection types can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 45 شماره
صفحات -
تاریخ انتشار 2004