Needed reduction and spine strategies for the lambda calculus
Information and Computation
Confluent string rewriting
Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluence by decreasing diagrams
Theoretical Computer Science
Nondeterministic extensions of untyped &lgr;-calculus
Information and Computation
Some characteristics of strong innermost normalization
Theoretical Computer Science
Efficient Longest and Infinite Reduction Paths in Untyped Lambda-Calculi
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Generalized innermost rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Orderings for innermost termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Reduction in a linear lambda-calculus with applications to operational semantics
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Reduction strategies for left-linear term rewriting systems
Processes, Terms and Cycles
Minimality in a Linear Calculus with Iteration
Electronic Notes in Theoretical Computer Science (ENTCS)
Confluence by Decreasing Diagrams
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Modularity in term rewriting revisited
Theoretical Computer Science
| Hi-index | 0.00 |
We introduce a method for establishing that a reduction strategy is normalising and minimal, or dually, that it is perpetual and maximal, in the setting of abstract rewriting. While being complete, the method allows to reduce these global properties to the verification of local diagrams. We show its usefulness both by giving uniform proofs of some known results and by establishing new ones.