Yves Lafont

3.3k total citations · 1 hit paper
21 papers, 1.5k citations indexed

About

Yves Lafont is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Yves Lafont has authored 21 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 16 papers in Computational Theory and Mathematics and 4 papers in Geometry and Topology. Recurrent topics in Yves Lafont's work include Logic, programming, and type systems (15 papers), Logic, Reasoning, and Knowledge (9 papers) and semigroups and automata theory (6 papers). Yves Lafont is often cited by papers focused on Logic, programming, and type systems (15 papers), Logic, Reasoning, and Knowledge (9 papers) and semigroups and automata theory (6 papers). Yves Lafont collaborates with scholars based in France, United Kingdom and Germany. Yves Lafont's co-authors include Jean-Yves Girard, Paul Taylor, Thomas Streicher, Patrick Dehornoy, Vincent Danos, Patrick Lincoln, Gianluigi Bellin, Thomas Ehrhard, Vito Michele Abrusci and Andre Scedrov and has published in prestigious journals such as Advances in Mathematics, Theoretical Computer Science and Journal of Symbolic Logic.

In The Last Decade

Yves Lafont

21 papers receiving 1.3k citations

Hit Papers

Proofs and types 1989 2026 2001 2013 1989 200 400 600
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Proofs and types
    1989 652 citations Jean-Yves Girard, Paul Taylor et al. profile →

Peers

Yves Lafont
Pierre-Louis Curien France
Andrew M. Pitts United Kingdom
Thierry Coquand Sweden
J. C. Shepherdson United Kingdom
Dominique Perrin France
Matt Kaufmann United States
Furio Honsell Italy
Marcelo Fiore United Kingdom
Jesse B. Wright United States
Achim Jung United Kingdom
Pierre-Louis Curien France
Yves Lafont
Citations per year, relative to Yves Lafont Yves Lafont (= 1×) peers Pierre-Louis Curien

Countries citing papers authored by Yves Lafont

Since Specialization
Citations

This map shows the geographic impact of Yves Lafont'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 Yves Lafont with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yves Lafont more than expected).

Fields of papers citing papers by Yves Lafont

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yves Lafont. 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 Yves Lafont. The network helps show where Yves Lafont may publish in the future.

Co-authorship network of co-authors of Yves Lafont

This figure shows the co-authorship network connecting the top 25 collaborators of Yves Lafont. A scholar is included among the top collaborators of Yves Lafont 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 Yves Lafont. Yves Lafont is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lafont, Yves, et al.. (2010). A folk model structure on omega-cat. Advances in Mathematics. 224(3). 1183–1231. 25 indexed citations
2.
Lafont, Yves, et al.. (2008). Polygraphic resolutions and homology of monoids. Journal of Pure and Applied Algebra. 213(6). 947–968. 9 indexed citations
3.
Lafont, Yves. (2004). Soft linear logic and polynomial time. Theoretical Computer Science. 318(1-2). 163–180. 3 indexed citations
4.
Lafont, Yves. (2003). Towards an algebraic theory of Boolean circuits. Journal of Pure and Applied Algebra. 184(2-3). 257–310. 56 indexed citations
5.
Lafont, Yves. (2003). Soft linear logic and polynomial time. Theoretical Computer Science. 318(1-2). 163–180. 66 indexed citations
6.
Dehornoy, Patrick & Yves Lafont. (2003). Homology of gaussian groups. Annales de l’institut Fourier. 53(2). 489–540. 21 indexed citations
7.
Lafont, Yves & Thomas Streicher. (2002). Games semantics for linear logic. 43–50. 23 indexed citations
8.
Lafont, Yves. (1997). Interaction Combinators. Information and Computation. 137(1). 69–101. 35 indexed citations
9.
Lafont, Yves. (1997). The finite model property for various fragments of linear logic. Journal of Symbolic Logic. 62(4). 1202–1208. 32 indexed citations
10.
Lafont, Yves & Andre Scedrov. (1996). The Undecidability of Second Order Multiplicative Linear Logic. Information and Computation. 125(1). 46–51. 14 indexed citations
11.
Lafont, Yves. (1996). The undecidability of second order linear logic without exponentials. Journal of Symbolic Logic. 61(2). 541–548. 13 indexed citations
12.
Lafont, Yves. (1995). A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier). Journal of Pure and Applied Algebra. 98(3). 229–244. 26 indexed citations
13.
Girard, Jean-Yves, J. Lambek, Andreas Blass, et al.. (1995). Advances in Linear Logic. Cambridge University Press eBooks. 93 indexed citations
14.
Girard, Jean-Yves, Yves Lafont, & Laurent Régnier. (1995). Proceedings of the workshop on Advances in linear logic. 7 indexed citations
15.
Fourman, Michael, Simon J. Brookes, J.R.B. Cockett, et al.. (1992). Applications of Categories in Computer Science. Cambridge University Press eBooks. 59 indexed citations
16.
Lafont, Yves, et al.. (1991). Church-Rooser property and homology of monoids. Mathematical Structures in Computer Science. 1(3). 297–326. 11 indexed citations
17.
Lafont, Yves. (1990). Interaction nets. 95–108. 157 indexed citations
18.
Girard, Jean-Yves, Paul Taylor, & Yves Lafont. (1989). Proofs and types. 652 indexed citations breakdown →
19.
Lafont, Yves. (1988). The linear abstract machine. Theoretical Computer Science. 59(1-2). 157–180. 72 indexed citations
20.
Lafont, Yves. (1988). The linear abstract machine. Theoretical Computer Science. 62(3). 327–328. 75 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 Pierre-Louis Curien Breakdown of academic impact, for papers by Andrew M. Pitts Breakdown of academic impact, for papers by Thierry Coquand Breakdown of academic impact, for papers by J. C. Shepherdson Breakdown of academic impact, for papers by Dominique Perrin Breakdown of academic impact, for papers by Matt Kaufmann Breakdown of academic impact, for papers by Furio Honsell Breakdown of academic impact, for papers by Marcelo Fiore Breakdown of academic impact, for papers by Jesse B. Wright Breakdown of academic impact, for papers by Achim Jung
Rankless by CCL
2026