I would very much appreciate if you can expand on this: Haskell's laziness doesn't help -- in fact, to avoid running out of > memory, we'd have to defeat that memoization by sprinkling "() ->" > throughout the types. >
Would it be possible to explain this with an example? Thanks Daryoush On Wed, Feb 23, 2011 at 7:52 AM, Chung-chieh Shan <ccs...@cs.rutgers.edu>wrote: > Hello! Thank you for your interest. > > Daryoush Mehrtash <dmehrt...@gmail.com> wrote in haskell-cafe: > > Is the "Embedded domain-specific language HANSEI for probabilistic models > > and (nested) inference" described in: > > http://okmij.org/ftp/kakuritu/index.html#implementation available in > > Haskell? > > The closest to that I know of is this one: > http://d.hatena.ne.jp/rst76/20100706 > https://github.com/rst76/probability > > Or you can apply this monad transformer to a probability monad: > http://sebfisch.github.com/explicit-sharing/ > > > Is there a reason why the author did the package in Ocaml > > rather than Haskell? > > Mostly we preferred (as do the domain experts we target) to write > probabilistic models in direct style rather than monadic style. > Haskell's laziness doesn't help -- in fact, to avoid running out of > memory, we'd have to defeat that memoization by sprinkling "() ->" > throughout the types. > > -- > Edit this signature at http://www.digitas.harvard.edu/cgi-bin/ken/sig > 1st <http://www.digitas.harvard.edu/cgi-bin/ken/sig1st> graffitiist: > QUESTION AUTHORITY! > 2nd graffitiist: Why? > > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe@haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe >
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
