283 search results - page 21 / 57 » Functional Pearls: Probabilistic functional programming in H... |
126
click to vote
TLCA
2009
Springer
15 years 8 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
138
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
The advent of multicore processors requires mainstream concurrent programming languages with high level concurrency constructs and effective debugging techniques. Unfortunately, m...
140
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
120
Voted
FUIN
2006
15 years 1 months ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
149
Voted
LANMR
2004
15 years 2 months ago
2004
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...