E-mail: Jean-Yves.Moyen `at` lipn.univ-paris13.fr

From September 2015 to August 2017, I was a MSCA fellow funded by grant number 65522 "Walgo". Here is the list of publications and work done during that period.

Implicit Complexity, in Theory and Practice

- James Avery,
**Jean-Yves Moyen**, Jakob Grue Simonsen, Pavel Růžička, Chains, Antichains, and Complements in Infinite Partition Lattices, under revision at*Algebra Universalis*. **Jean-Yves Moyen**, Jakob Grue Simonsen, More intensional versions of Rice’s Theorem,*Dice 2016*(slides).**Jean-Yves Moyen**, Jakob Grue Simonsen, Computability in the Lattice of Equivalence Relations,*Dice 2017*(slides).

**Jean-Yves Moyen**, Thomas Rubiano, Detection of Non-Size Increasing Programs in Compilers,*Dice 2016*.**Jean-Yves Moyen**, Thomas Rubiano, Thomas Seiller, Loop Quasi-Invariant Chunk Motion,*Dice 2017*.**Jean-Yves Moyen**, Thomas Rubiano, Thomas Seiller, Loop Quasi-Invariant Chunk Motion,*ATVA 2017*.

- Hugo Ferée, Samuel Hym, Micaela Mayero,
**Jean-Yves Moyen**, David Nowak, Formal Proof of Polynomial-Time Complexity with Quasi-Interpretations,*CPP 2018*.

- I wrote a LaTeX template for the MSCA
application.

The EU only provides a Word template and I'm way more comfortable using LaTeX. So I made this template. Beware that it was done for the 2014 application and the template has changed since, hence you'll need to adapt it to the current application. - I toyed with
*Optional Contents Groups*to try and implement working Hypertext proofs in LaTeX, following some ideas by Leslie Lamport on Structured proofs. - I toyed with ways to implement a truly Unicode keyboard that doesn't use long sequences of keys to input potentially tens of thousand of various characters.