797 search results - page 10 / 160 » Eliminating Proofs from Programs |
PST
2008
14 years 11 months ago
2008
One of the key issues with the practical applicability of Proof-Carrying Code (PCC) and its related methods is the difficulty in communicating and storing the proofs which are inh...
EUROCAST
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, an approach to synthesize correct programs from specifications is presented. The idea is to extract code from definitions appearing in statements which have been me...
TPHOL
2003
IEEE
15 years 2 months 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
14 years 9 months ago
2006
We formalize two proofs of weak head normalization for the simply typed lambdacalculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order ...
ENTCS
2006
14 years 9 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...