This is a toy implementation of Landin's ISWIM. It seeks to be as cool as Haskell, but is terribly underpowered yet.
- Small lambda calculus; just 8 constructions
- Extensible set of primitives
- Rank-1 polymorphism
- Hindley-Milner type system
- Decidable type inference
- Proven type safety
- Algebraic data types
- Type clasess (needs type annotations)
- Objects & object-oriented programming
- Imperative programming features
- Painless monadic code (State + Error)