Explores identity and equality types in type theory, contrasting definitional vs. propositional equality and their role in proofs.
Explores categorical models for dependent type theory, connecting lambda calculus to fibrations and sections in locally cartesian closed categories.
An introduction to Lean, a programming language for formalizing mathematics, using a simple proof of 2=2 as an example.
An exploratory guide to understanding Monads in functional programming, using Swift examples to explain the abstract concept and its practical applications.
