A Demand Driven Computation Strategy for Lazy Narrowing

Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. This paper speci es a computation strategy for lazy conditional narrowing, based on the idea of transforming patterns into decision trees to control the computation. The speci cation is presented as a translation of CTRS into Prolog, which makes it executable and portable. Moreover, in comparison to related approaches, our method works for a wider class of CTRS.

• Type: Conference
• Year: 1993
• Where: PLILP
• Authors: Rita Loogen, Francisco Javier López-Fraguas, Mario Rodríguez-Artalejo
• Keywords: Automated Reasoning, Goal Solving Mechanism, Lazy Conditional Narrowing, PLILP 1993, Term Rewriting Systems