Fabian Kunze

According to our database1, Fabian Kunze authored at least 10 papers between 2016 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Synthetic Kolmogorov Complexity in Coq.
Proceedings of the 13th International Conference on Interactive Theorem Proving, 2022

2021
Mechanising Complexity Theory: The Cook-Levin Theorem in Coq.
Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus.
Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

2020
The weak call-by-value λ-calculus is reasonable for both time and space.
Proc. ACM Program. Lang., 2020

The MetaCoq Project.
J. Autom. Reason., 2020

Verified programming of Turing machines in Coq.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

2019
A certifying extraction with time bounds from Coq to call-by-value $λ$-calculus.
CoRR, 2019

A Certifying Extraction with Time Bounds from Coq to Call-By-Value Lambda Calculus.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018
Formal Small-Step Verification of a Call-by-Value Lambda Calculus Machine.
Proceedings of the Programming Languages and Systems - 16th Asian Symposium, 2018

2016
Towards the Integration of an Intuitionistic First-Order Prover into Coq.
Proceedings of the Proceedings First International Workshop on Hammers for Type Theories, 2016


  Loading...