On Mon, 9 Mar 2009 11:50:51 +, Ian Lynagh wrote:
>On Mon, Mar 09, 2009 at 11:13:40AM +, Sebastian Sylvan wrote:
>>
>> Another reason condorcet voting is nice is that there is no need to group
>> "similar" items together.
>
>I think the plan is that once a logo "class" is chosen, we'll ha
On 2009 Mar 9, at 20:14, Windoze wrote:
glibc-devel
libedit-devel
ncurses-devel
gmp-devel
.etc.
Must I used the dev versions, or will it work with the lastest, stable
release versions of same?
Linux distributions use foo-devel or foo-dev for the files necessary
for development, i.e. header f
Alexander Dunlap writes:
> - uvector, storablevector and vector are all designed for dealing with
> arrays. They *can* be used for characters/word8s but are not
> specialized for that purpose, do not deal with Unicode at all, and are
> probably worse at it. They are better for dealing with things
On Mon, Mar 9, 2009 at 3:12 AM, Henning Thielemann
wrote:
>
> On Mon, 9 Mar 2009, Claus Reinke wrote:
>
>> Given the close relationship between uvector and vector, it would
>> be very helpful if both package descriptions on hackage could point to a
>> common haskell wiki page, starting out with th
BTW, how did you get the package installed in that location? Did it
involve copying into a temp dir and copying again? I believe that on
OSX, copying a .a file breaks the ar index. This is because for
reasons
best known to themselves Apple decided that the index is only valid if
its timestamp i
ChrisK wrote:
Hello,
As a side effect of the discussion of the new C++ future/promise
features at http://lambda-the-ultimate.org/node/3221 I have implemented
a Haskell package called "future" at
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/future
This ought to do what C++ st
On Sun, Mar 08, 2009 at 01:13:33PM +0100, Svein Ove Aas wrote:
> On Sun, Mar 8, 2009 at 12:32 PM, Duncan Coutts
> wrote:
> > Note also that the list of licenses mkcabal offers is wrong. You can get
> > the list from the Cabal lib itself so there is no need to maintain the
> > list manually.
> >
>
Maurício wrote:
Here in Brazil we have a forest animal we name 'preguiça' -- literally,
lazyness. What better mascot we could have for Haskell? It lives (and
sleeps) in trees, and if you see the main picture in wikipedia articles
you can easily imagine the tree branch beeing replaced by a lambda
On Mon, Mar 9, 2009 at 7:14 PM, Windoze wrote:
>
> Greetings,
>
> am considering learning how to do a build for my slackware-based distro.
>
> The doc sited below say's it requires:
>
> glibc-devel
> libedit-devel
> ncurses-devel
> gmp-devel
> .etc.
>
> Must I used the dev versions, or will it wor
On Mon, Mar 09, 2009 at 09:25:58AM -0500, Austin Seipp wrote:
> Indeed, I stumbled upon it whilst looking at how unsafeCoerce worked
> (to find out it is super-duper-special and implemented as part of E.)
> I think it's actually pretty clever, and who knows, maybe it could be
> useful as at least a
Quoth Joe Fredette :
| Hehe, I love it. Sloth is a synonym for Lazyness in English too, and
| they're so freaking cute... :)
... and so freaking slow! :)
Donn
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailma
On Sun, 2009-03-08 at 22:44 -0500, Alexy Khrabrov wrote:
> When bootstrapping cabal-install 0.6.2 on Mac OSX Leopard (Intel), I
> get a problem when linking:
>
> Linking dist/build/cabal/cabal ...
> ld: in
> /private/var/folders/mw/mwJSf7ErEa4w8nWyKyyqDTY/-Tmp-/zlib-0.5.0.0/dist/build/libHSzl
Greetings,
am considering learning how to do a build for my slackware-based distro.
The doc sited below say's it requires:
glibc-devel
libedit-devel
ncurses-devel
gmp-devel
.etc.
Must I used the dev versions, or will it work with the lastest, stable
release versions of same?
thanks much fo
On Mon, 2009-03-09 at 13:26 -0700, Don Stewart wrote:
> lists:
> > Hi folks,
> >
> > I've got an application to release. I'm releasing the source, but I also
> > wanted
> > to release binary versions for people that don't have GHC. I developed on
> > Windows, so making a Windows executable was si
It's got my vote!
2009/3/10 Joe Fredette :
> Hehe, I love it. Sloth is a synonym for Lazyness in English too, and they're
> so freaking cute... :)
>
> Maurício wrote:
>>
>> Hi,
>>
>> Here in Brazil we have a forest animal we name 'preguiça' -- literally,
>> lazyness. What better mascot we could h
Hehe, I love it. Sloth is a synonym for Lazyness in English too, and
they're so freaking cute... :)
Maurício wrote:
Hi,
Here in Brazil we have a forest animal we name 'preguiça' -- literally,
lazyness. What better mascot we could have for Haskell? It lives (and
sleeps) in trees, and if you se
Hi,
Here in Brazil we have a forest animal we name 'preguiça' -- literally,
lazyness. What better mascot we could have for Haskell? It lives (and
sleeps) in trees, and if you see the main picture in wikipedia articles
you can easily imagine the tree branch beeing replaced by a lambda:
http://en.
On Mon, Mar 9, 2009 at 10:38 PM, Sebastian Sylvan <
sebastian.syl...@gmail.com> wrote:
>
>
> On Mon, Mar 9, 2009 at 10:21 PM, Bulat Ziganshin <
> bulat.zigans...@gmail.com> wrote:
>
>> Hello Sebastian,
>>
>> Tuesday, March 10, 2009, 1:08:38 AM, you wrote:
>> > It just seems like duplicated work t
On Mon, Mar 9, 2009 at 10:21 PM, Bulat Ziganshin
wrote:
> Hello Sebastian,
>
> Tuesday, March 10, 2009, 1:08:38 AM, you wrote:
> > It just seems like duplicated work to me. They're still few enough
> > that I can scan through them and multi-select the ones I like and
> > then click "move to top"
Hello Sebastian,
Tuesday, March 10, 2009, 1:08:38 AM, you wrote:
> It just seems like duplicated work to me. They're still few enough
> that I can scan through them and multi-select the ones I like and
> then click "move to top" in a pretty short amount of time (and then refine
> the ranking if
On Mon, Mar 9, 2009 at 5:26 PM, Luke Palmer wrote:
> 2009/3/9 Sebastian Sylvan
>
>>
>>
>> On Mon, Mar 9, 2009 at 10:30 AM, Bulat Ziganshin <
>> bulat.zigans...@gmail.com> wrote:
>>
>>> Hello Sebastian,
>>>
>>> Monday, March 9, 2009, 1:08:50 PM, you wrote:
>>>
>>> i think we should make 2-stage v
On Monday 09 March 2009 01:26:37 pm Don Stewart wrote:
> lists:
> > Hi folks,
> >
> > I've got an application to release. I'm releasing the source, but I also
> > wanted to release binary versions for people that don't have GHC. I
> > developed on Windows, so making a Windows executable was simple.
Who needs to build futures into the language -- all you need is MVars, eh?
-- Don
vanenkj:
> I'd also like to point out that Chris did this with 165 lines of
> code--including comments and whitespace! If you drop the whitespace and
> comments, it's only 91 lines!
>
__
I'd also like to point out that Chris did this with 165 lines of
code--including comments and whitespace! If you drop the whitespace and
comments, it's only 91 lines!
/jve
On Mon, Mar 9, 2009 at 4:54 PM, ChrisK wrote:
> Hello,
>
> As a side effect of the discussion of the new C++ future/promis
This is way cool!
/jve
On Mon, Mar 9, 2009 at 4:54 PM, ChrisK wrote:
> Hello,
>
> As a side effect of the discussion of the new C++ future/promise features
> at http://lambda-the-ultimate.org/node/3221 I have implemented a Haskell
> package called "future" at
>
> http://hackage.haskell.org/cgi-
Hello,
As a side effect of the discussion of the new C++ future/promise features at
http://lambda-the-ultimate.org/node/3221 I have implemented a Haskell package
called "future" at
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/future
This ought to do what C++ standard futures/
colin:
> Is there a function that yields the minimum value of Int on an implementation?
Prelude> minBound :: Int
-9223372036854775808
Prelude> maxBound :: Int
9223372036854775807
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
htt
Prelude> minBound :: Int
-2147483648
/jve
On Mon, Mar 9, 2009 at 4:44 PM, Colin Paul Adams
wrote:
> Is there a function that yields the minimum value of Int on an
> implementation?
> --
> Colin Adams
> Preston Lancashire
> ___
> Haskell-Cafe mailing l
Is there a function that yields the minimum value of Int on an implementation?
--
Colin Adams
Preston Lancashire
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
lists:
> Hi folks,
>
> I've got an application to release. I'm releasing the source, but I also
> wanted
> to release binary versions for people that don't have GHC. I developed on
> Windows, so making a Windows executable was simple. I also have access to an
> Ubuntu Linux box, on which I can ea
Hi folks,
I've got an application to release. I'm releasing the source, but I also
wanted to release binary versions for people that don't have GHC. I
developed on Windows, so making a Windows executable was simple. I also have
access to an Ubuntu Linux box, on which I can easily build and test my
You can use the record syntax to get around some of this:
data P { first :: Int, second :: Int }
firstCoord (P {first = f}) = f
2009/3/9 Peter Verswyvelen
> In Haskell, a data constructor can be used partially applied:
> data Pair a b = P a b
>
> f = P 1
>
> however, I cannot do "partial patte
On Mon, 2009-03-09 at 10:08 +, Sebastian Sylvan wrote:
> But the point is that you shouldn't need to rank every single logo,
> just the ones you care about and then you leave the rest at the
> default rank.
You'll also want to rank the popular ones even if you don't like them.
--
Ashley Yak
On Mon, Mar 9, 2009 at 10:37 AM, Eugene Kirpichov wrote:
> I mean, there is no way to write a firstCoord function so that it
> would work, for example, on '\y -> P 42 y' and yield 42.
>
> Except for this one:
>
> firstCoord proj = case (proj undefined) of P x y -> x
>
> However, this requires proj
2009/3/9 Sebastian Sylvan
>
>
> On Mon, Mar 9, 2009 at 10:30 AM, Bulat Ziganshin <
> bulat.zigans...@gmail.com> wrote:
>
>> Hello Sebastian,
>>
>> Monday, March 9, 2009, 1:08:50 PM, you wrote:
>>
>> i think we should make 2-stage voting, like in F1
>>
>> after 1st stage we will know which logos a
Yes of course, P x is a function, and you can't pattern match against
functions, I knew that. How silly of me, I could have guessed that myself.
On Mon, Mar 9, 2009 at 5:43 PM, Daniel Fischer wrote:
> Am Montag, 9. März 2009 17:30 schrieb Peter Verswyvelen:
> > In Haskell, a data constructor can b
Am Montag, 9. März 2009 17:30 schrieb Peter Verswyvelen:
> In Haskell, a data constructor can be used partially applied:
> data Pair a b = P a b
>
> f = P 1
>
> however, I cannot do "partial pattern matching", e.g
>
> firstCoord (P x) = x
>
> does not work.
>
> I guess a very important reason must
I mean, there is no way to write a firstCoord function so that it
would work, for example, on '\y -> P 42 y' and yield 42.
Except for this one:
firstCoord proj = case (proj undefined) of P x y -> x
However, this requires proj to be non-strict in its remaining argument.
But this will actually wor
Peter Verswyvelen wrote:
> In Haskell, a data constructor can be used partially applied:
> data Pair a b = P a b
>
> f = P 1
>
> however, I cannot do "partial pattern matching", e.g
>
> firstCoord (P x) = x
>
> does not work.
>
> I guess a very important reason must exist why this is the case?
>
W
P x is indistinguishable neither in compile-time nor in run-time from
the value \y -> P x y.
And pattern matching and equality on functions is, of course, undecidable.
2009/3/9 Peter Verswyvelen :
> In Haskell, a data constructor can be used partially applied:
> data Pair a b = P a b
> f = P 1
>
The question is, is there some very important reason you can't do this?
firstCoord (P x _) = x
2009/3/9 Peter Verswyvelen
> In Haskell, a data constructor can be used partially applied:
> data Pair a b = P a b
>
> f = P 1
>
> however, I cannot do "partial pattern matching", e.g
>
> firstCoord (P
In Haskell, a data constructor can be used partially applied:
data Pair a b = P a b
f = P 1
however, I cannot do "partial pattern matching", e.g
firstCoord (P x) = x
does not work.
I guess a very important reason must exist why this is the case?
___
> Although maybeRead was proposed, I cannot find it:
here's a replacement...
http://hackage.haskell.org/packages/archive/safe/0.2/doc/html/Safe.html#v%3AreadMay
Greetings,
Daniel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskel
Excerpts from John Meacham's message of Mon Mar 09 07:28:25 -0500 2009:
> On Sat, Mar 07, 2009 at 07:45:06PM -0600, Austin Seipp wrote:
> > (On that note, I am currently of the opinion that most of LHC's major
> > deficiencies, aside from a few parser bugs or some needed
> > optimizations, comes fr
On Sat, Mar 07, 2009 at 07:45:06PM -0600, Austin Seipp wrote:
> (On that note, I am currently of the opinion that most of LHC's major
> deficiencies, aside from a few parser bugs or some needed
> optimizations, comes from the fact that compiling to C is currently
> our only option; because of it, w
On Mon, Mar 09, 2009 at 11:13:40AM +, Sebastian Sylvan wrote:
>
> Another reason condorcet voting is nice is that there is no need to group
> "similar" items together.
I think the plan is that once a logo "class" is chosen, we'll have
another vote for the actual colour scheme etc to be used,
> Another reason condorcet voting is nice is that there is no need to group
> "similar" items together. Condorcet voting eliminates the "spoiler
> candidate" effect, so having N almost identical entries won't adversely
> affect that "group" (by spreading out the votes for that "group" among more
>
On Mon, Mar 9, 2009 at 6:13 AM, Benjamin L. Russell
wrote:
> On Sun, 08 Mar 2009 16:19:43 -0700, Ashley Yakeley
> wrote:
>
> >[...]
> >
> >I'm currently liking
> >
> >30 (specifically, 30.7)
> >58
> >61 (specifically, the second image)
> >62
>
> It would be nice to be able to specify a specific m
On Mon, Mar 9, 2009 at 10:52 AM, Sebastian Sylvan <
sebastian.syl...@gmail.com> wrote:
>
>
> On Mon, Mar 9, 2009 at 10:30 AM, Bulat Ziganshin <
> bulat.zigans...@gmail.com> wrote:
>
>> Hello Sebastian,
>>
>> Monday, March 9, 2009, 1:08:50 PM, you wrote:
>>
>> i think we should make 2-stage voting
On Mon, Mar 9, 2009 at 10:30 AM, Bulat Ziganshin
wrote:
> Hello Sebastian,
>
> Monday, March 9, 2009, 1:08:50 PM, you wrote:
>
> i think we should make 2-stage voting, like in F1
>
> after 1st stage we will know which logos are most popular and
> therefore are real candidates, so we can select amo
Bjorn Buckwalter wrote:
> What is your preferred method of parsing floating point numbers (from
> String to Float/Double)? Parsec it seems only does positive floats out
> of the box and PolyParse requires the float to be on scientific form
> (exponential).
Thanks for the bug report. Polyparse i
On Mon, 9 Mar 2009, Bulat Ziganshin wrote:
Hello Sebastian,
Monday, March 9, 2009, 1:08:50 PM, you wrote:
i think we should make 2-stage voting, like in F1
after 1st stage we will know which logos are most popular and
therefore are real candidates, so we can select among them
Sounds reason
Hello Sebastian,
Monday, March 9, 2009, 1:08:50 PM, you wrote:
i think we should make 2-stage voting, like in F1
after 1st stage we will know which logos are most popular and
therefore are real candidates, so we can select among them
> On Sun, Mar 8, 2009 at 11:19 PM, Ashley Yakeley wrote:
>
On Mon, 9 Mar 2009, Claus Reinke wrote:
Given the close relationship between uvector and vector, it would
be very helpful if both package descriptions on hackage could point to a
common haskell wiki page, starting out with the text
and link above, plus a link to the stream fusion paper (I hadn
On Sun, Mar 8, 2009 at 11:19 PM, Ashley Yakeley wrote:
> Eelco Lempsink wrote:
>
> The list with options can be found here (for now):
>> http://community.haskell.org/~eelco/poll.html Notice that some (very)
>> similar logos are grouped as one option (thanks to Ian Lynagh) All
>> submissions comp
On Sat, 7 Mar 2009, Bryan O'Sullivan wrote:
On Sat, Mar 7, 2009 at 10:23 PM, Alexander Dunlap
wrote:
Hi all,
For a while now, we have had Data.ByteString[.Lazy][.Char8] for our
fast strings. Now we also have Data.Text, which does the same for
Unicode. These seem to b
On Sat, 7 Mar 2009, Gü?nther Schmidt wrote:
is the above mentioned book still *the* authority on the subject?
I bought the book, read about 10 pages and then put it back on the shelf. Um.
In my app I have to deal with 4 csv files, each between 5 - 10 mb, and some
static data.
I had put all
On Sun, 8 Mar 2009, Felipe Lessa wrote:
On Sun, Mar 8, 2009 at 9:34 PM, Bjorn Buckwalter
wrote:
(For my current needs the formats accepted by "read" are sufficient,
but I want reasonable error handling (Maybe or Either) instead of an
exception on bad inputs.)
Why not
readM :: (Monad m, Rea
On Mon, Mar 9, 2009 at 12:19 AM, Ashley Yakeley wrote:
> Eelco Lempsink wrote:
>
>> The list with options can be found here (for now):
>> http://community.haskell.org/~eelco/poll.html Notice that some (very)
>> similar logos are grouped as one option (thanks to Ian Lynagh) All
>> submissions comp
59 matches
Mail list logo
