1. Formalisation in Constructive Type Theory of Barendregt's Variable Convention for Generic Structures with Binders;Electronic Proceedings in Theoretical Computer Science;2018-07-03
2. Visitors unchained;Proceedings of the ACM on Programming Languages;2017-08-29
3. Modular reifiable matching: a list-of-functors approach to two-level types;ACM SIGPLAN Notices;2016-01-28
4. A unified treatment of syntax with binders;Journal of Functional Programming;2012-08-15
5. Binders unbound;Proceedings of the 16th ACM SIGPLAN international conference on Functional programming;2011-09-19