6274 search results - page 251 / 1255 » Proofs, Programs, Processes |
193
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
153
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
154
click to vote
ENTCS
2008
15 years 6 months ago
2008
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
177
click to vote
ENTCS
2008
15 years 6 months ago
2008
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
163
click to vote
MSCS
2006
15 years 6 months ago
2006
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...