Parallel Haskell Digest
===
Edition 5
2011-08-31
Hello Haskellers!
Eric here, reprising my role as Parallel Haskell Digester. Many thanks
to Nick for good stewardship of the digest and nice new directions for
the future. This month we have Erlang PhDs (and a postdoc), new
On Wed, Aug 31, 2011 at 03:39, Eric Y. Kow e...@well-typed.com wrote:
(Food for thought: why `parList rseq` instead of `parList r0`?
Reply to the Haskell-Cafe posting if you think you know why!)
Because with `r0` you're liable to just parallel evaluate to the thunk
containing the computation
On Sat, 27 Aug 2011, Sönke Hahn wrote:
Hi!
I was reading through the Typeclassopedia ([1]) and I was wondering which
type could be an instance of Pointed, but not of Applicative. But I can't
think of one. Any ideas?
(Identity :+: Store s) is a comonad that is also instance of Pointed, but
On Wed, 31 Aug 2011, rocon...@theorem.ca wrote:
On Sat, 27 Aug 2011, Sönke Hahn wrote:
Hi!
I was reading through the Typeclassopedia ([1]) and I was wondering which
type could be an instance of Pointed, but not of Applicative. But I can't
think of one. Any ideas?
(Identity :+: Store s)
Here's a repository that demonstrates Lisp written in Haskell running on the
iPad via Haskell-iPhone (see http://www.haskell.org/mailman/listinfo/iphone
):
https://github.com/dpp/LispHaskellIPad
The library is mature and the author is tremendously responsive on the
Haskell-iPhone list.
On Tue,
On 30/08/2011 09:49 PM, Jerzy Karczmarczuk wrote:
Knuth admitted that he had learnt a lot while teaching things he already
knew. So did Feynman. And Landau.
As counter-intuitive as it may seem, explaining something to somebody
else forces you to order your thoughts and think through the
On 30/08/2011 07:58 PM, Jerzy Karczmarczuk wrote:
I think I know several mathematicians who learning that a person asking
for help begins with trying to distinguish between knowledgeable, and
those who just think they are, will simply - to say it politely - refuse
to engage.
I didn't intend
Statistics questions tend to end up on http://stats.stackexchange.com/, so you
could try that, too. It's a well-informed community.
Jack Henahan
jhena...@uvm.edu
==
Computer science is no more about computers than astronomy is about telescopes….
-- Michael R. Fellows and Ian Parberry
==
Studying Wadler's Comprehending Monads and Theorems for free!,
I've been unable to derive law (iv) and I'm not sure about (iii). Will
appreciate a pointer to similar examples or a massive hint. Here's my
attempt at (iii):
map f . unit x = map f [x]
= [f x]
Very interesting. But for my taste I would do a cosmetic change. I
tend to find it more readable when function calls are written
vertically when they have with a great number of parameters or a lot
of parens like here.
listof4tuples xs = zip4
xs
(tail xs)
In that case, maybe we could just get rid of the helper function and just write:
g (t:u:v:w:[]) = t*u*v*w
g (t:u:v:w:ws) = max (t*u*v*w) (g (u:v:w:ws))
By the way, what make you think that mutual recursion would use more
stack space than single recursion?
Oscar
On Tue, Aug 30, 2011 at 7:19 PM,
Hi guys,
I want to compare data structure between Haskell, Java, Lisp and C. I am
wondering if I could compare list comprehention in haskell with the vector
class in Java, macros in common lisp and dynamic arrays in C.
Thanks,
Julita
___
Haskell-Cafe
Welcome to issue 197 the HWN, a newsletter covering developments in the
Haskell community. This release covers the week of August 21 to 27,
2011.
[1] http://goo.gl/8hDku
Announcements
Liyang HU announced HakkaTaikai, a Haskell hackathon in Tokyo, on
Sunday September 25th, 2011.
Hi, all
parseExp (,) 3 4 =
Right (AppE (AppE (ConE GHC.Unit.(,)) (LitE (IntegerL 3))) (LitE
(IntegerL 4)))
where's GHC.Unit.(,) ?
Many thanks
best, bob
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 1 September 2011 11:19, bob zhang bobzhang1...@gmail.com wrote:
Hi, all
parseExp (,) 3 4 =
Right (AppE (AppE (ConE GHC.Unit.(,)) (LitE (IntegerL 3))) (LitE
(IntegerL 4)))
where's GHC.Unit.(,) ?
GHC.Unit (like all GHC.* modules) is an internal module used by GHC to
implement base,
于 11-8-31 下午10:01, Ivan Lazar Miljenovic 写道:
On 1 September 2011 11:19, bob zhangbobzhang1...@gmail.com wrote:
Hi, all
parseExp (,) 3 4 =
Right (AppE (AppE (ConE GHC.Unit.(,)) (LitE (IntegerL 3))) (LitE
(IntegerL 4)))
where's GHC.Unit.(,) ?
GHC.Unit (like all GHC.* modules) is an internal
于 11-8-31 下午10:01, Ivan Lazar Miljenovic 写道:
On 1 September 2011 11:19, bob zhangbobzhang1...@gmail.com wrote:
Hi, all
parseExp (,) 3 4 =
Right (AppE (AppE (ConE GHC.Unit.(,)) (LitE (IntegerL 3))) (LitE
(IntegerL 4)))
where's GHC.Unit.(,) ?
GHC.Unit (like all GHC.* modules) is an internal
On 1 September 2011 12:29, bob zhang bobzhang1...@gmail.com wrote:
于 11-8-31 下午10:01, Ivan Lazar Miljenovic 写道:
On 1 September 2011 11:19, bob zhangbobzhang1...@gmail.com wrote:
Hi, all
parseExp (,) 3 4 =
Right (AppE (AppE (ConE GHC.Unit.(,)) (LitE (IntegerL 3))) (LitE
(IntegerL 4)))
于 11-8-31 下午10:35, Ivan Lazar Miljenovic 写道:
May I ask though why you're trying to use (,) as an explicit
constructor in a quasi-quotation?
Thanks for your reply. I just generated some code
this way, and it does not work.
this style is common in applicative functor, right?
Best, bob
19 matches
Mail list logo
