I'm a Research Associate (non-tenure-track faculty) at the UBC Department of Computer Science in Vancouver. I work on programming languages from a type-systems perspective—from checking program properties with refinement types to incremental computation.
I was previously a researcher in Programming Languages and Verification at the Max Planck Institute for Software Systems, and a postdoc with Brigitte Pientka's Computation and Logic Group at McGill, where I worked on Beluga.
I received my Ph.D. from Carnegie Mellon, where I worked with Frank Pfenning on my dissertation on refined type systems for programming languages, which allow programmers to state, and compilers to check, more invariants about programs. For more details, see my CV (last updated August 2015).
Electric trolleybus in Vancouver.
"Sums of Uncertainty: Refinements go gradual" has been accepted to POPL 2017. My coauthor, Khurram A. Jafery, has received the 2017 CRA Outstanding Undergraduate Researcher award.
Completed a draft on extensible datasort refinements and a draft on refinement types for incremental computation.
2015: "Incremental computation with names" passed both phases of reviewing and will appear at OOPSLA 2015.
"Elaborating evaluation-order polymorphism" will appear at ICFP 2015.
Completed a draft on bidirectional typechecking for GADTs and a draft on evaluation-order polymorphism.
2014: I moved from Kaiserslautern to Vancouver.
Two papers have been accepted to the Journal of Functional Programming and will appear in 2014: an extended version of my ICFP 2012 paper on intersection and union types, and an extended version of our ICFP 2011 paper on implicit self-adjusting computation.
2013: The paper "Complete and easy bidirectional typechecking for higher-rank polymorphism" was accepted to ICFP 2013, and the final version is on the arXiv.
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.
Our paper describing an implementation of the theory developed in our ICFP ’11 paper on implicit self-adjusting computation was accepted to PLDI ’12.