Thanks.
Now it's working - it wasn't at the moment of my email.
On Sun, Dec 25, 2011 at 11:21 AM, Tom Murphy wrote:
> realworldhaskell.org/book
> On Dec 25, 2011 1:46 AM, "Eugene Kirpichov" wrote:
>
>> See subject.
>> Is this expected?
>>
>> --
>> Eugene Kirpichov
>> Principal Engineer, Miranti
realworldhaskell.org/book
On Dec 25, 2011 1:46 AM, "Eugene Kirpichov" wrote:
> See subject.
> Is this expected?
>
> --
> Eugene Kirpichov
> Principal Engineer, Mirantis Inc. http://www.mirantis.com/
> Editor, http://fprog.ru/
>
> ___
> Haskell-Cafe mail
Thanks, this makes sense.
On Sun, Dec 25, 2011 at 10:03 AM, Dan Doel wrote:
> On Sun, Dec 25, 2011 at 12:14 AM, Eugene Kirpichov
> wrote:
> > On Sat, Dec 24, 2011 at 10:49 PM, Dan Doel wrote:
> >> I think it's good to be clear on all these specifics, and people could
> >> do with a better reco
On Sun, Dec 25, 2011 at 12:14 AM, Eugene Kirpichov wrote:
> On Sat, Dec 24, 2011 at 10:49 PM, Dan Doel wrote:
>> I think it's good to be clear on all these specifics, and people could
>> do with a better recognition of the difference between (non-)strict
>> and (lazy)eager (hint: you can have an
On Sun, Dec 25, 2011 at 12:04 AM, Brent Yorgey wrote:
> Hi all,
>
> Although it doesn't seem to be documented in the user manual (!),
> Haddock supports inline images, using a <> syntax. I'd like to
> include some images in the documentation for a package I'm writing,
> but not sure of the best w
On Sat, Dec 24, 2011 at 10:49 PM, Dan Doel wrote:
> On Sat, Dec 24, 2011 at 2:31 AM, Albert Y. C. Lai wrote:
> > 1. a function f is strict if f ⊥ = ⊥
> > 2. ⊥ represents any computation which does not terminate, i.e. an
> exception
> > or an infinite loop
> > 3. "strict" describes the denotatio
Hi all,
Although it doesn't seem to be documented in the user manual (!),
Haddock supports inline images, using a <> syntax. I'd like to
include some images in the documentation for a package I'm writing,
but not sure of the best way.
I can, of course, just make the images available under my UPe
Hi.
You may need to make sure that the CPU frequency scaling does not do
anything funny. (like only boosting the frequency to the maximum when
the parallel program is running)
Arseniy.
> 24.12.2011, в 19:49, Burak Ekici написал(а):
>
> Dear List,
>
> I am trying to parallelize Karatsuba multipl
"I have not written this complaint until now because I have been waiting
for unmistakable evidence, a smoking gun, a red hand so caught that you
cannot explain away,"
It's not a murder trial! The number-one nice thing about the Haskell
community is that they _thoroughly_ listen to people. I th
Parallel Haskell Digest 7
=
2011-12-24
Hello Haskellers!
GHC 7.4 is coming! There is loads to look forward to, but sometimes,
it's the little things that count. For example, do you hate the fact
that you can't just flip on an `+RTS -N` without having to first
recompile y
Отправлено с iPad
24.12.2011, в 18:50, Alexander Solla написал(а):
> In the same way, denotational semantics adds features which do not apply to a
> theory of finite computation.
And why exactly should we limit ourselves to some theory you happen to like?
>
>
> > The /defining/ feature o
On Sat, Dec 24, 2011 at 2:31 AM, Albert Y. C. Lai wrote:
> 1. a function f is strict if f ⊥ = ⊥
> 2. ⊥ represents any computation which does not terminate, i.e. an exception
> or an infinite loop
> 3. "strict" describes the denotational semantics
All three of these statements are true. The only
On Sat, Dec 24, 2011 at 8:20 PM, Alexander Solla wrote:
>
>
> On Wed, Dec 21, 2011 at 8:39 PM, MigMit wrote:
>
>>
>> On 22 Dec 2011, at 06:25, Alexander Solla wrote:
>>
>> > Denotational semantics is unrealistic.
>>
>> And so are imaginary numbers. But they are damn useful for electrical
>> circu
I mean exactly 2x one cores cache size of course.
24.12.2011, в 20:06, Eugene Kirpichov написал(а):
> If the cache was infinitely faster, then doubling it would give an infinite
> speedup for an algorithm whose working set was exactly one core's cache size.
>
>
>
> 24.12.2011, в 19:58, Bur
If the cache was infinitely faster, then doubling it would give an infinite
speedup for an algorithm whose working set was exactly one core's cache size.
24.12.2011, в 19:58, Burak Ekici написал(а):
>
> First of all, thanks a lot for your quick answer!
> However, the question is what are the
Well, assume that cache is x times faster than main memory and that the hot
working set size is y, and cache size of one core is z, and that the algorithm
is really bound by memory access. Then some simple math should give the answer
:) I can't do it myself now as I don't have a pen and paper at
First of all, thanks a lot for your quick answer!
However, the question is what are the approximate limits
of this super-linear speedup? I mean, is it acceptable, if
parallelization happens even 100 time faster?
How can I calculate the limits of this speedup via the
cache size of my processor?
I'm gonna clarify my point a little ^^.
In fact pedantry was involved. The way Albert started his original post was
pedantic.
The scaring effect was mostly caused by such discourse showing two things:
- Haskellers make use of obscure terms and distinctions (e.g. "denotational
semantics")
- ...whos
Superlinear speedup can occur due to the increased cache size.
24.12.2011, в 19:49, Burak Ekici написал(а):
> Dear List,
>
> I am trying to parallelize Karatsuba multiplication with Haskell's
> second generation strategies. Although, I am running the code on an
> Intel quad-core CPU, I abnor
On Sat, Dec 24, 2011 at 2:00 PM, Erik de Castro Lopo
wrote:
> Michael Craig wrote:
>
>> I've been looking for a way to compose enumeratees in the enumerator
>> package, but I've come up with nothing so far. I want this function
>>
>> (=$=) :: Monad m => Enumeratee a0 a1 m b -> Enumeratee a1 a2 m b
Dear List,
I am trying to parallelize Karatsuba multiplication with Haskell's
second generation strategies. Although, I am running the code on an
Intel quad-core CPU, I abnormally have a speedup much greater
than 4, around 10, which means a weird parallelization or something
occurs.
I would b
I wonder how the arrival of an anonymous anecdote on IRC was the
smoking gun needed to justify calling out the Haskell community on its
cognitive dissonance. Surely you would need some statistical evidence,
a public display from a very prominent member, or some officially
endorsed stance to convinc
On Wed, Dec 21, 2011 at 8:39 PM, MigMit wrote:
>
> On 22 Dec 2011, at 06:25, Alexander Solla wrote:
>
> > Denotational semantics is unrealistic.
>
> And so are imaginary numbers. But they are damn useful for electrical
> circuits calculations, so who cares?
>
Not a fair comparison. Quaternions
> 1. a function f is strict if f ⊥ = ⊥
> 2. ⊥ represents any computation which does not terminate, i.e. an
> exception or an infinite loop
> 3. "strict" describes the denotational semantics
>
> People, could you please make up your mind already? It has been more
> than 13 years.
I have to admi
Michael Craig wrote:
> I've been looking for a way to compose enumeratees in the enumerator
> package, but I've come up with nothing so far. I want this function
>
> (=$=) :: Monad m => Enumeratee a0 a1 m b -> Enumeratee a1 a2 m b ->
> Enumeratee a0 a2 m b
I think part of the problem here is tha
On Dec 24, 2011, at 6:47 PM, Murray Campbell wrote:
> It's too late to avoid success at all costs but please don't banish our
> precious pedantry!
>
> Scare on!
Please don't misunderstand, I have absolutely no problems at all with people
arguing voraciously and pedantically over ideas, as long
I must admit, I haven't looked into arrows in a great deal of detail,
perhaps I should.
Daniel
2011/12/22 Ertugrul Söylemez :
> Daniel Waterworth wrote:
>
>> I made this simple state machine combinator library today. I think it
>> works as a simple example of a good use for GADTs.
>>
>> https://
I applaud the pedantry, but I must admit that the tone of the original
email is unusually harsh for the Haskell community, even though not so
harsh as to really make me (for example) scared.
On Sat, Dec 24, 2011 at 12:47 PM, Murray Campbell wrote:
> On Sat, Dec 24, 2011 at 08:54:43AM +0100, Yves
On Sat, Dec 24, 2011 at 08:54:43AM +0100, Yves Parès wrote:
>See that's typically the speech that scares people away from Haskell...
>--
>The ⥠is a lie.
>
>2011/12/24 Albert Y. C. Lai <[1]tre...@vex.net>
>
>> [ snip. ]
I find this sort of discussion is precisely what draws me t
On 24/12/11 18:41, Gregory Crosswhite wrote:
> On Dec 24, 2011, at 6:22 PM, Tony Morris wrote:
>
>> Wait what?
>>
>> I find it intriguing, helpful, provocative and potentially helpful toward
>> the common goal of helping others. I am interested in further commentary.
>> I'm not scared and you sho
On Dec 24, 2011, at 6:22 PM, Tony Morris wrote:
> Wait what?
>
> I find it intriguing, helpful, provocative and potentially helpful toward the
> common goal of helping others. I am interested in further commentary. I'm not
> scared and you shouldn't be either.
Asking honest questions is immin
On 24 Dec 2011, at 11:31, Albert Y. C. Lai wrote:
> So, on IRC in #haskell, from the same person, speaking on the same topic in
> the same context, in the same interval of 3 minutes (the first two sentences
> in the same minute):
>
> 1. a function f is strict if f ⊥ = ⊥
> 2. ⊥ represents any c
On 24/12/11 17:54, Yves Parès wrote:
> See that's typically the speech that scares people away from Haskell...
>
>
>
> ___
> Haskell-Cafe mailing list
> Haskell-Cafe@haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
Wait what?
I find it
33 matches
Mail list logo
