Ralf,
> Thanks for the challenge.
Wow, thanks for taking an interest. I'm sorry for my slow response,
I've been sick.
Ah, I haven't seen your SYB3 yet, I will have to take some time to
read it.
As for your code example, it looks very interesting, but are you
saying that this could turn into an
Benjamin Franksen wrote:
> > append :: (IArray UArray e, MArray (STUArray s) e (ST s)) => ...
I believe there must be an MArray instance for every s for this to work.
If I understand types correctly (which isn't all that certain), the
correct context would be
> > append :: (IArray UArray e, foral
On Mon, 2005-08-29 at 16:59 -0400, Mark Goldman wrote:
> I have looked around the net, and in some reference books and I cannot
> find a function to convert a Float to a Double directly. Can there
> truly be no such animal in the Prelude/standard libs?
In the Prelude there is
realToFrac :: (Frac
I have looked around the net, and in some reference books and I cannot
find a function to convert a Float to a Double directly. Can
there truly be no such animal in the Prelude/standard libs?
-mdg
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On pondělí 29 srpna 2005 8:57, Ketil Malde wrote:
> > It contains descriptions of lots of real-world problems and how
>
> They are only implementing TRUTH and CWB, no?
Yes, and lots of real-world situations that they faced during the development.
That's what I meant.
> I would like to see more d
See also Jeremy Bobbio's fuse bindings here:
http://cvs.haskell.org/darcs/hfuse/
I've been using them on the Halfs, the Haskell Filesystem that I'll be
demoing at the Haskell Workshop.
David Roundy <[EMAIL PROTECTED]> writes:
(snip)
> The FuseIO module itself might be rather interesting for ot
Well, I know I cannot calculate exact time statistics, but I cen get
information about the aproximate behavior - like the algorithm
is Theta(n), Theta(n*log(n)), etc. It's quite sufficient, I think.
According to your example - I don' know what you want to show,
both algorithms are linear in time
Hello Dusan,
Monday, August 29, 2005, 9:55:56 AM, you wrote:
>Nevertheless, for the other algorithm the expected time complexity (
>quite well known in general :-) ) and measured values do no fit together.
number of reductions is not exact time statistics. try the following
alternative length
Frederik,
Thanks for the challenge.
I didn't get some of the bits about your application scenario though.
(What did you mean by the type Pred? Why a list in the result of solve?
How did you model typed logical variables? With GADTs, phantoms? ...
Perhaps send more code, if you want to discuss thi
Martin Vlk <[EMAIL PROTECTED]> writes:
> http://www-i2.informatik.rwth-aachen.de/Staff/Current/michaelw/sttt-ml-haskell.pdf
Interesting to see others' experiences, even if they are slightly
negative.
> It contains descriptions of lots of real-world problems and how
They are only implementing T
10 matches
Mail list logo