Resume
Summary of Research Interests
My research interest spans PL theory — mainly type theory, formal methods, and verification. Additionally, I enjoy working on applying PL techniques to cryptography.
Skills: EasyCrypt, Rocq, Haskell, OCaml, C/++, Python
Education
- Ph.D., Computer Science, University of Massachusetts Lowell (2024 - Present) - Advisor: Dr. Paul Downen
- M.S., Computer Science, Boston University (2023 - 2024) - Advisor: Dr. Alley Stoughton
- B.S., Mathematics and Computer Science, UML (2019 - 2023)
Research Experience (Bachelors and Masters)
- Student Researcher - Formalizing the Wolfram Axiom using Double Negation Elimination
- Research Assistant - Formalizing Algorithm Bounds in the EasyCrypt Framework
- UML KCS Summer Scholars Program - Investigating Dependent-Intersection Types as a Kernel Language
- Undergraduate Math Thesis - A Deep Dive into the Curry-Howard Correspondence
Related Coursework
- COMP 4600: Effective Functional Programming
- COMP 3010: Organization of Programming Languages
- COMP 4900: Compiler Construction
- CS 599 G1: Formal Methods in Security and Privacy
- COMP 5901: Zero Knowledge Proofs (ZKP)
- MATH 6500: Category Theory
- COMP 4600: Programs, Logic, and Verification
- MATH 5130: Number Theory
- MATH 6510: Elliptic Curve Cryptography
- MATH 6510: Composition of Zero Knowledge Protocols
Projects
- Game of BlackJack, a parser, and Red-Black Trees in Haskell
- A minimalistic Interpreter and Type Checker for the λ-Calculus
- Implemented Row Level Security (RLS) in databases using Haskell LIO
- Formalizing the interactive ZKP for quadratic residues in EasyCrypt
Teaching Assistanship
- Organization of Programming languages (Fall 2024, Spring 2025, Fall 2025, Spring 2026)
- Compiler Construction (Fall 2025)
Committee
- Artifact evaluation committee (ICFP'25)
- Artifact evaluation committee (OOPSLA'26)