53

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

229

Formal certification of a compiler backend, or: programming a compiler with a proof assistant
– Xavier Leroy
 2006

70

HOL Light: A tutorial introduction
– John Harrison
 1996

9

Formalizing an Analytic Proof of the Prime Number Theorem
– John Harrison
 2008

502

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

261

S.: ComputerAided Reasoning: An Approach
– M Kaufmann, P Manolios, J Moore
 2000

342

Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
– John Mccarthy
 1960

326

Theorems for free!
– Philip Wadler
 1989

132

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

15

The HOL Light manual
– John Harrison
 2000

13

A mechanically verified, sound and complete theorem prover for first order logic
– Tom Ridge, James Margetson
 2005

29

Ivy: A Preprocessor And Proof Checker For FirstOrder Logic
– William Mccune, Olga Shumsky
 1999

12

Typesafe modular hashconsing
– Jeanchristophe FilliĆ¢tre, Sylvain Conchon
 2006

13

H.: An inverse of the evaluation functional for typed lambdacalculus
– U Berger, Schwichtenberg
 1991

5

A Comparative Study of Coq and HOL
– Vincent Zammit
 1997

6

Encoding the HOL Light logic
– F Wiedijk
 2007

2

a universal proof checker, http://www.lix.polytechnique.fr/dedukti
– Dedukti

3

eds.): Theorem Proving in Higher Order
– M Aagaard, J Harrison

2

et al.: The Coq proof assistant: reference manual. Rapport technique  INRIA
– B Barras, S Boutin, C Cornes, J Courant, J Filliatre, E Gimenez, H Herbelin, G Huet, C Munoz, C Murthy
 2000
