معرفی
Matt Superdock is an Assistant Professor in the Department of Computer Science at Rhodes College, Memphis, Tennessee. He holds a Ph.D. in Algorithms, Combinatorics, and Optimization from Carnegie Mellon University (2021), advised by Florian Frick. His research focuses on Interactive Theorem Proving (formal proofs, dependently typed data, metacircular languages) and Topological Combinatorics (Borsuk-Ulam extensions, simplicial complexes, finite projective planes).
Recent work includes collaborations on Vietoris-Rips complexes, fundamental group constructions, and applications of topological methods in combinatorics. Publications appear in Discrete Mathematics, Journal of Topology and Analysis, and Journal of Combinatorial Theory. He teaches advanced algorithms, data structures, and programming fundamentals at Rhodes. Previously, he taught AP Calculus and Computer Science at Charles E. Jordan High School.
Software contributions include vim-agda (asynchronous type-checking for Agda), agda-unused (code analysis tool), and vim-foldout (syntax-aware folding in Vim).
