"Sebastian Sylvan" <[EMAIL PROTECTED]> writes:
> On 12/18/06, Bulat Ziganshin <[EMAIL PROTECTED]> wrote:
>> Hello Simon,
>>
>> Monday, December 18, 2006, 12:08:49 PM, you wrote:
>>
>> > My view is that Haskell's performance is very seldom the limiting factor
>>
>> of course. when someone said abo
Bulat Ziganshin <[EMAIL PROTECTED]> writes:
> Hello ajb,
>
> Monday, December 18, 2006, 4:12:01 AM, you wrote:
>
>> time. For example, for certain types of problem, Haskell minimises the
>> amount of time between the point where I start typing and the point where
>> I have the answer.
>
> of cou
Tomasz Zielonka <[EMAIL PROTECTED]> writes:
> On Mon, Dec 18, 2006 at 11:57:59PM +0100, [EMAIL PROTECTED] wrote:
>> ... but I wonder: GPG, AFAIK undertakes some special measures to
>> ensure that neither clear text nor private keys are paged out to the
>> disk (since it might be recovered from th
Tomasz Zielonka <[EMAIL PROTECTED]> writes:
> Anyway, don't concentrate on this particular example. All I say is that:
> - sometimes I get efficient programs in Haskell right away (I my case
> quite often, but YMMV)
> - sometimes efficiency doesn't matter
> I don't think it is contradictory, es
"Brandon S. Allbery KF8NH" <[EMAIL PROTECTED]> writes:
>>> You could just mlock() everything allocated by the RTS...
>>
>> Brute force. :-) Certainly the most simple way to do it. But is that
>> option already here (say in ghc), or would one have to patch the
>> runtime for that?
>
> Note also th
Bulat Ziganshin <[EMAIL PROTECTED]> writes:
> Hello Tomasz,
>
> Tuesday, December 19, 2006, 3:19:52 PM, you wrote:
>>> why you (and Donald) don't want to understand me. i say that imperative
>>> Haskell code is more efficient
>
>> Your statement is too general to deserve answering.
>
> can you pr
"Rafael Almeida" <[EMAIL PROTECTED]> writes:
> I've always found the following definition of the sieve of eratosthenes
> the clearest definition one could write:
>
> sieve [] = []
> sieve (x:xs) = x : sieve [y | y <- xs, y `mod` x /= 0]
> It doesn't perform better than Augustsson's solution. It
"P. R. Stanley" <[EMAIL PROTECTED]> writes:
> P. R. Stanley:
> > "When you write a general solution for a class of problems, as
> opposed
> > to a specific solution to a single problem, you have written an
> algorithm."
> > Discuss!
>
> P. R. Sta
Miles Sabin <[EMAIL PROTECTED]> writes:
> Dougal Stanton wrote,
>> I'd guess there should be a way to get the libreadline4 installed
>> from your package manager. Something like "sudo yum install
>> libreadline4" maybe? I don't use FC myself, so can't help further.
>
> It's even easier than that
> 5) The "gigantic README" with it's "obscure note" is here
> http://www.haskell.org/ghc/download_ghc_661.html a few lines away from
> the download link. You can probably read it in the time it takes you
> to find and click the download link. Much quicker than waiting for a
> configure script to
brad clawsie <[EMAIL PROTECTED]> writes:
>> 4) The fix to the "bug" is simply download and install the libreadline4
>> shared object. No recompilation or reinstallation necessary.
>
> i'm not sure if this has been addressed - but is there a specific
> reason an older version of the readline l
Andrew Coppin <[EMAIL PROTECTED]> writes:
> OK, this is hacking me off now... Does ANYBODY know how I can convince
> Thunderbird to send replies to Haskell Cafe rather than sending them
> to the original poster? This is really becoming tiresome...
My best approach to that has been to explicitely
Chris Eidhof <[EMAIL PROTECTED]> writes:
> One thing I did was replacing the "Reply" button in my toolbar with
> "Reply All". The only problem is that I always use Cmd+R instead of
> clicking a button, but I'm at least a little bit closer.
(and: No top posting please.)
Yes, I just found, that h
13 matches
Mail list logo
