13383 search results - page 70 / 2677 » Abstractions from proofs |
104
click to vote
CCA
2009
Springer
15 years 11 months ago
2009
Springer
We extract a quantitative variant of uniqueness from the usual hypotheses of the implicit functions theorem. This leads not only to an a priori proof of continuity, but also to an ...
120
Voted
TAPSOFT
1997
Springer
15 years 9 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
162
click to vote
CORR
2012
Springer
14 years 20 days ago
2012
Springer
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...
128
click to vote
ICFP
1999
ACM
15 years 9 months ago
1999
ACM
Programs are often structured around the idea that different pieces of code comprise distinct principals, each with a view of its environment. Typical examples include the module...
138
click to vote
CAV
1998
Springer
15 years 9 months ago
1998
Springer
We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction funct...