Andy Jost

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)
  • 1