| Acl2 Theorem Prover |
Shopping Prover |
Website Links For Theorem |
Information AboutAcl2 Theorem Prover |
| CATEGORIES ABOUT ACL2 THEOREM PROVER | |
| lisp programming language | |
| theorem provers | |
| free theorem provers | |
| SHOPPER'S DELIGHT | |
|
The ACL2 programming language is an Applicative ( Side-effect free) variant of Common LISP. ACL2 is unityped. 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 . ACL2 is intended to be an "industrial strength" version of the Boyer-Moore theorem prover, NQTHM . Toward this goal, ACL2 has many features to support clean engineering of interesting mathematical and computational theories. ACL2 also derives efficiency from being built on Common LISP; for example, the same specification that is the basis for inductive verification can be Compiled and run Natively . The name ''ACL2'' comes from two instances of the abbreviation ''ACL'', which are expanded as ''A Computational Logic'' and ''Applicative Common LISP''. EXTERNAL LINK |