Open-source organization for theoretical computing and formal methods. Publishing research, maintaining proof assistants, and advancing the foundations of computer science.
Exploring dependent types, homotopy type theory, and their applications to verified software construction and mathematical proof formalization.
Developing automated and interactive techniques for proving correctness of programs, protocols, and hardware designs against formal specifications.
Investigating proof search, satisfiability, and the computational complexity of logical reasoning in classical and constructive frameworks.
| Date | Title | Authors | Status |
|---|---|---|---|
| 2026-03-10 | Cubical Type Theory with Indexed Higher Inductive Types | Nakamura, Chen | published |
| 2026-03-07 | Automated Verification of Distributed Consensus Protocols | Klein, Okafor | preprint |
| 2026-03-02 | Proof-Relevant Semantics for Constructive Modal Logic | Larsen, Park | published |
| 2026-02-25 | Linear Types and Resource-Aware Compilation | Nakamura, Reyes | draft |
| 2026-02-18 | SAT Solving with Proof Certificates in Lean 4 | Chen, Klein | published |
Interactive proof assistant for dependent type theory with tactic automation.
RepositoryModel checker for concurrent protocols with compositional reasoning support.
Repository