#### Filter Results:

- Full text PDF available (120)

#### Publication Year

1964

2017

- This year (5)
- Last 5 years (60)
- Last 10 years (130)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Key Phrases

#### Method

#### Organism

Learn More

- John D Harrison
- FMCAD
- 1996

HOL Light is a new version of the HOL theorem prover. While retaining the reliability and programmability of earlier versions, it is more elegant, lightweight, powerful and automatic; it will be the basis for the Cambridge component of the HOL-2000 initiative to develop the next generation of HOL theorem provers. HOL Light is written in CAML Light, and so… (More)

- John D Harrison
- CPHC/BCS distinguished dissertations
- 1998

This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the veri cation of oating point hardware and hybrid systems. It also allows the… (More)

- John D Harrison, Laurent Théry
- Journal of Automated Reasoning
- 1998

We contrast theorem provers and computer algebra systems, pointing out the advantages and disadvantages of each, and suggest a simple way to achieve a synthesis of some of the best features of both. Our method is based on the systematic separation of search for a solution and checking the solution, using a physical connection between systems. We describe… (More)

- John D Harrison
- Formal Methods in System Design
- 1997

Since they often embody compact but mathematically sophisticated algorithms , operations for computing the common transcendental functions in oating point arithmetic seem good targets for formal veriication using a mechanical theorem prover. We discuss some of the general issues that arise in veriications of this class, and then present a machine-checked… (More)

- John D Harrison
- TPHOLs
- 2009

HOL Light is an interactive proof assistant for classical higherorder logic, intended as a clean and simplified version of Mike Gordon’s original HOL system. Theorem provers in this family use a version of ML as both the implementation and interaction language; in HOL Light’s case this is Objective CAML (OCaml). Thanks to its adherence to the so-called ‘LCF… (More)

- John D Harrison
- TPHOLs
- 1996

The HOL theorem prover is implemented in the LCF manner. All inference is ultimately reduced to a collection of very simple (forward) primitive inference rules, but by programming it is possible to build alternative means of proving theorems on top, while preserving security. Existing HOL proofs styles are, however, very different from those used in… (More)

- John D Harrison
- 2009

John Harrison’s Handbook of Practical Logic and Automated Reasoning strongly reminds me of Donald Knuth’s The Art of Computer Programming. Both clearly are masterpieces. And both scare me. They are so comprehensive, so erudite, and the information density is so high, that one really has to pay attention to get the most from the exposition. Also, both are a… (More)

- Sean McLaughlin, John D Harrison
- CADE
- 2005

We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing implementation of such an algorithm. While many problems within the domain are intractable, we demonstrate convincing examples of its value in interactive theorem proving. 1… (More)

- John D Harrison
- Journal of Automated Reasoning
- 2012

We describe the library of theorems about N-dimensional Euclidean space that has been formalized in the HOL Light prover. This formalization was started in 2005 and has been extensively developed since then, partly in direct support of the Flyspeck project, partly out of a general desire to develop a well-rounded and comprehensive theory of basic… (More)

- John D Harrison
- IJCAR
- 2006

The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would like to formally verify (i) that the abstract HOL logic is indeed correct, and (ii) that the OCaml code does correctly implement this logic. We have performed a full verification… (More)