4757 search results - page 115 / 952 » Monads for Functional Programming |
120
Voted
CAGD
2010
15 years 2 months ago
2010
Many problems in computer aided geometric design and geometry processing are stated as least
104
click to vote
FPCA
1989
15 years 6 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
220
Voted
Book
"This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. The book is intended to be a source of pr...
124
click to vote
ASM
2003
ASM
15 years 7 months ago
2003
ASM
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
101
Voted
NIPS
2007
15 years 4 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...