CoHOp stands for "Complexity, Homology, and Operads". The project is funded by the Île-de-France region, through the DIM RFSI. Other participants: Maxime Lucas, Damiano Mazza, Samuel Mimram.

A recent work of Pellissier and Seiller exposed a proof method for lower bounds in complexity relying on bounds on both the topological entropy of dynamical systems and the Betti numbers of algebraic varieties. Not only this result improves one of the strongest known lower bound result, it establishes that several strong lower bound results rely on (co)homological invariants.
The CoHoP project aims at developing further this invariant method, through the use of more involved methods from algebraic topology.

StATyC stands for "Static Analyses of Program Flows: Types and Certificate for Complexity". This is a two-year international collaborative project funded by the Thomas Jefferson Fund, from the FACE Foundation, and involving the School of Computer Science of the University of Augusta.

The project aims at providing new static analysis tools based on theoretical results from Implicit computational complexity, building on previous work of Moyen, Rubiano and Seiller (doi:10.1007/978-3-319-68167-2_7).
Co-P.I.: Clément Aubert.

TrAVAIL stands for "Transversal Approaches of Verification, Abstract Interpretation, and Logic". This is a one-year international collaborative project funded by CNRS and involving DIKU, the Computer Science Department of the University of Copenhagen, and the Department of Computer Science of Aarhus University.

I am part of the ANR JCJC project CoGITARe (Combining Graded and Intersection Types for the Analyses of Resources), lead by Flavien Breuvart. If you want to know more about this project, there is a dedicated Website.