Yannick Forster

446 total citations
18 papers, 122 citations indexed

About

Yannick Forster is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Social Psychology. According to data from OpenAlex, Yannick Forster has authored 18 papers receiving a total of 122 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Artificial Intelligence, 14 papers in Computational Theory and Mathematics and 2 papers in Social Psychology. Recurrent topics in Yannick Forster's work include Logic, programming, and type systems (15 papers), Logic, Reasoning, and Knowledge (8 papers) and Formal Methods in Verification (7 papers). Yannick Forster is often cited by papers focused on Logic, programming, and type systems (15 papers), Logic, Reasoning, and Knowledge (8 papers) and Formal Methods in Verification (7 papers). Yannick Forster collaborates with scholars based in Germany, France and United Kingdom. Yannick Forster's co-authors include Matthieu Sozeau, Nicolas Tabareau, Ohad Kammar, Matija Pretnar, Sam Lindley, Gert Smolka, Andreas Keinath, Katharina Wiedemann, Frederik Naujoks and Abhishek Anand and has published in prestigious journals such as Journal of the ACM, Accident Analysis & Prevention and Journal of Automated Reasoning.

In The Last Decade

Yannick Forster

14 papers receiving 121 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Yannick Forster Germany 7 102 81 14 11 11 18 122
Sunil Issar United States 7 218 2.1× 44 0.5× 11 0.8× 3 0.3× 5 0.5× 12 223
Leszek Pacholski Poland 8 113 1.1× 122 1.5× 10 0.7× 14 1.3× 1 0.1× 30 207
Luca Roversi Italy 7 120 1.2× 111 1.4× 11 0.8× 10 0.9× 16 143
Paul Hoogendijk Netherlands 6 119 1.2× 104 1.3× 10 0.7× 2 0.2× 18 1.6× 10 144
Andrei Paskevich France 5 46 0.5× 33 0.4× 8 0.6× 12 1.1× 12 58
Sascha Böhme Germany 6 97 1.0× 72 0.9× 6 0.4× 11 1.0× 8 106
David Nowak Japan 5 55 0.5× 44 0.5× 8 0.6× 7 0.6× 11 68
Franco M. Luque Argentina 7 108 1.1× 15 0.2× 10 0.7× 8 0.7× 4 0.4× 11 119
Joe Hurd United Kingdom 5 79 0.8× 56 0.7× 9 0.6× 3 0.3× 13 90
François Bobot France 5 40 0.4× 37 0.5× 12 0.9× 7 0.6× 7 60

Countries citing papers authored by Yannick Forster

Since Specialization
Citations

This map shows the geographic impact of Yannick Forster's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Yannick Forster with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yannick Forster more than expected).

Fields of papers citing papers by Yannick Forster

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yannick Forster. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Yannick Forster. The network helps show where Yannick Forster may publish in the future.

Co-authorship network of co-authors of Yannick Forster

This figure shows the co-authorship network connecting the top 25 collaborators of Yannick Forster. A scholar is included among the top collaborators of Yannick Forster based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Yannick Forster. Yannick Forster is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

18 of 18 papers shown
1.
Forster, Yannick, Matthieu Sozeau, & Nicolas Tabareau. (2024). Verified Extraction from Coq to OCaml. Proceedings of the ACM on Programming Languages. 8(PLDI). 52–75. 3 indexed citations
2.
Cohen, Liron, et al.. (2024). Separating Markov's Principles. SPIRE - Sciences Po Institutional REpository. 1–14. 1 indexed citations
3.
Forster, Yannick, et al.. (2024). Attentional warnings caused by driver monitoring systems: How often do they appear and how well are they understood?. Accident Analysis & Prevention. 205. 107684–107684. 12 indexed citations
4.
Sozeau, Matthieu, et al.. (2024). Correct and Complete Type Checking and Certified Erasure for Coq , in Coq. Journal of the ACM. 72(1). 1–74.
5.
Forster, Yannick, et al.. (2022). Le dixième problème de Hilbert en Coq (version étendue). HAL (Le Centre pour la Communication Scientifique Directe).
6.
7.
Forster, Yannick, et al.. (2021). A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
8.
Forster, Yannick, et al.. (2021). Completeness theorems for first-order logic analysed in constructive type theory. Journal of Logic and Computation. 31(1). 112–151. 6 indexed citations
9.
Sozeau, Matthieu, Abhishek Anand, Cyril Cohen, et al.. (2020). The MetaCoq Project. Journal of Automated Reasoning. 64(5). 947–999. 21 indexed citations
10.
Forster, Yannick, et al.. (2020). Verified programming of Turing machines in Coq. 141. 114–128. 5 indexed citations
11.
Forster, Yannick, et al.. (2020). Undecidability of higher-order unification formalised in Coq. 143–157. 2 indexed citations
12.
Forster, Yannick, et al.. (2020). Coq à la carte: a practical approach to modular syntax with binders. 186–200. 3 indexed citations
13.
Forster, Yannick, et al.. (2019). On synthetic undecidability in Coq, with an application to the Entscheidungsproblem. 38–51. 9 indexed citations
14.
Forster, Yannick, et al.. (2019). Call-by-push-value in Coq: operational, equational, and denotational theory. 118–131. 7 indexed citations
15.
Sozeau, Matthieu, et al.. (2019). Coq Coq correct! verification of type checking and erasure for Coq, in Coq. Proceedings of the ACM on Programming Languages. 4(POPL). 1–28. 26 indexed citations
16.
Forster, Yannick, et al.. (2019). The weak call-by-value λ-calculus is reasonable for both time and space. Proceedings of the ACM on Programming Languages. 4(POPL). 1–23. 3 indexed citations
17.
Forster, Yannick & Gert Smolka. (2018). Call-by-Value Lambda Calculus as a Model of Computation in Coq. Journal of Automated Reasoning. 63(2). 393–413.
18.
Forster, Yannick, Ohad Kammar, Sam Lindley, & Matija Pretnar. (2017). On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control. Proceedings of the ACM on Programming Languages. 1(ICFP). 1–29. 23 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Sunil Issar Breakdown of academic impact, for papers by Leszek Pacholski Breakdown of academic impact, for papers by Luca Roversi Breakdown of academic impact, for papers by Paul Hoogendijk Breakdown of academic impact, for papers by Andrei Paskevich Breakdown of academic impact, for papers by Sascha Böhme Breakdown of academic impact, for papers by David Nowak Breakdown of academic impact, for papers by Franco M. Luque Breakdown of academic impact, for papers by Joe Hurd Breakdown of academic impact, for papers by François Bobot
Rankless by CCL
2026