Orthogonality (term rewriting)

Orthogonality as a property of term rewriting systems (TRSs) describes where the reduction rules of the system are all left-linear, that is each variable occurs only once on the left hand side of each reduction rule, and there is no overlap between them, i.e. the TRS has no critical pairs. For example $D(x,x)\to E$ is not left-linear.[1]

Orthogonal TRSs have the consequent property that all reducible expressions (redexes) within a term are completely disjoint -- that is, the redexes share no common function symbol.

For example, the TRS with reduction rules

{\begin{array}{lrcl}\rho _{1}:\ &f(x,y)&\rightarrow &g(y)\\\rho _{2}:\ &h(y)&\rightarrow &f(g(y),y)\end{array}}

is orthogonal -- it is easy to observe that each reduction rule is left-linear, and the left hand side of each reduction rule shares no function symbol in common, so there is no overlap.

Orthogonal TRSs are confluent.

Weak orthogonality

A TRS is weakly orthogonal if it is left-linear and contains only trivial critical pairs, i.e. if $(t,s)$ is a critical pair then $t=s$ .[1] Weakly orthogonal TRSs are confluent.[2]

A TRS is almost orthogonal if it is weakly orthogonal and has the additional property that overlap between redex occurrences occurs only at the root of the redex occurrences.[3]

References

Klop, J. W. "Term Rewriting Systems" (PDF). Papers by Nachum Dershowitz and students. Tel Aviv University. p. 69. Retrieved 14 August 2021.
Terese (20 March 2003). Term Rewriting Systems. Cambridge University Press. p. 140. ISBN 978-0-521-39115-3.
Raamsdonk, Femke van (2 April 1997). "Outermost-Fair Rewriting". Proceedings of the Third International Conference on Typed Lambda Calculi and Applications. Springer-Verlag: 284–299. CiteSeerX 10.1.1.36.8258.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[Klop-1] Klop, J. W. "Term Rewriting Systems" (PDF). Papers by Nachum Dershowitz and students. Tel Aviv University. p. 69. Retrieved 14 August 2021.

[2] Terese (20 March 2003). Term Rewriting Systems. Cambridge University Press. p. 140. ISBN 978-0-521-39115-3.

[3] Raamsdonk, Femke van (2 April 1997). "Outermost-Fair Rewriting". Proceedings of the Third International Conference on Typed Lambda Calculi and Applications. Springer-Verlag: 284–299. CiteSeerX 10.1.1.36.8258.