11345 search results - page 118 / 2269 » Foundations of Computer Science |
62
Voted
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
MFPS
1993
15 years 3 months ago
1993
All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...
FOSSACS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present the first complete soundness proof of the antiframe rule, a recently proposed proof rule for capturing information hiding in the presence of higher-order stor...
101
click to vote
DAGSTUHL
2001
15 years 22 days ago
2001
In this paper we present a recursion-theoretic denotational semantics for Featherweight Java. Our interpretation is based on a formalization of the object model of Castagna, Ghelli...
107
click to vote
COCO
2006
Springer
15 years 3 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...