Lazy narrowing: Strong completeness and eager variable elimination

Aart Middeldorp, Satoshi Okui, Tetsuo Ida
1996 Theoretical Computer Science  
Narrowing is an important method for solving unification problems in equational theories that are presented by confluent term rewriting systems. Because narrowing is a rather complicated operation, several authors studied calculi in which narrowing is replaced by more simple inference rules. In this paper we give an overview of the results that have been obtained by Middeldorp et al. $[19, 18] $ for the lazy narrowing calculus $\mathrm{L}\mathrm{N}\mathrm{C}$ .
doi:10.1016/0304-3975(96)00071-0 fatcat:csqbkmjo65eitdlfj7euhyn2gq