Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re: RFC: A Perlesque Introduction to Haskell, Part One (DRAFT)

by Errto (Vicar)
on Jun 24, 2004 at 01:20 UTC ( #369215=note: print w/replies, xml ) Need Help??


in reply to RFC: A Perlesque Introduction to Haskell, Part One (DRAFT)

I had the pleasure of studying with Paul Hudak, the creator of Haskell, and I remain highly intrigued by the language. I like your introduction a lot. A couple of things I would add in the relevance-to-Perl department:

  • foldl is a lot like reduce in the List::Util module, which I believe will be a builtin in Perl 6.
  • I believe there is a Perl implementation of lazy lists. Update: Per the reply below, it is Language::Functional.
  • something I'm not thinking of

Also, I know you're trying to keep it reasonably short, but I think it would be really cool to show an example of constructing recursive polymorphic types, and the fact that you can have different data constructors with completely different type arguments. In other words, the fact that in Haskell you can implement large parts of your program logic just by the way you design your types.

I like the lazy factorial example. My favorite lazy expressions in Haskell were the fibonacci sequence:

fib :: [Integer] fib = 1 : 1 : zipWith (+) fib (tail fib)

and the function for inserting commas in a string of digits according to standard notation:

inschar n c = foldr1 (\s1 s2 -> s1 ++ c : s2) . map (take n) . takeWhile (not . null) . iterate (drop n) commaize :: String -> String commaize = reverse . inschar 3 ',' . reverse

Replies are listed 'Best First'.
Re^2: RFC: A Perlesque Introduction to Haskell, Part One (DRAFT)
by FoxtrotUniform (Prior) on Jun 24, 2004 at 01:25 UTC
    foldl is a lot like reduce in the List::Util module, which I believe will be a builtin in Perl 6.

    foldl is also a lot like foldl in the Language::Functional module. :-)

    Also, I know you're trying to keep it reasonably short, but I think it would be really cool to show an example of constructing recursive polymorphic types, and the fact that you can have different data constructors with completely different type arguments. In other words, the fact that in Haskell you can implement large parts of your program logic just by the way you design your types.

    I'm getting there... I'm planning to talk about Haskell's typing system in more detail in a later installment.

    --
    F o x t r o t U n i f o r m
    Found a typo in this node? /msg me
    % man 3 strfry

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://369215]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (7)
As of 2020-02-24 10:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What numbers are you going to focus on primarily in 2020?










    Results (104 votes). Check out past polls.

    Notices?