[Haskell-cafe] Why Perl is more learnable than Haskell

Dave Feustel dfeustel at mindspring.com
Wed Apr 11 11:02:30 EDT 2007



-----Original Message-----
>From: "Mark T.B. Carroll" <mark at ixod.org>
>Sent: Apr 11, 2007 10:18 AM
>To: kynn <kynnjo at gmail.com>
>Cc: haskell-cafe at haskell.org
>Subject: Re: [Haskell-cafe] Why Perl is more learnable than Haskell
>
>Sorry to hear of your struggles. There has been a lot of work lately on
>writing Haskell tutorials but there's still a long way to go,
>unfortunately, as I discovered when I tried recently to find the
>collection of sample code fragments on the wiki that I'm sure are around
>somewhere.

A serious omission in Haskell tutorials is a collection of examples of how to 
write Haskell solutions for problems that would use arrays in any imperative language.
I see that arrays can be defined in Haskell, but I don't see their use as
computationally efficient in Haskell.



http://RepublicBroadcasting.org - Because You CAN Handle The Truth!
http://iceagenow.com - Because Global Warming Is A Scam!




More information about the Haskell-Cafe mailing list