Compiling Pattern Matching by Term Decomposition

AbstractWe 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

The CAML reference manual

Projet FormelRésumé disponible dans les fichiers attaché

The CAML reference manual

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 14802 F, issue : a.1990 n.121 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc