Hi Milan,
Is there a way to write such a rewriting rule or there is no way of acquiring
the Ord dictionary in rewrite rule? Or does anyone know any other way
of implementing such a nub without explicitly listing all Ord instances?
Have a look at
On 02/06/2009 22:19, Axel Simon wrote:
On May 31, 2009, at 21:20, Marco Túlio Gontijo e Silva wrote:
$ ghc --make -prof glib.hs
I'm getting:
[1 of 1] Compiling Main ( glib.hs, glib.o )
Linking glib ...
/usr/lib/gtk2hs/libHSgio_p.a(File.p_o): In function `s8ds_info':
(Trying again since my previous patches were too big for the list.)
While doing a survey[1] of the extensions registered with Cabal, I
came across two warts in the list of constructors, and one constructor
that should be deprecated.
First there's the constructor called TransformListComp, which
2009/6/3 Niklas Broberg niklas.brob...@gmail.com:
First there's the constructor called TransformListComp, which should
really be named GeneralizedListComp, since the constructor should
describe the extension and not the implementation scheme.
It's called TransformListComp because the then f
This isn't necessarily correct, is it? An equality-based (n^2) nub
works fine on infinite lists, whereas any O(n log n) sort-based nub
must necessarily evaluate the entire list before being able to return
the value. The original n^2 nub also returns the elements in the order
of their first
It's called TransformListComp because the then f syntax transforms a
list using f (which has type [a] - [a]) - not because the
implementation works by transformation or anything like that! We
considered but rejected GeneralizedListComp because it's too vague -
what if someone comes up with
On Tue, Jun 2, 2009 at 5:38 AM, Duncan Coutts
duncan.cou...@worc.ox.ac.uk wrote:
OSX users,
please could you try out Gregory's Haskell Platform package below and
send commentary to the platform list, or file tickets in the platform
trac, that'd be great.
Hello,
I have written a Haskell program that runs much more efficiently
without optimisations than with optimisations.
Compiled without optimisations it finishes in about 15 seconds and
runs in constant space ( 3 MB), with optimisations (both -O and -O2)
it consumed all my RAM in less
Hello Axel.
Em Ter, 2009-06-02 às 23:19 +0200, Axel Simon escreveu:
On May 31, 2009, at 21:20, Marco Túlio Gontijo e Silva wrote:
(...)
recently there was a thread about a problem in profiling in
gtk2hs-users, and it was menitoned that this could be a GHC6 bug.
The problem is described
On Wed, 2009-06-03 at 16:33 +0100, Max Bolingbroke wrote:
2009/6/3 Niklas Broberg niklas.brob...@gmail.com:
First there's the constructor called TransformListComp, which should
really be named GeneralizedListComp, since the constructor should
describe the extension and not the
10 matches
Mail list logo
