default search action
Yannick Forster 0002
Person information
- affiliation: INRIA Nantes, France
- affiliation (former): Saarland University, Germany
- affiliation (former): University of Cambridge, UK
Other persons with the same name
- Yannick Forster 0001
— BMW Group, Germany (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Yannick Forster
Verified Extraction from Coq to OCaml. Proc. ACM Program. Lang. 8(PLDI): 52-75 (2024) - [c21]Yannick Forster, Dominik Kirst, Niklas Mück:
The Kleene-Post and Post's Theorem in the Calculus of Inductive Constructions. CSL 2024: 29:1-29:20 - [c20]Liron Cohen
Separating Markov's Principles. LICS 2024: 28:1-28:14 - 2023
- [c19]Yannick Forster
Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions. APLAS 2023: 155-181 - [c18]Yannick Forster
A Computational Cantor-Bernstein and Myhill's Isomorphism Theorem in Constructive Type Theory (Proof Pearl). CPP 2023: 159-166 - [c17]Yannick Forster
Constructive and Synthetic Reducibility Degrees: Post's Problem for Many-One and Truth-Table Reducibility in Coq. CSL 2023: 21:1-21:21 - [i11]Yannick Forster, Dominik Kirst, Niklas Mück:
Oracle Computability and Turing Reducibility in the Calculus of Inductive Constructions. CoRR abs/2307.15543 (2023) - 2022
- [j8]Dominique Larchey-Wendling, Yannick Forster:
Hilbert's Tenth Problem in Coq (Extended Version). Log. Methods Comput. Sci. 18(1) (2022) - [c16]Yannick Forster
Synthetic Kolmogorov Complexity in Coq. ITP 2022: 12:1-12:19 - [c15]Yannick Forster
Parametric Church's Thesis: Synthetic Computability Without Choice. LFCS 2022: 70-89 - 2021
- [b1]Yannick Forster:
Computability in constructive type theory. Saarland University, Germany, 2021 - [j7]Yannick Forster
Completeness theorems for first-order logic analysed in constructive type theory. J. Log. Comput. 31(1): 112-151 (2021) - [c14]Yannick Forster
Church's Thesis and Related Axioms in Coq's Type Theory. CSL 2021: 21:1-21:19 - [c13]Yannick Forster
A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus. ITP 2021: 19:1-19:20 - [i10]Yannick Forster:
Parametric Church's Thesis: Synthetic Computability without Choice. CoRR abs/2112.11781 (2021) - 2020
- [j6]Matthieu Sozeau, Abhishek Anand, Simon Boulier, Cyril Cohen
The MetaCoq Project. J. Autom. Reason. 64(5): 947-999 (2020) - [j5]Matthieu Sozeau, Simon Boulier, Yannick Forster
Coq Coq correct! verification of type checking and erasure for Coq, in Coq. Proc. ACM Program. Lang. 4(POPL): 8:1-8:28 (2020) - [j4]Yannick Forster
The weak call-by-value λ-calculus is reasonable for both time and space. Proc. ACM Program. Lang. 4(POPL): 27:1-27:23 (2020) - [c12]Yannick Forster
Verified programming of Turing machines in Coq. CPP 2020: 114-128 - [c11]Simon Spies, Yannick Forster
Undecidability of higher-order unification formalised in Coq. CPP 2020: 143-157 - [c10]Yannick Forster
Coq à la carte: a practical approach to modular syntax with binders. CPP 2020: 186-200 - [c9]Yannick Forster
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory. LFCS 2020: 47-74 - [i9]Dominique Larchey-Wendling, Yannick Forster
Hilbert's Tenth Problem in Coq. CoRR abs/2003.04604 (2020) - [i8]Yannick Forster
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory (Extended Version). CoRR abs/2006.04399 (2020) - [i7]Bohdan Liesnikov, Marcel Ullrich, Yannick Forster
Generating induction principles and subterm relations for inductive types using MetaCoq. CoRR abs/2006.15135 (2020) - [i6]Yannick Forster:
Church's thesis and related axioms in Coq's type theory. CoRR abs/2009.00416 (2020)
2010 – 2019
- 2019
- [j3]Yannick Forster
Call-by-Value Lambda Calculus as a Model of Computation in Coq. J. Autom. Reason. 63(2): 393-413 (2019) - [j2]Yannick Forster
On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control. J. Funct. Program. 29: e15 (2019) - [c8]Yannick Forster
On synthetic undecidability in coq, with an application to the entscheidungsproblem. CPP 2019: 38-51 - [c7]Yannick Forster
Certified undecidability of intuitionistic linear logic via binary stack machines and minsky machines. CPP 2019: 104-117 - [c6]Yannick Forster
Call-by-push-value in coq: operational, equational, and denotational theory. CPP 2019: 118-131 - [c5]Yannick Forster
A Certifying Extraction with Time Bounds from Coq to Call-By-Value Lambda Calculus. ITP 2019: 17:1-17:19 - [c4]Dominique Larchey-Wendling
Hilbert's Tenth Problem in Coq. FSCD 2019: 27:1-27:20 - [i5]Yannick Forster, Fabian Kunze, Marc Roth:
The Weak Call-By-Value λ-Calculus is Reasonable for Both Time and Space. CoRR abs/1902.07515 (2019) - [i4]Yannick Forster
A certifying extraction with time bounds from Coq to call-by-value $λ$-calculus. CoRR abs/1904.11818 (2019) - 2018
- [c3]Fabian Kunze, Gert Smolka, Yannick Forster
Formal Small-Step Verification of a Call-by-Value Lambda Calculus Machine. APLAS 2018: 264-283 - [c2]Yannick Forster
Verification of PCP-Related Computational Reductions in Coq. ITP 2018: 253-269 - [i3]Fabian Kunze, Gert Smolka, Yannick Forster
Formal Small-step Verification of a Call-by-value Lambda Calculus Machine. CoRR abs/1806.03205 (2018) - 2017
- [j1]Yannick Forster
On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control. Proc. ACM Program. Lang. 1(ICFP): 13:1-13:29 (2017) - [c1]Yannick Forster
Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq. ITP 2017: 189-206 - [i2]Yannick Forster
Verification of PCP-Related Computational Reductions in Coq. CoRR abs/1711.07023 (2017) - 2016
- [i1]Yannick Forster, Ohad Kammar, Sam Lindley, Matija Pretnar:
On the Expressive Power of User-Defined Effects: Effect Handlers, Monadic Reflection, Delimited Control. CoRR abs/1610.09161 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: