MiniML
Aug ’26 – presentA small ML-style language implemented in Haskell, with a WebAssembly backend planned.
Hi! I am an undergraduate studying Computer Science and Mathematics at Purdue University. My interests are in theoretical computer science, especially algorithms and their mathematical foundations. Recently, I have worked on research problems with Prof. Kent Quanrud.
| in/agarmu | |
| GitHub | @agarmu |
| Resume | View PDF (PDF) |
| Emails | |
agarw396@purdue.edu(academic) |
projects / macro
A small ML-style language implemented in Haskell, with a WebAssembly backend planned.
A Scala 3 library for generative art, with shared sketches for Processing and the browser.
Profiling and optimizing AVL tree lookups in C/C++ and x86-64 assembly.
Learning formal proof in Coq and exploring univalent foundations at the 2024 School on Univalent Mathematics.
Colophon and design history of my personal website.
projects / micro
A date and time library and personal document templates for Typst.
A student-run reading group at Purdue on advanced topics in theoretical computer science, following Anupam Gupta's Advanced Algorithms course.
A tutorial on representing, printing, evaluating, and differentiating polynomials in Haskell.
A Go command-line tool that turns Data Mine assignment pages into Jupyter notebook skeletons.
exposition / notes
Here are some things I’ve written. Note that these notes and presentations may contain some errors or inaccuracies.
Rigorous Notes discussing the Multiplicative Weights Update framework (and applications).
Presentation notes prepared for a 15-minute presentation at the end of my directed reading of Montgomery and Vaughan's Multiplicative Number Theory I: Classical Theory and Apostol's Introduction to Analytic Number Theory; the talk itself was given on a blackboard.
exposition / slides
Presentation slides prepared for a 15-minute presentation at the end of my directed reading of Silverman and Tate's Rational Points on Elliptic Curves.
Presentation given for the SURF program during Summer 2025, covering one of the problems I worked on with Prof. Maji.
Short presentation delivered on Laplacian Solvers for my undergraduate algorithms class, taught by Prof. Kent Quanrud.
CS 250 (Computer Architecture)
Materials Development TA
Jan ’25 – May ’25I also offer individual tutoring.