ACL2
 |
|
| Paradigm | Functional, Metaprogramming |
|---|---|
| Designed by | Robert S. Boyer, J Strother Moore and Matt Kaufmann |
| Developer | Matt Kaufmann and J Strother Moore |
| First appeared | 1990 (limited distribution), 1996 (public distribution) |
| Stable release |
7.2 / January 2016
|
| Typing discipline | dynamic |
| OS | Cross-platform |
| License | BSD 3-clause license |
| Website | www |
| Influenced by | |
| Nqthm (theorem prover), Common Lisp | |
ACL2 (A Computational Logic for Applicative Common Lisp) is a software system consisting of a programming language, an extensible theory in a first-order logic, and a mechanical theorem prover. ACL2 is designed to support automated reasoning in inductive logical theories, mostly for the purpose of software and hardware verification. The input language and implementation of ACL2 are built on Common Lisp. ACL2 is free, open source (BSD license) software.
The ACL2 programming language is an applicative (side-effect free) variant of Common Lisp. ACL2 is untyped. All ACL2 functions are total — that is, every function maps each object in the ACL2 universe to another object in its universe.
ACL2's base theory axiomatizes the semantics of its programming language and its built-in functions. User definitions in the programming language that satisfy a definitional principle extend the theory in a way that maintains the theory's logical consistency.
The core of ACL2's theorem prover is based on term rewriting, and this core is extensible in that user-discovered theorems can be used as ad-hoc proof techniques for subsequent conjectures.
...
Wikipedia