Approximation and Normalization Results for Typeable Combinator Systems
نویسندگان
چکیده
This paper studies the relation between types and normalization in the context of Combinator Systems. It presents notions of approximants for terms, intersection type assignment, and reduction on derivations; the last will be proved to be strongly normalizable. With this result, it is proved that, for every typeable term, there exists an approximant of that term with the same type, and a characterization of the normalization behaviour of terms using their assignable types is given.
منابع مشابه
Normalization , Approximation , and Semantics for Combinator Systems ? Extended
This paper studies normalization of typeable terms and the relation between approximation semantics and filter models for Combinator Systems. We first present an intersection type assignment system and a notion of approximation, and show that for every typeable term, there exists an approximant with the same type. From this approximation result we obtain a characterization of the normalization ...
متن کاملNormalization, approximation, and semantics for combinator systems
This paper studies normalization of typeable terms and the relation between approximation semantics and filter models for Combinator Systems. It presents notions of approximants for terms, intersection type assignment, and reduction on type derivations; the last will be proved to be strongly normalizable. With this result, it is proved that every typeable term has an approximant with the same t...
متن کاملApproximation and Filter Semantics for Combinator Systems ? Extended
This paper studies the relation between approximation semantics and filter models for Combinator Systems. It presents notions of approximants for terms, intersection type assignment, and using a strong normalization result of [4], it is proved that, for every typeable term, there exists an approximant of that term with the same type. Also a characterization of the normalization behaviour of ter...
متن کاملApproximation and Normalization Results for Typeable Term Rewriting Systems
We consider an intersection type assignment system for term rewriting systems extended with application, and define a notion of (finite) approximation on terms. We then prove that for typeable rewrite systems satisfying a general scheme for recursive definitions, every typeable term has an approximant of the same type. This approximation result, and the proof technique developed to obtain it, a...
متن کاملRewrite Systems with Abstraction and β-rule: Types, Approximants and Normalization
In this paper we define and study intersection type assignment systems for first-order rewriting extended with application, λ-abstraction, and β-reduction (TRS+β). One of the main results presented is that, using a suitable notion of approximation of terms, any typeable term of a TRS+β that satisfies a general scheme for recursive definitions has an approximant of the same type. From this resul...
متن کامل