283 search results - page 33 / 57 » Functional Pearls: Probabilistic functional programming in H... |
209
click to vote
ICLP
2009
Springer
16 years 2 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
101
click to vote
FLOPS
2004
Springer
15 years 7 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
109
click to vote
APLAS
2008
ACM
15 years 3 months ago
2008
ACM
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
123
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...
103
Voted
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...