I'm a postdoctoral researcher in programming languages at the Max Planck Institute for Software Systems in Kaiserslautern and Saarbrücken. I work on programming languages from a type-systems perspective—from checking program properties with refinement types to incremental computation. Previously, I was a postdoc with Brigitte Pientka's Computation and Logic Group at McGill University in Montreal, where I worked on Beluga. I received my Ph.D. from Carnegie Mellon, where I worked with Frank Pfenning on refined type systems for programming languages, which allow programmers to state, and compilers to check, more invariants about programs. Go ahead, read my dissertation. For all the scandalous details about my professional life, see my CV (last updated November 2012). I recently became a permanent resident of Canada.

Electric trolleybus in Vancouver

Research

• Bidirectional typechecking, type inference and polymorphism, with Neel Krishnaswami.
• Self-adjusting computation, with Umut Acar, Yan Chen and Matthew Hammer.
• Better elaboration of unrestricted intersection and union types.

News

June-September 2012: The final version of "Elaborating unrestricted intersection and union types" (ICFP 2012) is available, along with a video of the conference talk. I presented some work on type annotations for languages with intersection types at ITRS ’12.

January 2012: Our paper describing an implementation of the theory developed in our ICFP ’11 paper on implicit self-adjusting computation was accepted to PLDI ’12.

January 2011: The final version of a paper at Intersection Types and Related Systems (ITRS 2010) has appeared in EPTCS.

August 2009: I presented Greedy bidirectional polymorphism at the ML Workshop in Edinburgh.

All papers and publications

Teaching

Travel

Ada Initiative

Random bits

Note to industrial recruiters

Contact