I’ll be giving a talk entitled “Set Constraints, Pattern Match Analysis, and SMT” at TFP 2019 in Vancouver! It’s based on a draft paper, which can be found on arxiv. You can also view the slides for the talk.
My research is centred around type systems for making code more reliable, and in the theory and practice of making such systems easier to use. In particular, I'm interested in mixing dependent types with gradual types and improving error messages for dependently-typed languages. I've also researched the properties of reversal-bounded counter automata.
The paper version of my Master’s thesis is now live! You can read the open access article here.
The paper talks about ways to represent higher order unification for dependent types as constraint graphs. With this format, heuristics can be used to locate errors, and can identify when multiple locations are involved in a single error.
I’ve made a package that integrates the Ott Semantic Modeling tool into Visual Studio Code. Right now, it supports syntax highlighting, and showing error messages inline, but I hope to eventually add support for source formatting, and prettifying symbols.
You can view the package here.
Pull requests, collaboration, suggestions are all welcome!
I recently had to make a LaTeX slideshow, and was disappointed with how awful most of the themes looked. I found the Metropolis theme, which was quite nice and modern, and I adapted it to have the UBC colours and logo.
You can see it live on Overleaf.
Or you can see the code on Github.
Suggestions or Pull requests are welcome!
If you’re going to a conference, or even making a presentation in a class with lots of formulas, this could come in handy.