No. | Title | Author | Year |
---|---|---|---|

1 | Synthetic Kolmogorov Complexity in Coq | Forster, Yannick et al. | 2022 |

2 | A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus | Forster, Yannick et al. | 2021 |

3 | Mechanising Complexity Theory: The Cook-Levin Theorem in Coq | Gäher, Lennard et al. | 2021 |

4 | A Certifying Extraction with Time Bounds from Coq to Call-By-Value Lambda Calculus | Forster, Yannick et al. | 2019 |

Current Page :
| |

Number of result pages: | 1 |

Number of documents: | 4 |