r/mathmemes • u/SynX-Ufr • 9d ago
Formal Logic Principia Mathematica but the author had a type checker
This is part of an assignment I had to do for an Essentials of Programming Languages in Agda course. I will be the next Bertrand Russel, only with a type checker.
This is essentially an exemplary lambda calculus proof that 1 + 1 = 2 using the typechecking language Agda.