Download List

프로젝트 설명

Higher Order Logic (HOL) is 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. An Oracle mechanism gives access to external programs such as SAT and BDD engines. HOL 4 is particularly suitable as a platform for implementing combinations of deduction, execution, and property checking.

System Requirements

System requirement is not defined
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.

2006-01-30 05:15 Back to release list
3

이 릴리스의 공동 이론 - 추가 귀납 (아마도) pathTheory에 꼬리표를 붙이는 전환 경로, 무한과 및 sortingTheory 목록 permutations 정렬합니다. 그것은 (METIS_TAC)의 지시를 사용하여 해상도와 paramodulation 및지도를 자동으로 함수 부울 벡터 데이터 형식을 정의합니다 'boolification'라는 새로운 도구를 처음으로 증명 전술 명령을 추가합니다. 대부분의 확장 기능, 버그수정, 거꾸로 비호 환성.
Tags: Major feature enhancements
This release adds theories of co-inductive (possibly infinite) labelled transition paths in pathTheory, and of sorting and list permutations in sortingTheory. It adds a new first-order proof tactic (called METIS_TAC) that uses an ordered resolution and paramodulation, and a 'boolification' tool that automatically defines functions that map data types to boolean vectors. Many extensions, bugfixes, and backwards incompatibilities.

Project Resources