Yannick Forster
Yannick Forster
PhD student at the Programming Systems Lab, Saarland University
Verified email at ps.uni-saarland.de - Homepage
Title
Cited by
Cited by
Year
Weak call-by-value lambda calculus as a model of computation in Coq
Y Forster, G Smolka
International Conference on Interactive Theorem Proving, 189-206, 2017
372017
On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control
Y Forster, O Kammar, S Lindley, M Pretnar
Proceedings of the ACM on Programming Languages 1 (ICFP), 1-29, 2017
372017
The metacoq project
M Sozeau, A Anand, S Boulier, C Cohen, Y Forster, F Kunze, G Malecha, ...
Journal of Automated Reasoning, 1-53, 2020
31*2020
Coq coq correct! verification of type checking and erasure for coq, in coq
M Sozeau, S Boulier, Y Forster, N Tabareau, T Winterhalter
Proceedings of the ACM on Programming Languages 4 (POPL), 1-28, 2019
292019
On synthetic undecidability in Coq, with an application to the Entscheidungsproblem
Y Forster, D Kirst, G Smolka
Proceedings of the 8th ACM SIGPLAN International Conference on Certified …, 2019
262019
Verification of PCP-related computational reductions in Coq
Y Forster, E Heiter, G Smolka
International Conference on Interactive Theorem Proving, 253-269, 2018
232018
A certifying extraction with time bounds from Coq to call-by-value -calculus
Y Forster, F Kunze
10th International Conference on Interactive Theorem Proving (ITP 2019), 17 …, 2019
182019
Certified undecidability of intuitionistic linear logic via binary stack machines and Minsky machines
Y Forster, D Larchey-Wendling
Proceedings of the 8th ACM SIGPLAN International Conference on Certified …, 2019
172019
Hilbert's Tenth Problem in Coq
D Larchey-Wendling, Y Forster
arXiv preprint arXiv:2003.04604, 2020
162020
Hilbert's Tenth Problem in Coq
D Larchey-Wendling, Y Forster
4th International Conference on Formal Structures for Computation and …, 2019
162019
Verified extraction from Coq to a lambda-calculus
Y Forster, F Kunze
Coq Workshop 2016, 2016
142016
A Coq library of undecidable problems
Y Forster, D Larchey-Wendling, A Dudenhefner, E Heiter, D Kirst, F Kunze, ...
CoqPL 2020 The Sixth International Workshop on Coq for Programming Languages, 2020
132020
The weak call-by-value λ-calculus is reasonable for both time and space
Y Forster, F Kunze, M Roth
Proceedings of the ACM on Programming Languages 4 (POPL), 1-23, 2019
102019
Call-by-push-value in Coq: operational, equational, and denotational theory
Y Forster, S Schäfer, S Spies, K Stark
Proceedings of the 8th ACM SIGPLAN International Conference on Certified …, 2019
102019
On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control
Y Forster, O Kammar, S Lindley, M Pretnar
Journal of Functional Programming 29, 2019
92019
Verified programming of Turing machines in Coq
Y Forster, F Kunze, M Wuttke
Proceedings of the 9th ACM SIGPLAN International Conference on Certified …, 2020
82020
Call-by-value lambda calculus as a model of computation in Coq
Y Forster, G Smolka
Journal of Automated Reasoning 63 (2), 393-413, 2019
82019
Formal small-step verification of a call-by-value lambda calculus machine
F Kunze, G Smolka, Y Forster
Asian Symposium on Programming Languages and Systems, 264-283, 2018
82018
Completeness theorems for first-order logic analysed in constructive type theory
Y Forster, D Kirst, D Wehr
International Symposium on Logical Foundations of Computer Science, 47-74, 2020
72020
Undecidability of higher-order unification formalised in Coq
S Spies, Y Forster
Proceedings of the 9th ACM SIGPLAN International Conference on Certified …, 2020
52020
The system can't perform the operation now. Try again later.
Articles 1–20