An equivalence between lambda-terms
Theoretical Computer Science
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
Perpetual reductions in &lgr;-calculus
Information and Computation
Addendum to ``New Notions of Reduction and Non-Semantic Proofs of Beta Strong Normalization in Typed Lambda Calculi''''
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
A short proof that adding some permutation rules to β preserves SN
Theoretical Computer Science
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Characterising Strongly Normalising Intuitionistic Terms
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 5.23 |
An auxiliary notion of reduction @r on the @l-terms preserves strong normalisation if all strongly normalising terms for @b are also strongly normalising for @b@?@r. We give a sufficient condition for @r to preserve strong normalisation. As an example of application, we check easily the sufficient condition for Regnier's @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.