3228 search results - page 205 / 646 » Computationally Sound Proofs |
160
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
170
click to vote
SAC
2006
ACM
15 years 6 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
173
click to vote
ECOOP
2008
Springer
15 years 8 months ago
2008
Springer
Verification of object-oriented programs relies on object invariants which express consistency criteria of objects. The semantics of object invariants is subtle, mainly because of...
189
click to vote
LFCS
2007
Springer
16 years 22 days ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
152
click to vote
MFCS
1993
Springer
15 years 10 months ago
1993
Springer
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...