hub.darcs.net :: olf -> haskell_for_mathematicians -> changes

We study the category of bifinite domains and show that virtually any type constructible in Haskell is semantically a bifinite domain. (We do not cover more involved cases such that mutual or multi-parameter type recursion.)

We explain what lazyness of data constructors do to a semantic domain, what is the difference between a data and a newtype declaration and how to use bangs (!) in a data declaration.

renamed haskell_for_algebraicists to haskell_for_algebraists, renamed haskell_for_analysists to haskell_for_analysts

Haskell for Mathematicians is still a work in progress, but the current state contains enough substance to be enjoyable. You can load each chapter .lhs file in ghci and build the documentation by running latex haskell_for_mathematicians.tex