Yannick Forster

Available identifiers

Publication	Date of Publication	Type
Constructive and synthetic reducibility degrees: Post's problem for many-one and truth-table reducibility in Coq	2024-09-25	Paper
Synthetic Kolmogorov complexity in coq	2024-07-15	Paper
Formal small-step verification of a call-by-value lambda calculus machine	2023-08-02	Paper
Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions	2023-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q6099607	2023-06-20	Paper
A certifying extraction with time bounds from Coq to call-by-value $\lambda$-calculus	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5094119	2022-08-02	Paper
Hilbert's Tenth Problem in Coq	2022-07-18	Paper
Parametric Church's thesis: synthetic computability without choice	2022-07-01	Paper
Completeness theorems for first-order logic analysed in constructive type theory	2022-02-08	Paper
Parametric Church's Thesis: Synthetic Computability without Choice	2021-12-22	Paper
The \textsc{MetaCoq} project	2020-11-02	Paper
Completeness theorems for first-order logic analysed in constructive type theory	2020-05-06	Paper
Call-by-value lambda calculus as a model of computation in Coq	2019-08-21	Paper
Verification of PCP-related computational reductions in Coq	2018-10-04	Paper
Weak call-by-value lambda calculus as a model of computation in Coq	2018-01-04	Paper

This page was built for person: Yannick Forster