HOL Light

HOL Light

HOL Light is a member of the HOL theorem prover family. Likethe other members, it is a proof assistant for classical
higher order logic. Compared with other HOL systems, HOL Light isintended to have relatively simple foundations.

Logical foundations

HOL Light is based on a formulation of type theory with equalityas the only primitive concept. The primitive rules of inferenceare the following:

cfrac{qquad }{ vdash t = t}REFLreflexivity of equality
cfrac{Gamma vdash s = t qquad Delta vdash t = u} {Gamma cup Delta vdash s = u}TRANStransitivity of equality
cfrac{Gamma vdash f = g qquad Delta vdash x = y} {Gamma cup Delta vdash f(x) = g(y)}MK_COMBcongruence of equality
cfrac{Gamma vdash s = t}{Gamma vdash (lambda x. s) = (lambda x. t)}ABSabstraction of equality
cfrac{qquad}{Gamma vdash (lambda x. t) x = t}BETAconnection of abstraction and function application
cfrac{qquad }{ {p} vdash p}ASSUMEassuming p, prove p
cfrac{Gamma vdash p = q qquad Delta vdash p} {Gamma cup Delta vdash q}EQ_MPrelation of equality and deduction
cfrac{Gamma vdash p qquad Delta vdash q} {(Gamma - {q}) cup (Delta - {p}) vdash p = q}DEDUCT_ANTISYM_RULEdeduce equality from 2-way deducibility
cfrac{Gamma [x_1,ldots,x_n] vdash p [x_1,ldots,x_n] } {Gamma [t_1,ldots,t_n] vdash p [t_1,ldots,t_n] }INSTinstantiate variables in assumptions and conclusion of theorem
cfrac{Gamma [alpha_1,ldots,alpha_n] vdash p [alpha_1,ldots,alpha_n] } {Gamma [ au_1,ldots, au_n] vdash p [ au_1,ldots, au_n] }INST_TYPEinstantiate type variables in assumptions and conclusion of theorem

This formulation of type theory is very close to the one described in section II.2 of Harvtxt|Lambek|Scott|1986.

References

cite book
last = Lambek
first = J
coauthors = P. J. Scott
title = Introduction to Higher Order Categorical logic
publisher = Cambridge University Press
date = 1986

External links

* [http://www.cl.cam.ac.uk/users/jrh/hol-light/ HOL Light] .


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • HOL theorem prover family — HOL (Higher Order Logic) denotes a family of interactive theorem proving systems sharingsimilar logics and implementation strategies. Systems in this family follow the LCF approach as they are implemented as a library in some programming language …   Wikipedia

  • HOL — can refer to any of the following:* House of Lords the upper house of the Parliament of the United Kingdom of Great Britain and Northern Ireland * HOL is an abbreviation for higher order language, aka, High level programming language, such as… …   Wikipedia

  • Hol|land — or Hol|land «HOL uhnd», noun. a linen, or linen and cotton, cloth, used especially for window shades and upholstery. It is usually light brown and sometimes glazed. ╂[< Holland, formerly a province of the Netherlands, where it was first made] …   Useful english dictionary

  • hol|land — or Hol|land «HOL uhnd», noun. a linen, or linen and cotton, cloth, used especially for window shades and upholstery. It is usually light brown and sometimes glazed. ╂[< Holland, formerly a province of the Netherlands, where it was first made] …   Useful english dictionary

  • Jon Hol — Illustration from Verdens Gang, 1884. Born 1 September 1851(1851 09 01) Nord Odal Died 1941, before 16 May (aged 89) …   Wikipedia

  • Automated reasoning — is an area of computer science dedicated to understand different aspects of reasoning. The study in automated reasoning helps produce software which allows computers to reason completely, or nearly completely, automatically. Although automated… …   Wikipedia

  • Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… …   Wikipedia

  • Jordan curve theorem — Illustration of the Jordan curve theorem. The Jordan curve (drawn in black) divides the plane into an inside region (light blue) and an outside region (pink). In topology, a Jordan curve is a non self intersecting continuous loop in the plane.… …   Wikipedia

  • Twelf — is an implementation of the logical framework LF. It is used for logic programming and for the formalization of programming language theory.Introduction At its simplest, a Twelf program (called a signature ) is a collection of declarations of… …   Wikipedia

  • Demostración automática de teoremas — Saltar a navegación, búsqueda Para otros usos de este término, véase Demostración. La demostración automática de teoremas (de siglas ATP, por el término en inglés …   Wikipedia Español

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”