Valentin Blot - RankMe

20 papers A* 4B 4C 1Journal 5Unranked 5

Year	Rank	Type	Title / Venue / Authors
2024	—	`conf`	From Rewrite Rules to Axioms in the $\lambda \varPi $-Calculus Modulo Theory. FoSSaCS (2) Valentin Blot, Gilles Dowek, Thomas Traversié, Théo Winterhalter
2024	J	`jnl`	From Rewrite Rules to Axioms in the λΠ-Calculus Modulo Theory. CoRR Valentin Blot, Gilles Dowek, Thomas Traversié, Théo Winterhalter
2023	B	`conf`	Compositional Pre-processing for Automated Reasoning in Dependent Type Theory. CPP Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, Assia Mahboubi, Pierre Vial
2023	B	`conf`	Diller-Nahm Bar Recursion. FSCD Valentin Blot
2022	—	`conf`	A Semantics of 𝕂 into Dedukti. TYPES Amélie Ledein, Valentin Blot, Catherine Dubois
2022	A*	`conf`	A direct computational interpretation of second-order arithmetic via update recursion. LICS Valentin Blot
2022	J	`jnl`	Modular pre-processing for automated reasoning in dependent type theory. CoRR Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, Assia Mahboubi, Pierre Vial
2021	—	`conf`	General Automation in Coq through Modular Transformations. PxTP Valentin Blot, Louise Dubois de Prisque, Chantal Keller, Pierre Vial
2018	J	`jnl`	An interpretation of system F through bar recursion. CoRR Valentin Blot
2018	A*	`conf`	Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types. LICS Valentin Blot, Jim Laird
2017	A*	`conf`	An interpretation of system F through bar recursion. LICS Valentin Blot
2017	J	`jnl`	Realizability for Peano arithmetic with winning conditions in HON games. Ann. Pure Appl. Log. Valentin Blot
2016	B	`conf`	Classical Extraction in Continuation Models. FSCD Valentin Blot
2016	A*	`conf`	Hybrid realizability for intuitionistic and classical choice. LICS Valentin Blot
2015	J	`jnl`	Typed realizability for first-order classical analysis. Log. Methods Comput. Sci. Valentin Blot
2014	—	`—`	Game semantics and realizability for classical logic. (Sémantique des jeux et réalisabilité pour la logique classique). Valentin Blot
2013	B	`conf`	On Bar Recursion and Choice in a Classical Setting. APLAS Valentin Blot, Colin Riba
2013	—	`conf`	Realizability for Peano Arithmetic with Winning Conditions in HON Games. TLCA Valentin Blot
2009	C	`conf`	Quasi-Affine Transformation in 3-D: Theory and Algorithms. IWCIA David Coeurjolly, Valentin Blot, Marie-Andrée Jacob-Da Col
2009	—	`conf`	Quasi-Affine Transformation in Higher Dimension. DGCI Valentin Blot, David Coeurjolly