797 search results - page 11 / 160 » Eliminating Proofs from Programs |
LCC
1994
15 years 1 months ago
1994
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...
111
Voted
JAR
2008
14 years 9 months ago
2008
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
CADE
2006
Springer
15 years 9 months ago
2006
Springer
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
WADT
1999
Springer
15 years 1 months ago
1999
Springer
TYPES
1995
Springer
15 years 1 months ago
1995
Springer