117 search results - page 3 / 24 » Program Extraction from Classical Proofs |
TPHOL
2003
IEEE
14 years 27 days ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
ENTCS
2006
13 years 7 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
CADE
2006
Springer
14 years 8 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
13 years 12 months ago
1999
Springer
MPC
1995
Springer
13 years 11 months ago
1995
Springer
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...