Valentin Blot

According to our database, Valentin Blot authored at least 18 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

From Rewrite Rules to Axioms in the λΠ-Calculus Modulo Theory.

Valentin Blot, Gilles Dowek, Thomas Traversié, Théo Winterhalter

CoRR, 2024

From Rewrite Rules to Axioms in the $\lambda \varPi $-Calculus Modulo Theory.

Valentin Blot, Gilles Dowek, Thomas Traversié, Théo Winterhalter

Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023

Diller-Nahm Bar Recursion.

Valentin Blot

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

Compositional Pre-processing for Automated Reasoning in Dependent Type Theory.

Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, Assia Mahboubi, Pierre Vial

Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2023

2022

Modular pre-processing for automated reasoning in dependent type theory.

Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, Assia Mahboubi, Pierre Vial

CoRR, 2022

A Semantics of 𝕂 into Dedukti.

Amélie Ledein, Valentin Blot, Catherine Dubois

Proceedings of the 28th International Conference on Types for Proofs and Programs, 2022

A direct computational interpretation of second-order arithmetic via update recursion.

Valentin Blot

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021

General Automation in Coq through Modular Transformations.

Valentin Blot, Louise Dubois de Prisque, Chantal Keller, Pierre Vial

Proceedings of the Proceedings Seventh Workshop on Proof eXchange for Theorem Proving, 2021

2018

Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types.

Valentin Blot, Jim Laird

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Realizability for Peano arithmetic with winning conditions in HON games.

Valentin Blot

Ann. Pure Appl. Log., 2017

An interpretation of system F through bar recursion.

Valentin Blot

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Classical Extraction in Continuation Models.

Valentin Blot

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Hybrid realizability for intuitionistic and classical choice.

Valentin Blot

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Typed realizability for first-order classical analysis.

Valentin Blot

Log. Methods Comput. Sci., 2015

2014

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

Valentin Blot

PhD thesis, 2014

2013

On Bar Recursion and Choice in a Classical Setting.

Valentin Blot, Colin Riba

Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2009

Quasi-Affine Transformation in 3-D: Theory and Algorithms.

David Coeurjolly, Valentin Blot, Marie-Andrée Jacob-Da Col

Proceedings of the Combinatorial Image Analysis, 13th International Workshop, 2009

Quasi-Affine Transformation in Higher Dimension.

Valentin Blot, David Coeurjolly

Proceedings of the Discrete Geometry for Computer Imagery, 2009