Mathematical foundations of computation. Type theory, proof assistants, and verified software systems.
Dependent types, linear types, foundations
Coq, Lean, Agda, theorem proving
Correctness proofs, formal methods
Semantics, design, implementation
The Formal Computing domain explores mathematical foundations. Type theory, proof assistants, and formal verification for software certainty.
From proving algorithm properties to designing type systems. Deep intellectual challenges at the intersection of math and computing.