|
41
|
Executing higher order logic
– Stefan Berghofer, Tobias Nipkow, Technische Universität München
- 2002
|
|
39
|
A new extraction for Coq
– Pierre Letouzey
- 2003
|
|
35
|
A formalization of the strong normalization proof for System F
– Thorsten Altenkirch
- 1993
|
|
9
|
QArith: Coq formalisation of lazy rational arithmetic
– Milad Niqui, Yves Bertot, Inria Sophia Antipolis
- 2003
|
|
7
|
Erganzung zu einer Arbeit von Hellmuth Kneser uber den Fundamentalsatz der Algebra
– M Kneser
- 1981
|
|
2
|
An Arithmetic for Non-Size-Increasing Polynomial-Time Computation
– Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
|
|
6
|
The Nuprl Proof Development System, Version 5: Reference Manual and User’s Guide
– C Kreitz
- 2002
|
|
2
|
Programmation functionnelle certifiée – L’extraction de programmes dans l’assistant Coq
– P Letouzey
- 2004
|
|
6
|
Program Extraction from Large Proof Developments
– Luíz Cruz-Filipe, Bas Spitters
- 2003
|
|
17
|
C-CoRN, the Constructive Coq Repository at Nijmegan
– Herman Geuvers, Freek Wiedijk
|
|
19
|
Constructive Real Analysis: a Type-Theoretical Formalization and Applications. Faculty of Science, Mathematics and Computer
– L Cruz-Filipe
|
|
34
|
PX: A Computational Logic
– S Hayashi, H Nakano
- 1988
|
|
6
|
Writing Constructive Proofs Yielding Efficient Extracted Programs
– Aleksey Nogin
|
|
22
|
A Constructive Proof of the Fundamental Theorem of Algebra without using the Rationals
– Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
- 2001
|
|
3
|
et al. Proof theory at work: Program development in the Minlog system
– H Benl
- 1998
|
|
22
|
Automated complexity analysis of Nuprl extracted programs
– Ralph Benzinger
- 2001
|
|
29
|
From semantics to rules: A machine assisted analysis
– Catarina Coquand
- 1999
|
|
49
|
Synthesis of ML programs in the system Coq
– Christine Paulin-Mohring, Benjamin Werner
- 1993
|
|
585
|
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
– T Nipkow, L C Paulson, M Wenzel
- 2002
|
