did you see this, and the discussion around that time?
http://www.haskell.org/pipermail/haskell-prime/2012-May/003688.html
I implemented hDeleteMany without FunDeps -- and it works in Hugs (using
TypeCast -- but looks prettier in GHC with equality constraints).
I'm afraid I didn't see that
On 2/08/2012, at 5:34 PM, Jonathan Geddes wrote:
Ouch! And that's not even very deeply nested.
Imagine 4 or 5 levels deep. It really makes
Haskell feel clunky next to `a.b.c.d = val`
that you see in other languages.
I was taught that this kind of thing violates the Law of Demeter
and that an
Isn't this exactly the problem solved by all the lens packages?
Current popular ones are fclabels [0] and data-lens [1].
[0] http://hackage.haskell.org/package/fclabels
[1] http://hackage.haskell.org/package/data-lens
On Thu, Aug 2, 2012 at 7:34 AM, Jonathan Geddes
geddes.jonat...@gmail.com
On 2 Aug 2012, at 09:25, Erik Hesselink wrote:
Isn't this exactly the problem solved by all the lens packages?
Current popular ones are fclabels [0] and data-lens [1].
[0] http://hackage.haskell.org/package/fclabels
[1] http://hackage.haskell.org/package/data-lens
Not sure what all of
Ah yes - the joy of Haskell
It so easy to roll your own, rather than search to find someone else's
(better/more elegant) solution... :-)
On 2 Aug 2012, at 11:41, Erik Hesselink wrote:
On Thu, Aug 2, 2012 at 12:30 PM, Andrew Butterfield
andrew.butterfi...@scss.tcd.ie wrote:
On 2 Aug
On Thu, Aug 2, 2012 at 12:30 PM, Andrew Butterfield
andrew.butterfi...@scss.tcd.ie wrote:
On 2 Aug 2012, at 09:25, Erik Hesselink wrote:
Isn't this exactly the problem solved by all the lens packages?
Current popular ones are fclabels [0] and data-lens [1].
[0]
Thomas Schilling nomin...@googlemail.com:
You may concatenate the licenses of all the packages you are using. GHC
includes the LGPL libgmp. The license file for each package is mentioned in
the .cabal file.
If you need a version of GHC free of the LGPL, you can build GHC from source
First of all I'd like to thank everyone who participated in this
discussion! Most approaches look very promising, especially the last
is what I imagined, but were unable to write. Thanks for that,
especially.
I will try to solve my problem using these approaches and report back
once I succeed or
Richard O'Keefe Said:
Ouch! And that's not even very deeply nested.
Imagine 4 or 5 levels deep. It really makes
Haskell feel clunky next to `a.b.c.d = val`
that you see in other languages.
I was taught that this kind of thing violates the Law of Demeter
and that an object should not be
On Thu, Aug 02, 2012 at 01:50:50PM +, Amy de Buitléir wrote:
I'm developing a framework for artificial life experiments that I would like
to
make available on Hackage eventually. I've read all the guidance and
proposals I
could find for where to place packages in the hierarchy:
I'm new to Haskell, but I do like your idea.
I prefer this as a built-in feature because it will create a standard
way of doing this, making the question wich package should I use to
get mutatos? lens-foo, lens-bar, monad-lens, lens-lens-foo-bar, ...?
simply go away.
So, yes, I up-vote your idea
On 7/30/12 9:51 PM, Christian Sternagel wrote:
Thanks Wren, for the explanations (also in your previous mail)!
On 07/30/2012 01:29 PM, wren ng thornton wrote:
On 7/24/12 9:19 PM, Christian Sternagel wrote:
(x == y) = True == x = y
(x == y) = False == not (x = y)
(x == _|_) = _|_
(_|_ == y) =
On 7/30/12 5:35 PM, Henk-Jan van Tuyl wrote:
- Block creation of usernames
o ending with two or more digits
o with more than one x or q
o starting with buy
o longer than 20 characters
o with more than 4 consonants in a row
As other's've mentioned, many of these constraints impose undue burden
On Thu, Aug 2, 2012 at 9:00 AM, Jonathan Geddes
geddes.jonat...@gmail.com wrote:
Richard O'Keefe Said:
Ouch! And that's not even very deeply nested.
Imagine 4 or 5 levels deep. It really makes
Haskell feel clunky next to `a.b.c.d = val`
that you see in other languages.
I was taught that
On Thu, Aug 2, 2012 at 4:46 PM, wren ng thornton w...@freegeek.org wrote:
On 7/30/12 5:35 PM, Henk-Jan van Tuyl wrote:
- Block creation of usernames
o ending with two or more digits
o with more than one x or q
o starting with buy
o longer than 20 characters
o with more than 4 consonants
We could even have a report spam button on each page, and if enough
users click on it (for a given revision), the revision gets forwarded to a
moderator.
I think, this will be of real use, but should be used along with CAPTCHA
because then spammers may report spam for everything and anything
oleg at okmij.org writes:
I implemented hDeleteMany without FunDeps -- and it works in Hugs (using
TypeCast -- but looks prettier in GHC with equality constraints).
It is nice that hDeleteMany works on Hugs. I forgot if we tried it
back in 2004.
Thanks Oleg -- but it was only 8
I am happy to announce a new version of time-recurrence, a library of
functions for generating recurring sequences of dates:
http://hackage.haskell.org/package/time-recurrence
New in version 0.9.0 is a redesigned top layer API. Previously
recurrences were described by combining generating
18 matches
Mail list logo
