If you get the old Parsec distribution from Daan Leijen's home page
there are example parsers for Henk a small functional language and I
think Mondrian (a bit large one).
http://legacy.cs.uu.nl/daan/parsec.html
___
Haskell-Cafe mailing list
Hi Кирилл,
Here have a simplest code at
http://code.haskell.org/gtk2hs/gtk/demo/treelist/ListDemo.hs
Cheers,
-- Andy
PS:
All gtk2hs user, it's always best choose to read source code of demo
when you don't know how to fix some problem.
Demo has include in Cabal package.
Example,
Andy Stewart lazycat.mana...@gmail.com writes:
Hi Кирилл,
Here have a simplest code at
http://code.haskell.org/gtk2hs/gtk/demo/treelist/ListDemo.hs
Cheers,
-- Andy
PS:
All gtk2hs user, it's always best choose to read source code of demo
when you don't know how to fix some
Hi all,
The MIME package that can be found on hackage, uses String as input.
Would i be considered better if there would be a version based on Text, or
ByteString ?
kind regards,
Pieter
--
Pieter Laeremans pie...@laeremans.org
The future is here. It's just not evenly distributed yet. W.
I'm writing the parser for a Haskell-like language in Parsec
https://github.com/glutamate/baysig/blob/master/Baysig/Syntax/Parser.hs
The hand-written lexer and layout resolution code is in the same
directory. It has do-notation and custom infix declarations.
Tom
On Sun, Mar 20, 2011 at 5:25
On 20 March 2011 15:05, Pieter Laeremans pie...@laeremans.org wrote:
Hi all,
The MIME package that can be found on hackage, uses String as input.
Would i be considered better if there would be a version based on Text, or
ByteString ?
I think the solution to this problem is a generic
On Fri, Apr 30, 2010 at 12:02 PM, Gwern Branwen gwe...@gmail.com wrote:
On Fri, Apr 30, 2010 at 11:51 AM, Jesper Louis Andersen
jesper.louis.ander...@gmail.com wrote:
On Fri, Apr 30, 2010 at 5:38 PM, Gwern Branwen gwe...@gmail.com wrote:
Nothing in http://develop.github.com/ seems especially
You might consider looking at mime-mail[1] instead, which uses a
combination of String and ByteString as appropriate. I will likely
change it to use Text in place of String in the not-too-distant
future.
Michael
[1] http://hackage.haskell.org/package/mime-mail
On Sun, Mar 20, 2011 at 4:05 PM,
Oh. I have taken a wrong approach to the problem.
I have written Newton method with cutting precision if it's more than
N digits, and it finds an answer practically in no time. But still,
it's very good, thank you!
___
Haskell-Cafe mailing list
-- unix-bytestring 0.3.2
The unix-bytestring package offers a full selection of
Unix/Posix-specific functions for reading and writing ByteStrings to Fds.
--
If your function has nice derivatives, you may want to look at the Newton
implementation in
http://hackage.haskell.org/packages/archive/ad/0.44.4/doc/html/Numeric-AD-Newton.html#v:findZero
http://hackage.haskell.org/packages/archive/ad/0.44.4/doc/html/Numeric-AD-Newton.html#v:findZeroor
if you
Hi cafe,
I'm looking for a library that provides an instance of Num,
Fractional, Floating, etc, but carries uncertainty values through
calculations. A scan of hackage didn't turn anything up. Does anyone
know of a library like this?
Thanks!
--
Edward Amsden
Student
Computer Science
Rochester
On Sun, 20 Mar 2011, Edward Amsden wrote:
Hi cafe,
I'm looking for a library that provides an instance of Num,
Fractional, Floating, etc, but carries uncertainty values through
calculations. A scan of hackage didn't turn anything up. Does anyone
know of a library like this?
Do you mean
I have a package for interval arithmetic in hackage
http://hackage.haskell.org/package/intervals-0.2.0
However it does not currently properly adjust the floating point rounding
mode so containment isn't perfect.
However, we are actively working on fixing up the Haskell MPFR bindings,
which will
Interval arithmetic is of course not the same as uncertainty, although
computer scientists like to pretend that is the case. (and uncertainty
estimates do not have the be rough.)
In general the propagation of errors depends on whether the errors are
independent or not. The rules are given in
I'm actually a CS undergrad in a physics lab class. I have permission
from my professor to use computer programs for analysis of lab data. I
need to do calculations on data with uncertainty, but uncertainty
analysis on many formulae in physics is rather tedious. I was hoping
for something with
so if you want to do it the quick, easy and approximately correct, why not
just use a monte-carlo monad?
say you have two values x and y, for which you know the means and
standard deviations mx, my, sdx, sdy. and you have a function f(x,y)
that expresses wheat you want to know. so then in the
I was giving Control.Arrow a try for a reactive programming system.
The arrows are agents that communicate by sending and returning
time-varying state. Different agents may live in different 'vats'
(event-driven threads) to roughly model distributed computing. For the
most part, the state varies
Hi,
I'd like to advertise three Google Summer of Code projects that I
recently added to the list [1] of proposed projects:
*** Build multiple Cabal packages in parallel ***
http://hackage.haskell.org/trac/summer-of-code/ticket/1594
Many developers have multi-core machines but Cabal runs the
19 matches
Mail list logo
