80 search results - page 3 / 16 » Program Extraction from Normalization Proofs |
WADT
1999
Springer
13 years 12 months ago
1999
Springer
TYPES
1995
Springer
13 years 11 months ago
1995
Springer
ICTAC
2004
Springer
14 years 1 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
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 ...
ENTCS
2006
13 years 7 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...