Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
435347 | Theoretical Computer Science | 2011 | 6 Pages |
Abstract
An auxiliary notion of reduction ρ on the λ-terms preserves strong normalisation if all strongly normalising terms for β are also strongly normalising for β∪ρ. We give a sufficient condition for ρ to preserve strong normalisation. As an example of application, we check easily the sufficient condition for Regnier’s σ-reduction rules and the “assoc”-reduction rule inspired by calculi with let-expressions. This gives the simplest proof so far that the union of all these rules preserves strong normalisation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics