Tag
Type Theory
Type theory is a foundation for mathematics and a design discipline for programming languages at once, in which a proposition is a type and a proof is an inhabitant of it. Its practical consequence is that a sufficiently expressive type system rules out whole classes of program error before the program runs. Writing here uses type theory where it explains what a language guarantees, and where a borrow checker turns out to be a proof system.