68 search results - page 3 / 14 » Strong Normalization with Singleton Types |
TLCA
2007
Springer
14 years 10 days ago
2007
Springer
e type system for the lmdElulus enrihed with reurE sive nd oreursive funtions over equiEindutive nd Eoindutive types is presented in whih ll wel...
TIC
1998
Springer
13 years 10 months ago
1998
Springer
HOA
1993
13 years 10 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
LICS
2007
IEEE
14 years 16 days ago
2007
IEEE
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
RTA
2007
Springer
14 years 11 days ago
2007
Springer
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...