Recently I received an email with a question regarding the licensing
of a module I've written and uploaded to Hackage. I released it under
LGPL. The sender wondered if I would consider re-licensing the code
under BSD (or something similar) that would remove the need for users
to provide linkable
Magnus Therning [EMAIL PROTECTED] wrote:
I released it under
LGPL. The sender wondered if I would consider re-licensing the code
under BSD (or something similar) that would remove the need for users
to provide linkable object files so that users can re-link programs
against newer/modified
On Fri, Sep 26, 2008 at 8:59 AM, Achim Schneider [EMAIL PROTECTED] wrote:
[..]
Concerning Haskell, just tell them to use the ghc-lib and link (or even
compile) at runtime.
ghc-lib, never heard of it, where can I find out more?
/M
--
Magnus Therning(OpenPGP:
Now I have fairly strong feelings about freedom of code and I
everything I release is either under GPL or LGPL. What I like about
those licenses is it protects freedom in a way that I think it should
and it forces a sort of reciprocity which resonates very well with my
selfishness. Re-licensing
Thomas Davie [EMAIL PROTECTED] wrote:
I've seen this cause problems even in environments where there's no
commercial gain to be had. Take for example the zfs file system.
Sun have been kind enough to completely open source it.
Unfortunately, linux users can never hope for stable version
Magnus Therning [EMAIL PROTECTED] wrote:
On Fri, Sep 26, 2008 at 8:59 AM, Achim Schneider [EMAIL PROTECTED]
wrote: [..]
Concerning Haskell, just tell them to use the ghc-lib and link (or
even compile) at runtime.
ghc-lib, never heard of it, where can I find out more?
Thomas == Thomas Davie [EMAIL PROTECTED] writes:
Thomas Sorry, this isn't the most relevant comment to the
Thomas discussion, but I thought I'd add my own thought re the
Thomas gpl/lgpl. My personal feeling is that the point of open
Thomas source is to allow people the freedom
On Fri, Sep 26, 2008 at 9:12 AM, Thomas Davie [EMAIL PROTECTED] wrote:
Now I have fairly strong feelings about freedom of code and I
everything I release is either under GPL or LGPL. What I like about
those licenses is it protects freedom in a way that I think it should
and it forces a sort
Thomas Davie [EMAIL PROTECTED] wrote:
That's my 2p's worth on why I use the BSD license over the GPL. In
short, the GPL does not promote freedom, it promotes restrictions,
just not the restrictions we've grown to hate from most companies.
Btw: The BSD license is GPL-compatible, it's the
On Fri, Sep 26, 2008 at 9:32 AM, Achim Schneider [EMAIL PROTECTED] wrote:
Magnus Therning [EMAIL PROTECTED] wrote:
On Fri, Sep 26, 2008 at 8:59 AM, Achim Schneider [EMAIL PROTECTED]
wrote: [..]
Concerning Haskell, just tell them to use the ghc-lib and link (or
even compile) at runtime.
% cabal update
Downloading package list from server
'http://hackage.haskell.org/packages/archive'
% cabal install pureMD5
All requested packages already installed. Nothing to do.
% cabal install pureMD5-0.2.4
Downloading 'pureMD5-0.2.4'...
[...]
Well, I might be spoiled by portage but shouldn't
Thanks!
E.
David Menendez wrote:
On Thu, Sep 25, 2008 at 1:15 PM, Eric [EMAIL PROTECTED] wrote:
Dear all,
I've written a function with the following type:
build :: Bifunctor s = (forall b. (s a b - b) - b) - Fix s a
When I try to compile I get the following error:
Illegal
apfelmus wrote:
data Stack2 r b = Empty | S [r] (Stack2 b r) deriving (Eq, Show)
In the previous post, I considered an implementation of red-blue stacks
with the data type above. Unfortunately, it failed to perform in O(1)
time because list concatenation needs linear time:
xs ++ ys takes
Colin Paul Adams ha scritto:
Thomas == Thomas Davie [EMAIL PROTECTED] writes:
Thomas Sorry, this isn't the most relevant comment to the
Thomas discussion, but I thought I'd add my own thought re the
Thomas gpl/lgpl. My personal feeling is that the point of open
Thomas source
Manlio Perillo wrote:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly injuried enemy.
Should he help the enemy?
I'm so glad I don't understand this ;-)
--
Dr. Janis Voigtlaender
http://wwwtcs.inf.tu-dresden.de/~voigt/
On 26 Sep 2008, at 12:12, Janis Voigtlaender wrote:
Manlio Perillo wrote:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly injuried enemy.
Should he help the enemy?
I'm so glad I don't understand this ;-)
Should you decide
Thomas Davie wrote:
On 26 Sep 2008, at 12:12, Janis Voigtlaender wrote:
Manlio Perillo wrote:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly injuried enemy.
Should he help the enemy?
I'm so glad I don't understand this
On Fri, Sep 26, 2008 at 11:17 AM, Thomas Davie [EMAIL PROTECTED] wrote:
Should you decide not to give someone something based on the fact that you
either don't like them, or don't like what they'll do with the thing you
give them.
That rather depends what you intend to give, doesn't it? :-)
On 26 Sep 2008, at 12:28, Dougal Stanton wrote:
On Fri, Sep 26, 2008 at 11:17 AM, Thomas Davie [EMAIL PROTECTED]
wrote:
Should you decide not to give someone something based on the fact
that you
either don't like them, or don't like what they'll do with the
thing you
give them.
That
Thomas Davie ha scritto:
[...]
Though the analogy is inapt, because the GPL *doesn't* prevent use of
software for things you don't like:
http://www.gnu.org/licenses/gpl-faq.html#NoMilitary
Sure it does -- it prevents the use of software for things that are
closed source.
What worse, is
On Fri, Sep 26, 2008 at 11:32 AM, Thomas Davie [EMAIL PROTECTED] wrote:
Sure it does -- it prevents the use of software for things that are closed
source.
Thing that are closed source is not a use of software. Programs
don't become more or less capable of designing rockets or writing
Anatoly Yakovenko wrote:
e = exp 1.0
sigmoid xx = 1.0 / (1 + (e ** (1.0 * xx)))
That 1.0 * xx caught my eye.
In case this was an oversight on your part: if you mean the usual sigmoid
function, that should be 1.0 / (1 + (e ** (0.0 - x))).
--
Joe Buehler
Manlio Perillo [EMAIL PROTECTED] wrote:
Colin Paul Adams ha scritto:
Thomas == Thomas Davie [EMAIL PROTECTED] writes:
Thomas Sorry, this isn't the most relevant comment to the
Thomas discussion, but I thought I'd add my own thought re the
Thomas gpl/lgpl. My personal
On 2008 Sep 26, at 4:49, Achim Schneider wrote:
Well, I might be spoiled by portage but shouldn't there be a thing
like
cabal upgrade pureMD5
and
cabal upgrade --all
snuffy:502 Z$ cabal help upgrade
Usage: cabal upgrade [FLAGS]
or: cabal upgrade [PACKAGES]
--
brandon s. allbery
According to this discussion, none of the corporate email is okay for
open source mailing list.
Maybe you guys should join the Vioxx lawsuit team instead of Haskell cafe.
Or maybe Haskell's strictness has trained haskell programmers to
attend such details. That is really a good training for the
On Fri, Sep 26, 2008 at 12:07 PM, Dougal Stanton
[EMAIL PROTECTED] wrote:
On Fri, Sep 26, 2008 at 11:32 AM, Thomas Davie [EMAIL PROTECTED] wrote:
Sure it does -- it prevents the use of software for things that are closed
source.
Thing that are closed source is not a use of software. Programs
Magnus Therning ha scritto:
Recently I received an email with a question regarding the licensing
of a module I've written and uploaded to Hackage. I released it under
LGPL. The sender wondered if I would consider re-licensing the code
under BSD (or something similar) that would remove the need
Andrew Coppin wrote:
Andrew Coppin wrote:
OK, so a GHC question: Apparently at some point, GHC used to support
DLLs. And then it stopped working. And then it may or may not have
been brought back again... Does anybody know exactly what the status
of this is? Is it currently working or broken?
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly injuried enemy.
Should he help the enemy?
My answer would be that he indeed should, at the condition that the
patient will switch side. Oh wait, that's just what the GPL says.
Am Freitag, 26. September 2008 09:24 schrieb Magnus Therning:
Recently I received an email with a question regarding the licensing
of a module I've written and uploaded to Hackage. I released it under
LGPL. The sender wondered if I would consider re-licensing the code
under BSD (or something
Now I have fairly strong feelings about freedom of code and I
everything I release is either under GPL or LGPL. What I like about
those licenses is it protects freedom in a way that I think it should
I'm afraid I'll just be boring and make a recommendation:
Magnus Therning wrote:
I've heard that the OCaml crowd uses a modified LGPL with a static
linking exception. Unfortunately I've also heard that their addition
to LGPL hasn't gotten much review by lawyers, I'd much rather use
something that feels less ad hoc, if you get what I mean.
Any
On Fri, 2008-09-26 at 12:17 +0200, Thomas Davie wrote:
On 26 Sep 2008, at 12:12, Janis Voigtlaender wrote:
Manlio Perillo wrote:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly injuried enemy.
Should he help the enemy?
Op vrijdag 26-09-2008 om 11:45 uur [tijdzone -0400], schreef Stefan
Monnier:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly injuried enemy.
Should he help the enemy?
My answer would be that he indeed should, at the
Manlio Perillo wrote:
Simon Marlow ha scritto:
Manlio Perillo wrote:
[...]
We'd certainly support any efforts to add support for a more modern
I/O multiplexing or asynchronous I/O back-end to the IO library. It's
not too difficult, because the interface between the low-level I/O
supplier
Wolfgang Jeltsch [EMAIL PROTECTED] wrote:
Am Freitag, 26. September 2008 09:24 schrieb Magnus Therning:
Now I have fairly strong feelings about freedom of code and I
everything I release is either under GPL or LGPL.
Ah, the RMS prevarication. ;-) Honestly, copyleft gives the user
*less*
On Fri, 2008-09-26 at 13:01 -0300, Marco Túlio Gontijo e Silva wrote:
Op vrijdag 26-09-2008 om 11:45 uur [tijdzone -0400], schreef Stefan
Monnier:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly injuried enemy.
Should he
Jonathan Cast [EMAIL PROTECTED] wrote:
On Fri, 2008-09-26 at 13:01 -0300, Marco Túlio Gontijo e Silva wrote:
Op vrijdag 26-09-2008 om 11:45 uur [tijdzone -0400], schreef Stefan
Monnier:
When I compare GPL and MIT/BSD licenses, I do a simple
reasoning. Suppose a doctor in a battle
Hi all,
TGIF! And since it is friday, I started thinking on some alternatives
to program PIC processors...
I don't know how many of you are familiar with the PIC family of
microcontrollers http://www.microchip.com/. They are RISC controllers with
a wide range of complexity, starting
On Fri, 2008-09-26 at 18:26 +0200, Achim Schneider wrote:
Jonathan Cast [EMAIL PROTECTED] wrote:
On Fri, 2008-09-26 at 13:01 -0300, Marco Túlio Gontijo e Silva wrote:
Op vrijdag 26-09-2008 om 11:45 uur [tijdzone -0400], schreef Stefan
Monnier:
When I compare GPL and MIT/BSD
On Fri, 2008-09-26 at 10:49 +0200, Achim Schneider wrote:
% cabal update
Downloading package list from server
'http://hackage.haskell.org/packages/archive'
% cabal install pureMD5
All requested packages already installed. Nothing to do.
% cabal install pureMD5-0.2.4
Downloading
On 26 Sep 2008, at 17:51, Jonathan Cast wrote:
On Fri, 2008-09-26 at 12:17 +0200, Thomas Davie wrote:
On 26 Sep 2008, at 12:12, Janis Voigtlaender wrote:
Manlio Perillo wrote:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
Suppose a doctor in a battle field meet a badly
This is a very good post and a clever idea. Thanks!
Luke
On Fri, Sep 26, 2008 at 3:30 AM, apfelmus [EMAIL PROTECTED] wrote:
apfelmus wrote:
data Stack2 r b = Empty | S [r] (Stack2 b r) deriving (Eq, Show)
In the previous post, I considered an implementation of red-blue stacks
with the
Jonathan Cast [EMAIL PROTECTED] wrote:
On Fri, 2008-09-26 at 18:26 +0200, Achim Schneider wrote:
Jonathan Cast [EMAIL PROTECTED] wrote:
On Fri, 2008-09-26 at 13:01 -0300, Marco Túlio Gontijo e Silva
wrote:
Op vrijdag 26-09-2008 om 11:45 uur [tijdzone -0400], schreef
Stefan
On Fri, 2008-09-26 at 18:45 +0200, Thomas Davie wrote:
On 26 Sep 2008, at 17:51, Jonathan Cast wrote:
On Fri, 2008-09-26 at 12:17 +0200, Thomas Davie wrote:
On 26 Sep 2008, at 12:12, Janis Voigtlaender wrote:
Manlio Perillo wrote:
When I compare GPL and MIT/BSD licenses, I do a simple
On Fri, Sep 26, 2008 at 9:45 AM, Thomas Davie [EMAIL PROTECTED] wrote:
On 26 Sep 2008, at 17:51, Jonathan Cast wrote:
On Fri, 2008-09-26 at 12:17 +0200, Thomas Davie wrote:
On 26 Sep 2008, at 12:12, Janis Voigtlaender wrote:
Manlio Perillo wrote:
When I compare GPL and MIT/BSD
On Fri, 2008-09-26 at 18:50 +0200, Achim Schneider wrote:
Jonathan Cast [EMAIL PROTECTED] wrote:
On Fri, 2008-09-26 at 18:26 +0200, Achim Schneider wrote:
Jonathan Cast [EMAIL PROTECTED] wrote:
On Fri, 2008-09-26 at 13:01 -0300, Marco Túlio Gontijo e Silva
wrote:
Op
Thomas Davie [EMAIL PROTECTED] wrote:
On 26 Sep 2008, at 17:51, Jonathan Cast wrote:
On Fri, 2008-09-26 at 12:17 +0200, Thomas Davie wrote:
On 26 Sep 2008, at 12:12, Janis Voigtlaender wrote:
Manlio Perillo wrote:
When I compare GPL and MIT/BSD licenses, I do a simple reasoning.
On Fri, 2008-09-26 at 09:48 -0700, Jonathan Cast wrote:
On Fri, 2008-09-26 at 18:50 +0200, Achim Schneider wrote:
Jonathan Cast [EMAIL PROTECTED] wrote:
On Fri, 2008-09-26 at 18:26 +0200, Achim Schneider wrote:
Jonathan Cast [EMAIL PROTECTED] wrote:
On Fri, 2008-09-26 at
apfelmus wrote:
[..]
Persistent data structures are harder to come up with than ephemeral
ones, [...]
Yes, in some cases it's quite hard to find a persistent solution for a
data structure that is rather trivial compared to its ephemeral
counterpart. My question is: Is there a case, where
Simon Marlow wrote:
Andrew Coppin wrote:
Looking at the surface, it appears as if not very much is currently
going on with GHC. And then, by pure chance, I happened across a link
that allows you to access the GHC developers' mailing list, and
woo-boy, it looks pretty damned busy in there!
[topic drifting to discussion of the geneva convention]
Jonathan Cast [EMAIL PROTECTED] wrote:
software
Well, there indeed has been a judgement that a certain military
programmer can't be disciplined for disobeying an order to program
a specific software on the reason that he can't consciously
On 26 Sep 2008, at 19:18, Stephan Friedrichs wrote:
apfelmus wrote:
[..]
Persistent data structures are harder to come up with than ephemeral
ones, [...]
Yes, in some cases it's quite hard to find a persistent solution for a
data structure that is rather trivial compared to its ephemeral
On Fri, Sep 26, 2008 at 7:18 PM, Stephan Friedrichs
[EMAIL PROTECTED] wrote:
apfelmus wrote:
[..]
Persistent data structures are harder to come up with than ephemeral
ones, [...]
Yes, in some cases it's quite hard to find a persistent solution for a
data structure that is rather trivial
Take a look around you. Haskell provides several sorts of container. We
have:
Data.List
Data.Set
Data.Map
Data.Hashtable
Data.ByteString
Data.Sequence
Data.Array
Data.Tree
Data.IntSet
Data.IntMap
...
In other words, we have *a lot* of different data containers. And yet,
each one
On Sep 26, 2008, at 12:30 , Rafael Gustavo da Cunha Pereira Pinto wrote:
While studying Haskell, the functional bug bit me and I
realized that this architecture is somewhat not well suited for
traditional compilers. I suddenly started thinking on how one could
implement some kind of
Apparently C++ lets you overload the arithmetic operators, the
assignment operator, the initialisation and destruction operators, the
pointer dereference operator, the memory allocation operator, and even
the function call operator. o_O
But only _Haskell_ lets you overload the ; operator! ;-)
I think you might be interested in
http://www.research.att.com/~bs/whitespace98.pdf
On 26 Sep 2008, at 22:39, Andrew Coppin wrote:
Apparently C++ lets you overload the arithmetic operators, the
assignment operator, the initialisation and destruction operators,
the pointer dereference
Andrew Coppin wrote:
If I understand this correctly, to solve this problem you need either
Functional Dependencies or Associated Types. Is that correct?
A motivating example in papers on FD is exactly typeclasses for
containers. Okasaki puts this into practice in the Edison library.
Despite
Andrew Coppin [EMAIL PROTECTED] wrote:
[...]
I completely agree that Hashtable should instance Map and alike.
Data.List.map :: (a - b) - [a] - [b]
Other containers only support *one* type of data:
Data.ByteString.Char8.map :: (Char - Char) - ByteString -
ByteString
The type has a
Miguel Mitrofanov wrote:
I think you might be interested in
http://www.research.att.com/~bs/whitespace98.pdf
Thankyou. That is the most insane thing I've read all day. And I've been
reading a C++ tutorial all day! o_O
___
Haskell-Cafe mailing list
On Fri, Sep 26, 2008 at 8:01 PM, Achim Schneider [EMAIL PROTECTED] wrote:
But then you'll be happy to know that there's already Data.Stream.List,
with more coming at the same speed as we can order pizza for dons.
http://hackage.haskell.org/trac/ghc/ticket/915
I was hoping that ticket would
...revealed that streams stuff is not scheduled for inclusion until GHC
6.12
How many pizzas will it take to bump that to 6.10? :D
On Fri, Sep 26, 2008 at 3:23 PM, Dougal Stanton [EMAIL PROTECTED]wrote:
On Fri, Sep 26, 2008 at 8:01 PM, Achim Schneider [EMAIL PROTECTED] wrote:
But then
John Van Enk wrote:
...revealed that streams stuff is not scheduled for inclusion until
GHC 6.12
How many pizzas will it take to bump that to 6.10? :D
So basically Don is like the dining philosophers, except instead of
turning spaghetti into philosophy, he turns pizza into world-beating
Dougal Stanton wrote:
I was hoping that ticket would reveal the delivery address that we had
to send pizza to, but instead it revealed that streams stuff is not
scheduled for inclusion until GHC 6.12. :-(
As I understand it, the [list] stream-fusion library is on Hackage
*now*, you can use
Brilliant. This made my day. I must admit, I looked briefly at the
paper after I saw the link, yawned, and closed it. Then I saw Andrew's
comment, skimmed the paper, becoming more and more convinced that it
was a joke, saw the last line, and then had to go back and read the
whole thing again. Just
Does the quality of the pizza matter, or is it a matter of sheer quantity?
If it's a balance of the two, then we need to do some experimentation.
Lets start donating a specific quantity of pizzas to Don every week, but
vary the quality of the pizza. We'll check his Hackage submissions and then
Miguel Mitrofanov [EMAIL PROTECTED] wrote:
I think you might be interested in
http://www.research.att.com/~bs/whitespace98.pdf
Instead, it was decided to by default limit identifiers to a single
character
The Wisdom of it! Preparing C++ programmers for Haskell's limitation!
--
(c) this sig
Achim Schneider [EMAIL PROTECTED] wrote:
Miguel Mitrofanov [EMAIL PROTECTED] wrote:
I think you might be interested in
http://www.research.att.com/~bs/whitespace98.pdf
Instead, it was decided to by default limit identifiers to a single
character
The Wisdom of it! Preparing C++
OK, seems like I have to read it myself...
On 26 Sep 2008, at 23:40, Andrew Wagner wrote:
Brilliant. This made my day. I must admit, I looked briefly at the
paper after I saw the link, yawned, and closed it. Then I saw Andrew's
comment, skimmed the paper, becoming more and more convinced that
Andrew Coppin [EMAIL PROTECTED] wrote:
John Van Enk wrote:
So basically Don is like the dining philosophers, except instead of
turning spaghetti into philosophy, he turns pizza into world-beating
Haskell awesomeness?
Is that the problem where you have to calculate the probability of
the
Aaron Denney wrote:
On 2008-09-17, Jonathan Cast [EMAIL PROTECTED] wrote:
In my mind pooling vs new-creation is only relevant to process vs
thread in the performance aspects.
Say what? This discussion is entirely about performance --- does
CPython actually have the ability to scale
e = exp 1.0
sigmoid xx = 1.0 / (1 + (e ** (1.0 * xx)))
That 1.0 * xx caught my eye.
In case this was an oversight on your part: if you mean the usual sigmoid
function, that should be 1.0 / (1 + (e ** (0.0 - x))).
i had a different constant there before.
Andrew Coppin wrote:
(1) is not of huge interest to me, but it's pleasing to know that it's
possible. (I don't actually know how DLLs work, but presumably if I were
to dig around in System.Win32 I could also call normal DLLs from Haskell
too if I desire...?)
Sure, that's possible.
(2) is
On Fri, 2008-09-26 at 19:15 +0100, Andrew Coppin wrote:
Take a look around you. Haskell provides several sorts of container. We
have:
Data.List
Data.Set
Data.Map
Data.Hashtable
Data.ByteString
Data.Sequence
Data.Array
Data.Tree
Data.IntSet
Data.IntMap
...
Simon Marlow wrote:
Andrew Coppin wrote:
(1) is not of huge interest to me, but it's pleasing to know that
it's possible. (I don't actually know how DLLs work, but presumably
if I were to dig around in System.Win32 I could also call normal DLLs
from Haskell too if I desire...?)
Sure,
Derek Elkins wrote:
One aspect of it is a bit of a You Aren't Going To Need It.
Personally, I haven't had a huge problem with this in practice.
What it basically means is that if you write a library function, *you*
have to decide what containers you're going to use. It's not really
I wanted to try out yi after seeing it demonstrated in the
Haskell symposium. So, I installed cabal as described here
http://hackage.haskell.org/trac/hackage/wiki/CabalInstall
I am using Debian unstable with debian distributed GHC 6.8.2.x
but it seems that yi requries GHC 6.8.3 to compile. So, I
On Fri, Sep 26, 2008 at 22:03, Achim Schneider [EMAIL PROTECTED] wrote:
Instead, it was decided to by default limit identifiers to a single
character
The Wisdom of it! Preparing C++ programmers for Haskell's limitation!
Oh no, you are forgetting the primes, x', y' :P
I liked the motivation
On Fri, Sep 26, 2008 at 5:37 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
As already noted, Data.Set *should* be a Monad, but can't be. The type
system won't allow it. (And I know I'm not the first person to notice
this...)
I wouldn't say that. It's important to remember that Haskell class
Can someone explain, why is it that Set can not be a Monad?
--
_jsn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Fri, 2008-09-26 at 15:25 -0700, Jason Dusek wrote:
Can someone explain, why is it that Set can not be a Monad?
It can't even be a functor (which all monads are). You can't implement
fmap (+) $ Set.fromList [1, 2, 3]
with Data.Set, because you can't order functions of type Integer -
Hello Andrew,
Saturday, September 27, 2008, 1:37:12 AM, you wrote:
answering your questions
1) there is 2 libs providing common Java-like interfaces to
containers: Edison and Collections. almost noone uses it
2) having common type class for various things is most important when
you write
More specifically, although a set is a perfectly good (lowercase)
functor, Set is not a (Haskell) Functor.
Set's map has an Ord constraint, but the Functor type constructor is
parametric over *all* types, not just that proper subset of them that
have a total ordering.
But see attempts to
Here's a writeup I posted from the conference floor this afternoon:
http://www.serpentine.com/blog/2008/09/26/some-notes-on-the-future-of-haskell-and-fp/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
bulat.ziganshin:
Hello Andrew,
Saturday, September 27, 2008, 1:37:12 AM, you wrote:
answering your questions
1) there is 2 libs providing common Java-like interfaces to
containers: Edison and Collections. almost noone uses it
2) having common type class for various things is most
On 2008 Sep 26, at 15:42, John Van Enk wrote:
Lets start donating a specific quantity of pizzas to Don every week,
but vary the quality of the pizza. We'll check his Hackage
submissions and then tune the pizza algorithm to the desired
output. :)
Premature optimization is the root of all
On Fri, Sep 26, 2008 at 11:52 PM, Bryan O'Sullivan [EMAIL PROTECTED] wrote:
Here's a writeup I posted from the conference floor this afternoon:
http://www.serpentine.com/blog/2008/09/26/some-notes-on-the-future-of-haskell-and-fp/
That's a very ominous title for such a positive write-up! It's
Am Samstag, 27. September 2008 01:04 schrieb Dougal Stanton:
Haskell: it may be avoiding success, but it's certainly quite popular. ;-)
Didn't you mean to write but it's not too successful at that?
:D
D
___
Haskell-Cafe mailing list
On Fri, 2008-09-26 at 22:37 +0100, Andrew Coppin wrote:
Derek Elkins wrote:
One aspect of it is a bit of a You Aren't Going To Need It.
Personally, I haven't had a huge problem with this in practice.
I suspected as much. Personally I'd recomend worrying about the
problems you actually
Darn, I sent this as personal mail the first time.
Evan Laforge wrote:
In Haskell,
The sequence enumFromTo e1 e3 is the list [e1,e1+1,e1+2,...e3].
The list is empty if e1 e3.
I like it, since it means that things like [n .. n + length m - 1]
work as expected when m is []. Or say 'map
On Sat, 2008-09-27 at 02:09 +0100, Simon Richard Clarkstone wrote:
Darn, I sent this as personal mail the first time.
Evan Laforge wrote:
In Haskell,
The sequence enumFromTo e1 e3 is the list [e1,e1+1,e1+2,...e3].
The list is empty if e1 e3.
I like it, since it means that things
I'm goofing with TH and I have my program mostly done:
http://hpaste.org/10713
If I have the $(deriveBinary ''MyData) line commented out it
prints out what looks to me like correct code. I can even paste
it into a program and it compiles. However, when the line isn't
commented out I get
On Fri, Sep 26, 2008 at 1:03 PM, Achim Schneider [EMAIL PROTECTED] wrote:
Miguel Mitrofanov [EMAIL PROTECTED] wrote:
I think you might be interested in
http://www.research.att.com/~bs/whitespace98.pdf
Instead, it was decided to by default limit identifiers to a single
character
The Wisdom
94 matches
Mail list logo
