Jorge F. Salas

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We present a language for encoding semiautomatic proofs of theorems in the inductive theory generated by a system of equations oriented as rewriting rules. These proofs can be made using a rewriting induction principle with a special notion of cover set. The proofs can include simple or conditional rewriting steps using auxiliary lemmas and case analysis(More)
  • 1