Sciweavers

2 search results - page 1 / 1
» Union of Reducibility Candidates for Orthogonal Constructor ...
Sort
View
CIE
2008
Springer
13 years 9 months ago
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
We revisit Girard's reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called eliminati...
Colin Riba
LICS
2007
IEEE
14 years 1 months ago
Strong Normalization as Safe Interaction
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...
Colin Riba