The HOL Theorem Proving System
Edit Page
Report
Scan day: 17 February 2014 UTC
30
Virus safety - good
Description: The system documented originated at the Laboratory for Applied Logic of Brigham Young University and features higher-order, classical, natural deduction with tactics.
ARMv7, λ-calculus, ACL2, Verified Lisp SMT tool integration, fixed-width integers (words) Extended Description, DPLL example, ... HOL4 is the latest version of the HOL interactive proof assistant for higher order logic: a programming environment in which theorems can be proved and proof tools implemented. Built-in decision procedures and theorem provers can automatically establish many simple theorems (users may have to prove the hard theorems themselves!) An oracle mechanism gives access to external programs such as SMT and
Size: 531 chars
Contact Information
Email:Send Message
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | HOL4 Kananaskis 9 |
| Keywords: | |
| Description: | |
| IP-address: | 216.34.181.96 |
WHOIS Info
| NS | Name Server: NS1.P03.DYNECT.NET Name Server: NS2.P03.DYNECT.NET Name Server: NS3.P03.DYNECT.NET Name Server: NS4.P03.DYNECT.NET |
| WHOIS | Status: clientTransferProhibited Status: clientUpdateProhibited |
| Date | Creation Date: 08-aug-1999 Expiration Date: 08-aug-2015 |