Sciweavers

632 search results - page 39 / 127
» Proving Invariants of Functional Programs
Sort
View
125
Voted
AADEBUG
2005
Springer
15 years 2 months ago
Random testing of C calling conventions
In a C compiler, function calls are difficult to implement correctly because they must respect a platform-specific calling convention. But they are governed by a simple invariant...
Christian Lindig
106
Voted
LPAR
1999
Springer
15 years 4 months ago
A Partial Evaluation Framework for Curry Programs
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
Elvira Albert, María Alpuente, Michael Hanu...
103
Voted
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 20 days ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen
CADE
2009
Springer
16 years 1 months ago
Complexity of Fractran and Productivity
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
124
Voted
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 4 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson