16190 search results - page 442 / 3238 » Applicative programming with effects |
152
click to vote
IANDC
2006
15 years 6 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
180
click to vote
SYRCODIS
2007
15 years 7 months ago
2007
Effective querying and managing of temporal databases represent an unanswered challenge to the modern research community. In this paper, we introduce a temporal preprocessor that ...
143
click to vote
COMBINATORICA
2000
15 years 5 months ago
2000
Suppose t1, ..., tn are independent random variables which take value either 0 or 1, and Y is a multi-variable polynomial in ti's with positive coefficients. We give a conditi...
177
click to vote
SIGSOFT
2006
ACM
16 years 6 months ago
2006
ACM
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
172
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...