id: 01638660
dt: a
an: 01638660
au: Kounalis, E.; Lugiez, D.
ti: Compilation of pattern matching with associative-commutative functions.
so: Abramsky, S. (ed.) et al., TAPSOFT ’91. Proceedings of the international
    joint conference on theory and practice of software development,
    Brighton, GB, April 8-12, 1991. Vol. 1: Colloquium on trees in algebra
    and programming (CAAP ’91). Berlin: Springer-Verlag. Lect. Notes
    Comput. Sci. 493, 57-73 (1991).
py: 1991
pu: Berlin: Springer-Verlag
la: EN
cc: 
ut: 
ci: 
li: 
ab: Summary: We discuss the problem of compiling pattern-matching of
    associative-commutative function definitions in a functional-like
    language where the evaluation is performed by head-rewriting. We
    propose an effective algorithm (i.e., one which does not rely on some
    unknown procedure for computing complements of terms modulo AC-axioms)
    to compile the pattern-matching process. For this purpose, we introduce
    the concept of pattern trees. We also get for free a test of the
    completeness of such definitions (with respect to head-rewriting),
    provided some linearity condition is met. Our method will ensure an
    efficient pattern-matching process at evaluation time.
rv: