Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
Lambda-calculus, types and models
Lambda-calculus, types and models
Perpetuality and uniform normalization in orthogonal rewrite systems
Information and Computation
Theoretical Computer Science - Special issue on theories of types and proofs
Disjunctive Tautologies as Synchronisation Schemes
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Strong Normalization as Safe Interaction
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On the stability by union of reducibility candidates
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Simple saturated sets for disjunction and second-order existential quantification
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
CIC∧: type-based termination of recursive definitions in the calculus of inductive constructions
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Semi-continuous sized types and termination
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Expression reduction systems and extensions: an overview
Processes, Terms and Cycles
On the Values of Reducibility Candidates
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
| Hi-index | 0.00 |
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 elimination contexts. We apply this framework to constructor rewriting, and show that for orthogonal constructor rewriting, Girard's reducibility candidates are stable by union.