Compiling Pattern Matching by Term Decomposition

We present method for compiling pattern matching on lazy languages based on previous work by Laville, Huet and Lévy. It consists of coding ambiguous linear sets of patterns using "Term Decomposition," and producing non ambiguous sets over terms with structural constraints on variables. The method can also be applied to strict language giving a match algorithm that include only unavoidable tests when such as algorithm exists.