Sciweavers

16 search results - page 2 / 4
» Realizability interpretation of proofs in constructive analy...
Sort
View
APAL
2010
123views more  APAL 2010»
13 years 7 months ago
Classical descriptive set theory as a refinement of effective descriptive set theory
The (effective) Suslin-Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it...
Yiannis N. Moschovakis
CAV
2006
Springer
143views Hardware» more  CAV 2006»
14 years 1 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
CIE
2006
Springer
14 years 1 months ago
Inverting Monotone Continuous Functions in Constructive Analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
FSTTCS
2005
Springer
14 years 3 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
ENTCS
2008
91views more  ENTCS 2008»
13 years 9 months ago
Implementing Real Numbers With RZ
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
Andrej Bauer, Iztok Kavkler