3228 search results - page 271 / 646 » Computationally Sound Proofs |
130
click to vote
GI
2009
Springer
15 years 9 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
149
click to vote
ECOOPW
1999
Springer
15 years 9 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
137
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
148
click to vote
BIRTHDAY
1997
Springer
15 years 8 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
132
click to vote
STOC
1995
ACM
15 years 8 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...