# Formal verification of simple equational proofs (as in Universal Algebra…)?

Is there an software package aimed at verfication of simple equational proofs?

I am hoping to avoid the usual overhead involved with First Order Logic or Higher Order Logic verification systems.

[Apologies for the 'software question', but formal verification usually involves this. :) References to papers that might point me in the right direction would of course be appreciated.]

-
The best I can come up with are search phrases: term rewriting systems, unification, and Stanley Burris. I don't know if Prof. Burris is still active, but he is the first person I would ask about your question. Gerhard "Ask Me About System Design" Paseman, 2011.07.25 – Gerhard Paseman Jul 26 '11 at 4:09