Term rewriting theory indicates that non-linear patterns should be treated with care. For instance, a term rewriting systems with a non-linear rule will in general not have a normalizing rewrite strategy which is sequential, and nonlinear term rewriting systems are not orthogonal which means they may be nonconfluent. So Haskell's pattern matching is not precisely the same as term rewriting, but anyway. Bjorn Lisper
- non-linear patterns Peter Thiemann
- RE: non-linear patterns Brian Boutel
- Re: non-linear patterns Bjorn Lisper
- Re: non-linear patterns S.M.Kahrs
- RE: non-linear patterns Frank A. Christoph
- RE: non-linear patterns Christian Sievers
- RE: non-linear patterns Frank A. Christoph