A mechanical proof of the Church-Rosser theorem
Journal of the ACM (JACM)
A computational logic handbook
A computational logic handbook
Handbook of logic in computer science (vol. 2)
Term rewriting and all that
Ivy: a preprocessor and proof checker for first-order logic
Computer-Aided reasoning
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
Canonical Equational Proofs
More Church-Rosser Proofs (in Isabelle/HOL)
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Common Lisp: The Language
| Hi-index | 0.00 |
We present an application of the ACL2 theorem prover to formalize and reason about rewrite systems theory. This can be seen as a first approach to apply formal methods, using ACL2, to the design of symbolic computation systems, since the notion of rewriting or simplification is ubiquitous in such systems. We concentrate here on formalization and representation aspects of abstract reduction and term rewriting systems, using the first-order, quantifier-free ACL2 logic based on Common Lisp.