Compiling pattern matching by term decomposition
Laurence Puel, Ascánder Suárez · 1990
We present a method for compiling pattern matching on lazy languages based on previous work of Huet and Lévy and, later on, Laville by 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 on strict languages giving a match algorithm with no useless work when such a match exists.