sa1

*Sanjoy Das started off by giving an introduction to Haskell.

**Two models on which programming languages are based - the imperative model, and the languages that operate on re-write rules (e.g. Haskell). 
** Haskell is referentially transparent.
** The compiler blindly applies a few re-write rules.
** A virtual type called real world. Each time there is an input, the compiler maps the previous real world to the present real world.
** Referential transparency.
** (Anurag Priyam elaborates on functional and declarative languages)
** Scheme is not referentially transparent.