Meta reasoning in ACL2

Authors:
Warren A. Hunt;Matt Kaufmann;Robert Bellarmine Krug;J Strother Moore;Eric Whitman Smith
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, TX;Department of Computer Sciences, University of Texas at Austin, Austin, TX;Department of Computer Sciences, University of Texas at Austin, Austin, TX;Department of Computer Sciences, University of Texas at Austin, Austin, TX;Department of Computer Sciences, University of Texas at Austin, Austin, TX
Venue:
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Year:
2005

Citing 3
Cited 7

Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics

An ACL2 Tutorial

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Proving a specific type of inequality theorems in ACL2: a bind-free experience report

Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Directly reflective meta-programming

Higher-Order and Symbolic Computation
Second-order programs with preconditions

Verification, induction termination analysis
Second-order programs with preconditions

Verification, induction termination analysis
Verification condition generation via theorem proving

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A tactic language for declarative proofs

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ACL2 system is based upon a first-order logic and implements traditional first-order reasoning techniques, notably (conditional) rewriting, as well as extensions including mathematical induction and a “functional instantiation” capability for mimicking second-order reasoning. Additionally, one can engage in meta-reasoning — using ACL2 to reason, and prove theorems, about ACL2's logic from within ACL2. One can then use these theorems to augment ACL2's proof engine with custom extensions. ACL2 also supports forms of meta-level control of its rewriter. Relatively recent additions of these forms of control, as well as extensions to ACL2's long-standing meta-reasoning capability, allow a greater range of rules to be written than was possible before, allowing one to specify more comprehensive proof strategies.