Sciweavers

4743 search results - page 272 / 949
» Introduction to Functional Programming
Sort
View
HASKELL
2006
ACM
16 years 17 days ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
LOPSTR
2001
Springer
15 years 11 months ago
On Deforesting Parameters of Accumulating Maps
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
Kazuhiko Kakehi, Robert Glück, Yoshihiko Futa...
ICML
2005
IEEE
16 years 7 months ago
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
H. Brendan McMahan, Maxim Likhachev, Geoffrey J. G...
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
16 years 1 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
IPPS
2007
IEEE
16 years 27 days ago
Coordinating Data Parallel SAC Programs with S-Net
We propose a two-layered approach for exploiting different forms of concurrency in complex systems: We specify computational components in our functional array language SaC, whic...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...