|
|
|
|
|
|
by bumeye
4046 days ago
|
|
|
If anything, Haskell is based on lambda calculus. More particularly System F. As in any lambda calculus, you can interpret the type system as a category where the objects are types and the arrows are functions. Classes like Functor and Monad are based on this interpretation. |
|
|