502

Introduction to HOL: A theorem proving environment for higherorder logic
– Michael J C Gordon, Thomas F Melham
 1993

70

HOL Light: A tutorial introduction
– John Harrison
 1996

132

Edinburgh LCF: A Mechanised Logic of Computation. LNCS 78
– M J C Gordon, R Milner, C P Wadsworth
 1979

53

Metatheory and Reflection in Theorem Proving: A Survey and Critique
– John Harrison
 1995

854

A formulation of the simple theory of types
– Alonzo Church
 1940

88

Edinburgh LCF: A Mechanised Logic
– M J C Gordon, R Milner, C P Wadsworth
 1979

44

Integrating Gandalf and HOL
– Joe Hurd
 1999

4

Theorem Proving with the Real Numbers. CPHC/BCS Distinguished Dissertations
– John Harrison
 1998

532

PVS: A Prototype Verification System
– S. Owre, J. M. Rushby, N. Shankar
 1992

24

Binary decision diagrams as a hol derived rule
– J Harrison
 1994

102

Metafunctions: proving them correct and using them efficiently as new proof procedures
– Robert S Boyer, J Strother Moore
 1981

17

Proof Generation in the Touchstone Theorem Prover
– George C. Necula, Peter Lee
 2000

25

Proving Equalities in a Commutative Ring Done Right in Coq
– Benjamin Gregoire, Assia Mahboubi
 2005

74

Lazy theorem proving for bounded model checking over infinite domains
– Leonardo De Moura, Harald Ruess, Maria Sorea
 2002

93

Theorem proving in arithmetic without multiplication
– D Cooper
 1972

22

Symbolic Simulation: an ACL2 Approach
– J. Strother Moore
 1998

90

A survey of the project AUTOMATH
– N de Bruijn
 1980

2927

Graphbased algorithms for Boolean function manipulation
– Randal E. Bryant
 1986

88

The Semantics of Reflected Proof
– Stuart Allen , Robert L. Constable, Douglas J. Howe, William E. Aitken
 1990
