Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

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

by tmoertel (Chaplain)
on Jun 25, 2004 at 01:36 UTC ( #369530=note: print w/replies, xml ) Need Help??


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

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

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

Log In?
Username:
Password:

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

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










    Results (128 votes). Check out past polls.

    Notices?