1. Wellfounded recursion with copatterns
2. Normalization by evaluation for sized dependent types
3. Benedikt Ahrens , Paolo Capriotti , and Régis Spadotti . 2015 . Non-Wellfounded Trees in Homotopy Type Theory. In 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 38) , Thorsten Altenkirch (Ed.). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 17–30. https://doi.org/10.4230/LIPIcs.TLCA. 2015.17 Benedikt Ahrens, Paolo Capriotti, and Régis Spadotti. 2015. Non-Wellfounded Trees in Homotopy Type Theory. In 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 38), Thorsten Altenkirch (Ed.). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 17–30. https://doi.org/10.4230/LIPIcs.TLCA.2015.17
4. An indexed model of recursive types for foundational proof-carrying code
5. A very modal model of a modern, major, general type system