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
h =
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-scoped
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 last (l n) +
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
deal
On 29 August 2012 15:21, Joachim Breitner breit...@kit.edu 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
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
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 travi...@cs.wisc.edu
I uploaded a package implementing persistent vectors using array
mapped tries (based on the implementation
On Wed, Aug 29, 2012 at 10:13 AM, Alberto G. Corona agocor...@gmail.com 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
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
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
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 and it worked!
So, did you expect the result to be different, or did
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
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.
*
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
14 matches
Mail list logo
