12 search results - page 1 / 3 » On the Stability by Union of Reducibility Candidates |
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
CIE
2008
Springer
14 years 11 months ago
2008
Springer
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...
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
AUTOMATICA
2002
14 years 9 months ago
2002
The subject of this paper is hybrid control of nonlinear systems with large-scale uncertainty. We describe a high-level controller, called a "supervisor", which orchestr...
77
Voted
LICS
2007
IEEE
15 years 3 months 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...