I am broadly interested in connections between mathematical logic and category theory, with an aim towards applications to computational complexity. My current research is on defining comonads that provide categorical semantics for logical and combinatorial (co)-resources. These comonads capture logical equivalences and combinatorial invariants of graphs/hypergraphs in a syntax-free, elegant, and compositional framework.
Completed my BA in pure Mathematics at University of California, Berkeley in 2015.
Completed the MSc in Mathematics and Foundations of CS (MFocS) program with distinction in 2017.
I started my DPhil researching comonadic semantics for logical equivalence and graph-theoretic parameters in 2019. Between my masters and DPhil, I worked as a software engineer developing in Haskell and using the latest functional programming technologies/techniques.
Relating Structure and Power: Comonadic Semantics for Computational Resources
Samson Abramsky and Nihil Shah
In Dan Ghica and Achim Jung, editors, 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Vol. 119 of Leibniz International Proceedings in Informatics (LIPIcs). Pages 2:1–2:17. Dagstuhl‚ Germany. 2018. Schloss Dagstuhl–Leibniz−Zentrum fuer Informatik.