|
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 RT-0177
– C Cornes
- 1995
|
|
2
|
The calculus of constructions. Rapport de Recherche 530
– Thierry Coquand, G'erard Huet
- 1986
|
|
1
|
Intuitionistic Type Theory. Bibioplois
– Per Martin-Lof
- 1984
|
|
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
|
|
18
|
The HOL logic extended with quantification over type variables
– Thomas F. Melham
- 1993
|
|
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
|
|
43
|
Extracting F ! 's programs from proofs in the calculus of constructions
– C Paulin-Mohring
- 1989
|
|
27
|
A Package for Inductive Relation Definitions in HOL
– Thomas Melham
- 1992
|
|
12
|
Developing certified programs in the system Coq -- The Program tactic
– C. Parent
- 1993
|
|
11
|
Translating Dependent Type Theory into Higher Order Logic
– Bart Jacobs, Tom Melham
- 1993
|
|
82
|
Edinburgh LCF: A Mechanised Logic
– M J C Gordon, R Milner, C P Wadsworth
- 1979
|
|
49
|
Synthesis of ML programs in the system Coq
– Christine Paulin-Mohring, Benjamin Werner
- 1993
|
|
20
|
Inductive definitions: Automation and application
– J Harrison
- 1995
|
|
65
|
The Theory of LEGO - A Proof Checker for the Extended Calculus of Constructions
– Robert Pollack
- 1994
|
|
14
|
Function definition in higher-order logic
– Konrad Slind
- 1996
|
|
242
|
Programming in Martin-Löf’s Type Theory. An Introduction
– Bengt Nordström, Kent Petersson, Jan Smith
- 1990
|
