diff --git a/_data/seminar.yml b/_data/seminar.yml
index f29b12dbf819ebe56a5b78aade4c2c8d74b8be9c..e9bd2d7d0fb338f3b12b4791b64c557c47047875 100644
--- a/_data/seminar.yml
+++ b/_data/seminar.yml
@@ -146,7 +146,7 @@
   lab: Inria Rennes (Gallinette team)
   title:  Generic bidirectional typing for dependent type theories
   abstract: |
-    Bidirectional typing is a discipline in which the typing judgment is decomposed into inference and checking modes, allowing to control the flow of type information in typing rules and to specify algorithmically how they should be used. Bidirectional typing has been fruitfully studied and bidirectional systems have been developed for many type theories. However, the formal development of bidirectional typing has until now been kept confined to specific theories, with general guidelines remaining mostly informal and not fully developed. In this work, we give a generic account of bidirectional typing for a general class of dependent type theories. This is done by first giving a general definition of type theories (or equivalently, a logical framework), for which we define declarative and bidirectional type systems. We then show, in a theory-independent fashion, that the two systems are equivalent. We also establish the decidability of bidirectional typing for normalizing theories, yielding a generic type-checking algorithm that has been implemented in a prototype, available at https://github.com/thiagofelicissimo/BiTTs, and used in practice with many theories.
+    Bidirectional typing is a discipline in which the typing judgment is decomposed into inference and checking modes, allowing to control the flow of type information in typing rules and to specify algorithmically how they should be used. Bidirectional typing has been fruitfully studied and bidirectional systems have been developed for many type theories. However, the formal development of bidirectional typing has until now been kept confined to specific theories, with general guidelines remaining mostly informal and not fully developed. In this work, we give a generic account of bidirectional typing for a general class of dependent type theories. This is done by first giving a general definition of type theories (or equivalently, a logical framework), for which we define declarative and bidirectional type systems. We then show, in a theory-independent fashion, that the two systems are equivalent. We also establish the decidability of bidirectional typing for normalizing theories, yielding a generic type-checking algorithm that has been implemented in [a prototype](https://github.com/thiagofelicissimo/BiTTs), and used in practice with many theories.
 - date: 2024-12-11 13:30
   team: COSYNUS
   room: Grace Hopper