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

Thanks for all your help, folks.

My plan from here is to work through successively more complex examples, drawing on more and more features of Haskell as I go along (and possibly writing "Haskellish Perl" alongside the Haskell). I was thinking of moving on to a Towers of Hanoi solver from factorial, and from there to a Huffman encoder/decoder. Any other suggestions?

--
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

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

Replies are listed 'Best First'.
Re^2: RFC: A Perlesque Introduction to Haskell, Part One (DRAFT)
by tmoertel (Chaplain) on Jun 25, 2004 at 01:36 UTC
    Since you axed, here are a few more suggestions for future topics. You might want to see if you can work in the idea of combinators, perhaps using simple parsers as a subject domain from which to draw examples. Then you could go further, if you wanted, into domain-specific embedded languages, drawing on the hyper-cool QuickCheck or Parsec or HaskellDB.

    While not particularly advanced, list comprehensions are cool stuff, especially when used recursively. (See Koen Claessen's selections/permutations implementation (scroll for it), for a fun example.)

    Cheers,
    Tom