| No. |
Title |
Author |
Year |
| 1 |
Combinatory Logic and Lambda Calculus Are Equal, Algebraically |
Altenkirch, Thorsten et al. |
2023 |
| 2 |
For the Metatheory of Type Theory, Internal Sconing Is Enough |
Bocquet, Rafaël et al. |
2023 |
| 3 |
The Münchhausen Method in Type Theory |
Altenkirch, Thorsten et al. |
2023 |
| 4 |
Internal Strict Propositions Using Point-Free Equations |
Donkó, István et al. |
2022 |
| 5 |
A Syntax for Mutual Inductive Families |
Kaposi, Ambrus et al. |
2020 |
| 6 |
For Finitary Induction-Induction, Induction Is Enough |
Kaposi, Ambrus et al. |
2020 |
| 7 |
Gluing for Type Theory |
Kaposi, Ambrus et al. |
2019 |
| 8 |
LIPIcs, Volume 104, TYPES'17, Complete Volume |
Abel, Andreas et al. |
2019 |
| 9 |
A Syntax for Higher Inductive-Inductive Types |
Kaposi, Ambrus et al. |
2018 |
| 10 |
Front Matter, Table of Contents, Preface, Conference Organization |
Abel, Andreas et al. |
2018 |
| 11 |
Towards a Cubical Type Theory without an Interval |
Altenkirch, Thorsten et al. |
2018 |
| 12 |
Normalisation by Evaluation for Dependent Types |
Altenkirch, Thorsten et al. |
2016 |
