to be handed in Find out what the "extra" functions in the Monad class are used for (Monads are defined in the standard libraries of Haskell), and hand in your own description in the format described above
Tu, Sep 16
continue studying the monad tutorial
try to implement some graph algorithm that you can not easily express in Haskell (like union/find) and express this using STRef's
read the finanicial combinators paper
Thu, Sep 18
To be handed in You may have noticed that the do-notation has a lot in common with the notation for list comprehensions. This is not a coincidence since list can me made and instance of the class Monad too. Give the proper instance declaration and explain in your own words why this works, and explain the correspondence. Also look up the laws that hold for monads and show that they hold for the implementation you have given.