Computational semantics of term rewriting systems
Algebraic methods in semantics
A sequential reduction strategy
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that
Computing in Systems Described by Equations
Computing in Systems Described by Equations
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
A Factorisation Theorem in Rewriting Theory
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
Relative Normalization in Orthogonal Expression Reduction Systems
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
A Stability Theorem in Rewriting Theory
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Uniform Normalisation beyond Orthogonality
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
On Normalisation of Infinitary Combinatory Reduction Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
On confluence of infinitary combinatory reduction systems
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reduction strategies and acyclicity
Rewriting Computation and Proof
A nonstandard standardization theorem
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
A rewrite sequence is said to be outermost-fair if every outermost redex occurrence is eventually eliminated. Outermost-fair rewriting is known to be (head-)normalising for almost orthogonal rewrite systems. We study (head-)normalisation for the larger class of weakly orthogonal rewrite systems. (Infinitary) normalisation is established and a counterexample against head-normalisation is given.