RE: [Haskell-cafe] Strict and non-strict vs eager and lazy, was C onfused about Cyclic struture

From: Bernard Pope [mailto:bjpop@cs.mu.OZ.AU]
I should have mentioned this paper:
@article{Tremblay01, author= {G. Tremblay}, title= {Lenient evaluation is neither strict nor lazy}, journal= {Computer Languages}, volume= {26}, number= {1}, pages= {43--66}, year= {2001}, }
(however I think he says that Haskell is lazy!)
Thanks. Do you have a link to a free (beer) version? I don't have an ACM subscription. I found this related paper, which was useful: How Much Non-strictness do Lenient Programs Require? http://www.cs.ucsb.edu/~schauser/papers/95-fpca.ps (unrelated) BTW, I found this, which sounds similar to the STM in GHC 6.4. Again, does anyone have a link to a free version? P. Tinker and M. Katz. Parallel execution of sequential Scheme with ParaTran. http://portal.acm.org/citation.cfm?doid=62678.62682 Alistair. ----------------------------------------- ***************************************************************** Confidentiality Note: The information contained in this message, and any attachments, may contain confidential and/or privileged material. It is intended solely for the person(s) or entity to which it is addressed. Any review, retransmission, dissemination, or taking of any action in reliance upon this information by persons or entities other than the intended recipient(s) is prohibited. If you received this in error, please contact the sender and delete the material from any computer. *****************************************************************

On Tue, 2005-07-19 at 09:03 +0100, Bayley, Alistair wrote:
From: Bernard Pope [mailto:bjpop@cs.mu.OZ.AU]
I should have mentioned this paper:
@article{Tremblay01, author= {G. Tremblay}, title= {Lenient evaluation is neither strict nor lazy}, journal= {Computer Languages}, volume= {26}, number= {1}, pages= {43--66}, year= {2001}, }
(however I think he says that Haskell is lazy!)
Thanks. Do you have a link to a free (beer) version? I don't have an ACM subscription.
No. I only have a paper copy lying around somewhere.
I found this related paper, which was useful: How Much Non-strictness do Lenient Programs Require? http://www.cs.ucsb.edu/~schauser/papers/95-fpca.ps
I haven't read that. Thanks for the pointer. There was a discussion related to this topic on the types list a while back. Here is a link to the conclusion: http://lists.seas.upenn.edu/pipermail/types-list/2004/000352.html Bernie.
participants (2)
-
Bayley, Alistair
-
Bernard Pope