| ProTeM: A proof term manipulator (system description) C Kohl, A Middeldorp 3rd International Conference on Formal Structures for Computation and …, 2018 | 6 | 2018 |
| Formalizing Almost Development Closed Critical Pairs (Short Paper) C Kohl, A Middeldorp 14th International Conference on Interactive Theorem Proving (ITP 2023), 2023 | 5 | 2023 |
| A formalization of the development closedness criterion for left-linear term rewrite systems C Kohl, A Middeldorp Proceedings of the 12th ACM SIGPLAN International Conference on Certified …, 2023 | 4 | 2023 |
| Composing proof terms C Kohl, A Middeldorp Automated Deduction–CADE 27: 27th International Conference on Automated …, 2019 | 3 | 2019 |
| Development Closed Critical Pairs: Towards a Formalized Proof C Kohl, A Middeldorp Proc. 11th International Workshop on Confluence, 2022 | 2 | 2022 |
| CoCo 2022 Participant: CeTA 2.42 C Kohl, R Thiemann, A Middeldorp IWC 1, 1, 2022 | 1 | 2022 |
| CeTA–A certifier for termCOMP 2022 C Kohl, R Thiemann Proc. 18th International Workshop on Termination, 2022 | 1 | 2022 |
| Formalizing Confluence and Commutation Criteria Using Proof Terms C Kohl, A Middeldorp 12th International Workshop on Confluence, 49, 2023 | | 2023 |
| The Lambda Calculus—Historical Developments S Frontull, C Kohl, F Mitterwallner | | 2022 |
| Proof Terms C Kohl University of Innsbruck, 2019 | | 2019 |
| Residuals Revisited C Kohl, A Middeldorp Joint Proceedings of HOR 2019 and IWC 2019 (with system descriptions from …, 2019 | | 2019 |
| Monads in Computer Science C Kohl, C Schwaiger | | |
