501

Introduction to HOL: A Theorem Proving Environment for Higher Order Logic
– M J C Gordon, T F Melham
 1993

69

HOL Light: A tutorial introduction
– John Harrison
 1996

24

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

130

Edinburgh LCF: A mechanised logic of computation
– M Gordon, R Milner, C Wadsworth
 1979

538

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

93

Theorem proving in arithmetic without multiplication
– D C Cooper
 1972

852

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

87

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

102

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

43

Integrating Gandalf and HOL
– Joe Hurd
 1999

55

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

18

Program result checking: A new approach to making programs more reliable
– Manuel Blum
 1993

90

A survey of the project AUTOMATH
– N de Bruijn
 1980

697

A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
 1993

2939

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

198

Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic
– M J C Gordon, T F
 1993

21

The nuprl proof development system (version 4.2) reference manual and userâ€™s guide. Unpublished manuscript
– Paul Jackson
 1996

16

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

74

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