Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Efficient tree pattern unification

    The problem of many-to-one unification, i.e. a simultaneous weak unification of pattern terms against all subterms of a target term, is studied for linear terms. Two algorithms proposed in [10] generalize eith...

    Peter Ružička in SOFSEM'96: Theory and Practice of Informatics (1996)