Now showing items 1-2 of 2
Formal proofs about rewriting using ACL2 [Article]
We present an application of the ACL2 theorem prover to reason about rewrite systems theory. We describe the formalization and representation aspects of our work using the firstorder, quantifier-free logic of ACL2 and ...
Proof Pearl: a Formal Proof of Higman’s Lemma in ACL2 [Article]
Higman’s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman’s Lemma in the ACL2 theorem prover. ...