1101 search results - page 105 / 221 » Forcing in proof theory |
84
Voted
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
104
Voted
CIE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
115
Voted
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
95
Voted
KR
2010
Springer
15 years 5 months ago
2010
Springer
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
109
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...