Towards the Integration of an Intuitionistic First-Order Prover into Coq. - Fabian Kunze (HaTT@IJCAR, 2016)

Formal Small-Step Verification of a Call-by-Value Lambda Calculus Machine. - Fabian Kunze; Gert Smolka; Yannick Forster 002 (APLAS, 2018)

A Certifying Extraction with Time Bounds from Coq to Call-By-Value Lambda Calculus. - Yannick Forster 002; Fabian Kunze (ITP, 2019)

A certifying extraction with time bounds from Coq to call-by-value $λ$-calculus. - Yannick Forster 002; Fabian Kunze (CoRR, 2019)

Verified programming of Turing machines in Coq. - Yannick Forster 002; Fabian Kunze; Maxi Wuttke (CPP, 2020)

The MetaCoq Project. - Matthieu Sozeau; Abhishek Anand; Simon Boulier; Cyril Cohen; Yannick Forster 002; Fabian Kunze; Gregory Malecha; Nicolas Tabareau; Théo Winterhalter (J. Autom. Reason., 2020)

The weak call-by-value λ-calculus is reasonable for both time and space. - Yannick Forster 002; Fabian Kunze; Marc Roth (Proc. ACM Program. Lang., 2020)

A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus. - Yannick Forster 002; Fabian Kunze; Gert Smolka; Maxi Wuttke (ITP, 2021)

Mechanising Complexity Theory: The Cook-Levin Theorem in Coq. - Lennard Gäher; Fabian Kunze (ITP, 2021)

Synthetic Kolmogorov Complexity in Coq. - Yannick Forster 002; Fabian Kunze; Nils Lauermann (ITP, 2022)