602 search results - page 11 / 121 » Program Calculation in Coq |
TYPES
1995
Springer
14 years 1 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
CORR
2011
Springer
13 years 1 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...
APLAS
2005
ACM
14 years 3 months ago
2005
ACM
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and ...
SOSL
1993
14 years 2 months ago
1993
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
PPDP
2007
Springer
14 years 4 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...