No. Title Author Year
1 Constructive and Synthetic Reducibility Degrees: Post’s Problem for Many-One and Truth-Table Reducibility in Coq Forster, Yannick et al. 2023
2 Synthetic Kolmogorov Complexity in Coq Forster, Yannick et al. 2022
3 A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus Forster, Yannick et al. 2021
4 Church’s Thesis and Related Axioms in Coq’s Type Theory Forster, Yannick 2021
5 A Certifying Extraction with Time Bounds from Coq to Call-By-Value Lambda Calculus Forster, Yannick et al. 2019
6 Hilbert's Tenth Problem in Coq Larchey-Wendling, Dominique et al. 2019
Current Page :
Number of result pages: 1
Number of documents: 6

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI