| A cellular Howe theorem P Borthelle, T Hirschowitz, A Lafont Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 15 | 2020 |
| Modular specification of monads through higher-order presentations B Ahrens, A Hirschowitz, A Lafont, M Maggesi arXiv preprint arXiv:1903.00922, 2019 | 14 | 2019 |
| High-level signatures and initial semantics B Ahrens, A Hirschowitz, A Lafont, M Maggesi LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS 119, 1-22, 2018 | 12 | 2018 |
| Modules over monads and operational semantics (expanded version) A Hirschowitz, T Hirschowitz, A Lafont arXiv preprint arXiv:2012.06530, 2020 | 10 | 2020 |
| Reduction monads and their signatures B Ahrens, A Hirschowitz, A Lafont, M Maggesi Proceedings of the ACM on Programming Languages 4 (POPL), 1-29, 2019 | 7 | 2019 |
| Signatures and models for syntax and operational semantics in the presence of variable binding A Lafont arXiv preprint arXiv:1910.09162, 2019 | 7 | 2019 |
| For finitary induction-induction, induction is enough A Kaposi, A Kovács, A Lafont TYPES 2019: 25th International Conference on Types for Proofs and Programs …, 2019 | 7 | 2019 |
| A categorical framework for congruence of applicative bisimilarity in higher-order languages T Hirschowitz, A Lafont Logical Methods in Computer Science 18, 2022 | 6 | 2022 |
| Variable binding and substitution for (nameless) dummies A Hirschowitz, T Hirschowitz, A Lafont, M Maggesi International Conference on Foundations of Software Science and Computation …, 2022 | 6 | 2022 |
| Probing wave function collapse models with a classically driven mechanical oscillator M Ho, A Lafont, N Sangouard, P Sekatski New Journal of Physics 18 (3), 033025, 2016 | 6 | 2016 |
| Dargent: a silver bullet for verified data layout refinement Z Chen, A Lafont, L O'Connor, G Keller, C McLaughlin, V Jackson, ... Proceedings of the ACM on Programming Languages 7 (POPL), 1369-1395, 2023 | 3 | 2023 |
| Presentable signatures and initial semantics B Ahrens, A Hirschowitz, A Lafont, M Maggesi Logical Methods in Computer Science 17, 2021 | 2 | 2021 |
| 25th International Conference on Types for Proofs and Programs (TYPES 2019) M Kohlhase, F Rabe, M Wenzel, J Cockx, S Alves, D Kesner, D Ventura, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 2 | 2020 |
| A diagram editor to mechanise categorical proofs A Lafont 35es Journées Francophones des Langages Applicatifs (JFLA 2024), 2024 | 1 | 2024 |
| A unified treatment of structural definitions on syntax for capture-avoiding substitution, context application, named substitution, partial differentiation, and so on T Hirschowitz, A Lafont arXiv preprint arXiv:2204.03870, 2022 | 1 | 2022 |
| Types are weak omega-groupoids, in Coq A Lafont, T Hirschowitz, N Tabareau TYPES 2018, 2018 | 1 | 2018 |
| A short note on Initial Algebra Semantics for QIITs A Lafont | | 2023 |
| A more general categorical framework for congruence of applicative bisimilarity T Hirschowitz, A Lafont arXiv preprint arXiv:2303.11679, 2023 | | 2023 |
| Generic pattern unification: a categorical approach A Lafont, N Krishnaswami | | |
| Towards a Comprehensive and Efficient Theory of Programming Languages A Lafont | | |
