3 ms·
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
by bumeye 11y 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.
- AnimalMuppet 11y agoWell, all right, but then if you interpret the type system using a univalent approach, what do you get?