Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
ACL2
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Overview== The ACL2 programming language is an [[applicative programming language|applicative]] ([[Side-effect (computer science)|side-effect]] free) variant of Common Lisp. ACL2 is untyped. All ACL2 [[Subroutine|functions]] are [[Total function|total]] — that is, every function maps each object in the ACL2 [[Universe (mathematics)|universe]] to another object in its universe. ACL2's base theory [[axiom]]atizes 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 [[Consistency proof|logical consistency]]. The core of ACL2's theorem prover is based on [[term rewriting]], and this core is extensible in that user-discovered [[theorem]]s can be used as ad hoc [[Mathematical proof|proof]] techniques for subsequent [[conjecture]]s. ACL2 is intended to be an "industrial strength" version of the Boyer–Moore theorem prover, [[Nqthm|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 [[Compiler|compiled]] and run [[native code|natively]]. In 2005, the authors of the Boyer-Moore family of provers, which includes ACL2, received the [[ACM Software System Award]] "for pioneering and engineering a most effective theorem prover (...) as a formal methods tool for verifying safety-critical hardware and software."<ref>{{Cite web|url=http://campus.acm.org/public/pressroom/press_releases/3_2006/software.cfm|title=ACM: Press Release, March 15, 2006|date=August 1, 2008|archive-url=https://web.archive.org/web/20080801092315/http://campus.acm.org/public/pressroom/press_releases/3_2006/software.cfm |archive-date=2008-08-01 }}</ref><ref name=acmaward>{{cite web|publisher=[[Association for Computing Machinery]] |url=http://awards.acm.org/homepage.cfm?srt=all&awd=149 |work=ACM Awards |title=Software System Award |access-date={{Format date|2012|1|14}} |url-status=dead |archive-url=https://web.archive.org/web/20120402203501/http://awards.acm.org/homepage.cfm?srt=all&awd=149 |archive-date=2012-04-02 }}</ref>
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
ACL2
(section)
Add topic