Sciweavers

9595 search results - page 263 / 1919
» Functional programming in C
Sort
View
FPCA
1989
15 years 10 months ago
Automatic Complexity Analysis
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...
Mads Rosendahl

Book
296views
17 years 4 months ago
Implementing Functional Languages: a tutorial
"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...
Simon Peyton Jones, David Lester
ASM
2003
ASM
15 years 11 months ago
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes
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...
Egon Börger, Tommaso Bolognesi
NIPS
2007
15 years 8 months ago
Random Sampling of States in Dynamic Programming
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...
Christopher G. Atkeson, Benjamin Stephens
POPL
2009
ACM
16 years 1 months ago
Declarative aspects of memory management in the concurrent collections parallel programming model
Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level comput...
Zoran Budimlic, Aparna Chandramowlishwaran, Kathle...