7

Automatically synthesized term denotation predicates: A proof aid
– Paul E. Black
 1995

8

et al. The Coq proof assistant reference manual, version 5.10. Rapport technique RT0177
– C Cornes
 1995

1

A HOL package for reasoning about relations defined by mutual induction
– R E O Roxas
 1993

1

A proof of the S m n theorem in Coq
– Vincent Zammit
 1997

2

Extracting text from proofs. Rapport de recherche n.2459
– Yann Coscoy, Gilles Kahn, Laurent Th'ery
 1995

19

Using Recursive Types to Reason about Hardware in Higher Order Logic
– Thomas Melham
 1988

12

Developing certified programs in the system Coq  The Program tactic
– C. Parent
 1993

3

The calculus of constructions. Rapport de Recherche 530
– Thierry Coquand, G'erard Huet
 1986

11

Translating Dependent Type Theory into Higher Order Logic
– Bart Jacobs, Tom Melham
 1993

44

Extracting F! programs from proofs in the calculus of constructions
– Christine PaulinMohring
 1989

2

Intuitionistic Type Theory. Bibioplois
– Per MartinLof
 1984

28

A Package for Inductive Relation Definitions in HOL
– Thomas Melham
 1992

22

Inductive definitions: automation and application
– J Harrison
 1995

68

The Theory of LEGO  A Proof Checker for the Extended Calculus of Constructions
– Robert Pollack
 1994

19

The HOL logic extended with quantification over type variables
– Thomas F. Melham
 1993

96

Type Theory and Functional Programming
– Simon Thompson, C Simon Thompson
 1991

42

Reasoning with inductively defined relations in the HOL theorem prover
– Juanito Camilleri, Tom Melham
 1992

88

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

53

Synthesis of ML programs in the system Coq
– C PaulinMohring, B Werner
 1993
