Models of (Dependent) Type Theory | Bartosz Milewski's Programming Cafe
Previously: (Weak) Factorization Systems. It’s been known since Lambek that typed lambda calculus can be modeled in a cartesian closed category, CCC. Cartesian means that you can form product…| Bartosz Milewski's Programming Cafe
