Learn More
We present an approach to rewriting in inductively sequential rewriting systems with a very distinctive feature. In the class of systems that we consider, any reducible term defines a <i>needed</i> step, a step that <i>must</i> be executed by <i>any</i> rewriting computation that produces the term's normal form. We show an implementation of rewriting(More)
The implementation of functional logic languages by means of graph 7 rewriting requires a special handling of collapsing rules. Recent advances about 8 the notion of a needed step in some constructor systems offer a new approach 9 to this problem. We present two results: a transformation of a certain class of 10 constructor-based rewrite systems that(More)
  • 1