Call-by-Need Reduction for Membership Conditional Term Rewriting Systems
Mizuhito Ogawa · Electronic Notes in Theoretical Computer Science · 2003
This paper proves that, for a normal membership conditional term rewriting system (MCTRS), (1) a reducible term has a needed redex if the MCTRS is nonoverlapping, and (2) whether a redex is nv-needed is decidable.