Haskell

• A “competitor” to ML

• We won’t do a full language description, but will focus on “interesting” differences

  • Lazy evaluation instead of eager
    • Purely side-effect-free
  • Type classes for more flexible polymorphic type checking
  • Unparameterized modules

Previous slide

Next slide

Back to first slide

View graphic version