967 search results - page 1 / 194 » Probabilistic Predicative Programming |
MPC
2004
Springer
14 years 22 days ago
2004
Springer
This paper shows how probabilistic reasoning can be applied to the predicative style of programming.
B
1998
Springer
13 years 11 months ago
1998
Springer
Let predicate P be converted from Boolean to numeric type by writing P , with false being 0 and true being 1, so that in a degenerate sense P can be regarded as `the probability th...
EUROPAR
2003
Springer
14 years 18 days ago
2003
Springer
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...
JAR
2002
13 years 7 months ago
2002
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
PSSE
2004
Springer
14 years 22 days ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...