On Wed, 2005-08-24 at 00:29 +0200, Lemmih wrote:
On 8/23/05, John Meacham [EMAIL PROTECTED] wrote:
On Tue, Aug 23, 2005 at 04:10:51PM +0200, Lemmih wrote:
ghc-src 0.2.0 has been released.
ghc-src is a Haskell parser with full support for every GHC extension.
It is a refactored
On Tue, Aug 23, 2005 at 04:10:51PM +0200, Lemmih wrote: ghc-src
0.2.0 has been released. ghc-src is a Haskell parser with full support for every GHC extension. It is a refactored version of the Haskell parser used internally by
GHC and is meant as a replacement for haskell-src-exts,
Hmmm, no answer on cafe, maybe someone here with a good idea?
-- Forwarded Message --
On Thursday 25 August 2005 19:58, Udo Stenzel wrote:
[...] you'll need a type signature somewhere to help ghc resolve
the overloading of newArray and readArray, which is surprisingly
tricky
Hi Wolfgang
You may want to consider the papers by E. Moggi on Monadic computation
(1989, 1990) at http://www.disi.unige.it/person/MoggiE/publications.html
and Andrew Gordon's thesis Functional Programming and
Input/Output (Sorry, I don't have a URL).
Brett Giles
[EMAIL PROTECTED]
Wolfgang,
I thing that Eugenio Moggi was the first to combine monads from category
theory with the lambda calculus.
Check out:
Computational Lambda Calculus and Monads, Eugenio Moggi, 1988
http://www.disi.unige.it/person/MoggiE/
It's citeseer page is at:
Benjamin Franksen wrote:
On Thursday 25 August 2005 19:58, Udo Stenzel wrote:
[...] you'll need a type signature somewhere to help ghc resolve
the overloading of newArray and readArray, which is surprisingly
tricky due to the s that must not escape. This works:
compute :: Int - Int
Bugs item #1275126, was opened at 2005-08-28 14:47
Message generated for change (Comment added) made by spanne
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1275126group_id=8032
Please note that this message will contain a full copy of the comment
Bugs item #1276115, was opened at 2005-08-29 15:17
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1276115group_id=8032
Please note that this message will contain a full copy of
Bugs item #1275126, was opened at 2005-08-28 05:47
Message generated for change (Comment added) made by nobody
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1275126group_id=8032
Please note that this message will contain a full copy of the comment
Bugs item #1276246, was opened at 2005-08-29 19:48
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=1276246group_id=8032
Please note that this message will contain a full copy of
just try to compile it with
ghc -fallow-overlapping-instances -Wall --make Main.hs
or inseart sth. like this at the first line:
{-# OPTIONS -fglasgow-exts -fffi -fallow-undecidable-instances
-fallow-overlapping-instances #-}
- marc
Am Montag, 29. August 2005 05:25 schrieb Juan Carlos
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
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
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
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
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
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
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 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 ::
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, forall s
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
21 matches
Mail list logo
