Shriya Thakur

Class of 2024

As a graduate student, I am passionate about exploring the intricate realms of programming languages (PL), with a specific focus on types, semantics and functional PL design. My research journey delves into the fascinating intersections of theorem proving, algorithms, logic and simply typed lambda calculus. In my previous work, I undertook the challenge of extending Piforall's type checker to incorporate support for dependent intersection types, demonstrating my proficiency in Haskell. Additionally, I have worked a little on the Curry–Howard correspondence, unraveling the profound connections between logic and computation. Currently, leveraging theorem provers like EasyCrypt, I am utilizing their bounds framework to verify algorithm bounds. My academic pursuits are driven by a deep curiosity to explore the theoretical foundations of computer science and logic, and I am excited to contribute to the evolving landscape of programming languages and formal methods.