On 30 August 2012 15:26, Bryan O'Sullivan wrote:
> The reasons for these problems fall into three bins:
>
> Prelude no longer exports catch, so a lot of "import Prelude hiding (catch)"
> had to change.
It looks like this might be fixed before the release:
http://hackage.haskell.org/trac/ghc/ticke
On Aug 29, 2012 10:56 PM, "Henk-Jan van Tuyl" wrote:
>
> On Wed, 29 Aug 2012 23:10:24 +0200, Stefan Monnier <
monn...@iro.umontreal.ca> wrote:
>
>>> Albert Einstein said:
>>> Insanity: doing the same thing over and over again and expecting
>>> different results.
>>> I repeated the command today
Interesting data point. I think my initial thoughts can be summarized with
the suggestion that this thread would be better served by a little irony
and a new subject: "Reuse Considered Harmful".
On Thu, Aug 30, 2012 at 1:26 AM, Bryan O'Sullivan wrote:
> Since the release of the GHC 7.6 RC, I've
Since the release of the GHC 7.6 RC, I've been going through my packages
and fixing up build problems so that people who upgrade to 7.6 will have a
smooth ride.
Sad to say, my experience of 7.6 is that it has felt like a particularly
rough release for backwards incompatibility. I wanted to quantif
Welcome to issue 242 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers the
week of August 19 to 25, 2012.
Quotes of the Week
* srhb: I think that's going into space rather than diving into the
deep end.
* edwardk
Le 29/08/2012 23:55, Henk-Jan van Tuyl a écrit :
In conclusion: repeating the same thing could give different results.
Certainly!
My favourite example is : sex.
Jerzy Karczmarczuk
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.
On Wed, 29 Aug 2012 23:10:24 +0200, Stefan Monnier
wrote:
Albert Einstein said:
Insanity: doing the same thing over and over again and expecting
different results.
I repeated the command today and it worked!
So, did you expect the result to be different, or did you re-try just to
confirm
> Albert Einstein said:
> Insanity: doing the same thing over and over again and expecting
> different results.
> I repeated the command today and it worked!
So, did you expect the result to be different, or did you re-try just to
confirm that it doesn't work?
Stefan
Sorry, persistent as in purely functional. Updates to one vector
don't affect others. I guess the distinction isn't as useful in
Haskell as it is in other languages since it is the default.
On Wed, Aug 29, 2012 at 07:13:38PM +0200, Alberto G. Corona wrote:
> Where the "persistent" part of the n
On Wed, Aug 29, 2012 at 10:13 AM, Alberto G. Corona wrote:
> Where the "persistent" part of the name comes from?. It can be
> serialized/deserialized from a persistent storage automatically or on
> demand?
Persistent have two meanings unfortunately. In functional programming
it's used to mean tha
Where the "persistent" part of the name comes from?. It can be
serialized/deserialized from a persistent storage automatically or on
demand?
2012/8/29 Tristan Ravitch
> I uploaded a package implementing persistent vectors using array
> mapped tries (based on the implementation in clojure). Vers
I uploaded a package implementing persistent vectors using array
mapped tries (based on the implementation in clojure). Version
0.1.0.0 was broken, so I am starting off with 0.1.0.1.
http://hackage.haskell.org/package/persistent-vector
Persistent vectors are a sequence container offering effic
On 29 August 2012 15:21, Joachim Breitner wrote:
> Hi Facundo,
>
> Am Mittwoch, den 29.08.2012, 10:26 -0300 schrieb Facundo Domínguez:
> > > upd_noupd n =
> > > let l = myenum' 0 n
> > > in last l + length l
> >
> > This could be rewritten as
> >
> > > upd_
And of course the biggest reason for this change, is we want GHC to continue
to become "smarter". Remember, Haskell is a high level language. The
original promise, is that the code should be algebraically optimizable by
the compiler itself. Yes, of course many Haskell coders have learned to
dea
Hi Facundo,
Am Mittwoch, den 29.08.2012, 10:26 -0300 schrieb Facundo Domínguez:
> > upd_noupd n =
> > let l = myenum' 0 n
> > in last l + length l
>
> This could be rewritten as
>
> > upd_noupd n =
> > let l n = myenum' 0 n
> > in l
Hi,
> upd_noupd n =
> let l = myenum' 0 n
> in last l + length l
This could be rewritten as
> upd_noupd n =
> let l n = myenum' 0 n
> in last (l n) + length (l n)
Or a special form of let could be introduced to define locally-scope
Hi,
Am Dienstag, den 28.08.2012, 18:16 -0400 schrieb Carter Schonwald:
> On Tuesday, August 28, 2012, Yves Parès wrote:
> Monad? Simple strictness anotation is enough in that case:
>
> upd_noupd n =
> let l = myenum' 0 n
>
17 matches
Mail list logo
