Quasi-Affine Transformation in Higher Dimension. - Valentin Blot; David Coeurjolly (DGCI, 2009)

Quasi-Affine Transformation in 3-D: Theory and Algorithms. - David Coeurjolly; Valentin Blot; Marie-Andrée Jacob-Da Col (IWCIA, 2009)

On Bar Recursion and Choice in a Classical Setting. - Valentin Blot; Colin Riba (APLAS, 2013)

Game semantics and realizability for classical logic. (Sémantique des jeux et réalisabilité pour la logique classique). - Valentin Blot (2014)

Typed realizability for first-order classical analysis. - Valentin Blot (Log. Methods Comput. Sci., 2015)

Hybrid realizability for intuitionistic and classical choice. - Valentin Blot (LICS, 2016)

Classical Extraction in Continuation Models. - Valentin Blot (FSCD, 2016)

An interpretation of system F through bar recursion. - Valentin Blot (LICS, 2017)

Realizability for Peano arithmetic with winning conditions in HON games. - Valentin Blot (Ann. Pure Appl. Log., 2017)

Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types. - Valentin Blot; Jim Laird (LICS, 2018)

General Automation in Coq through Modular Transformations. - Valentin Blot; Louise Dubois de Prisque; Chantal Keller; Pierre Vial (PxTP, 2021)

A direct computational interpretation of second-order arithmetic via update recursion. - Valentin Blot (LICS, 2022)

A Semantics of 𝕂 into Dedukti. - Amélie Ledein; Valentin Blot; Catherine Dubois (TYPES, 2022)

Modular pre-processing for automated reasoning in dependent type theory. - Valentin Blot; Denis Cousineau 002; Enzo Crance; Louise Dubois de Prisque; Chantal Keller; Assia Mahboubi; Pierre Vial (CoRR, 2022)

Compositional Pre-processing for Automated Reasoning in Dependent Type Theory. - Valentin Blot; Denis Cousineau 002; Enzo Crance; Louise Dubois de Prisque; Chantal Keller; Assia Mahboubi; Pierre Vial (CPP, 2023)

Diller-Nahm Bar Recursion. - Valentin Blot (FSCD, 2023)

From Rewrite Rules to Axioms in the $ lambda varPi $-Calculus Modulo Theory. - Valentin Blot; Gilles Dowek; Thomas Traversié; Théo Winterhalter (FoSSaCS (2), 2024)

From Rewrite Rules to Axioms in the λΠ-Calculus Modulo Theory. - Valentin Blot; Gilles Dowek; Thomas Traversié; Théo Winterhalter (CoRR, 2024)