117 search results - page 12 / 24 » Program Extraction from Classical Proofs |
ENTCS
2008
13 years 7 months ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
IWVF
2001
Springer
14 years 2 days ago
2001
Springer
In the framework of an evolutionary approach to machine learning, this paper presents the preliminary version of a learning system that uses Genetic Programming as a tool for autom...
CHARME
2003
Springer
14 years 26 days ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...