344 search results - page 53 / 69 » Some Theorems We Should Prove |
POPL
2010
ACM
14 years 4 months ago
2010
ACM
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
NMR
2004
Springer
14 years 21 days ago
2004
Springer
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
Purely functional programs should run well on parallel hardware because of the absence of side effects, but it has proved hard to realise this potential in practice. Plenty of pap...
STOC
2009
ACM
14 years 2 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...