HOL is a system for proving theorems in Higher Order Logic. It
comes with a large variety of existing theories formalising
various parts of mathematics and theoretical computer science.

Features

  • Easy programmability
  • Sophisticated decision procedures
  • Powerful reasoning tools

Project Activity

See All Activity >

Categories

Mathematics

License

BSD License

Follow HOL theorem-proving system

HOL theorem-proving system Web Site

You Might Also Like
Make Recruiting and Onboarding Easy Icon
Make Recruiting and Onboarding Easy

Simple, easy-to-use applicant tracking and employee Onboarding system for any sized organization.

Take away the pain and hassle associated with applicant recruitment, hiring, and onboarding with ApplicantStack. Designed for HR professionals and recruiters, ApplicantStack helps streamline the recruiting and onboarding processes to improve productivity and reduce costs. ApplicantStack provides a complete toolkit that includes tools for posting, launching, and advertising jobs, assessing and managing candidates, collaborating with teams, centralizing information for quick hiring and onboarding, and more.
Rate This Project
Login To Rate This Project

User Ratings

★★★★★
★★★★
★★★
★★
0
0
0
0
1
ease 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
features 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
design 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
support 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5

User Reviews

Be the first to post a review of HOL theorem-proving system!

Additional Project Details

Operating Systems

Linux, BSD, Windows

Languages

English

Intended Audience

Science/Research, Advanced End Users, Other Audience

User Interface

Console/Terminal

Programming Language

Standard ML

Related Categories

Standard ML Mathematics Software

Registered

2001-07-20