default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValentin Blot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Valentin Blot, Gilles Dowek
, Thomas Traversié, Théo Winterhalter:
From Rewrite Rules to Axioms in the $\lambda \varPi $-Calculus Modulo Theory. FoSSaCS (2) 2024: 3-23- [i3]Valentin Blot, Gilles Dowek, Thomas Traversié, Théo Winterhalter:
From Rewrite Rules to Axioms in the λΠ-Calculus Modulo Theory. CoRR abs/2402.09024 (2024) - 2023
- [c13]Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, Assia Mahboubi, Pierre Vial:
Compositional Pre-processing for Automated Reasoning in Dependent Type Theory. CPP 2023: 63-77 - [c12]Valentin Blot:
Diller-Nahm Bar Recursion. FSCD 2023: 32:1-32:16 - 2022
- [c11]Valentin Blot:
A direct computational interpretation of second-order arithmetic via update recursion. LICS 2022: 62:1-62:11 - [c10]Amélie Ledein, Valentin Blot, Catherine Dubois:
A Semantics of 𝕂 into Dedukti. TYPES 2022: 12:1-12:22 - [i2]Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, Assia Mahboubi, Pierre Vial:
Modular pre-processing for automated reasoning in dependent type theory. CoRR abs/2204.02643 (2022) - 2021
- [c9]Valentin Blot, Louise Dubois de Prisque, Chantal Keller, Pierre Vial:
General Automation in Coq through Modular Transformations. PxTP 2021: 24-39
2010 – 2019
- 2018
- [c8]Valentin Blot, Jim Laird:
Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types. LICS 2018: 95-104 - [i1]Valentin Blot:
An interpretation of system F through bar recursion. CoRR abs/1804.00731 (2018) - 2017
- [j2]Valentin Blot:
Realizability for Peano arithmetic with winning conditions in HON games. Ann. Pure Appl. Log. 168(2): 254-277 (2017) - [c7]Valentin Blot:
An interpretation of system F through bar recursion. LICS 2017: 1-12 - 2016
- [c6]Valentin Blot:
Hybrid realizability for intuitionistic and classical choice. LICS 2016: 575-584 - [c5]Valentin Blot:
Classical Extraction in Continuation Models. FSCD 2016: 13:1-13:17 - 2015
- [j1]Valentin Blot:
Typed realizability for first-order classical analysis. Log. Methods Comput. Sci. 11(4) (2015) - 2014
- [b1]Valentin Blot:
Game semantics and realizability for classical logic. (Sémantique des jeux et réalisabilité pour la logique classique). École normale supérieure de Lyon, France, 2014 - 2013
- [c4]Valentin Blot, Colin Riba:
On Bar Recursion and Choice in a Classical Setting. APLAS 2013: 349-364 - [c3]Valentin Blot:
Realizability for Peano Arithmetic with Winning Conditions in HON Games. TLCA 2013: 77-92
2000 – 2009
- 2009
- [c2]Valentin Blot, David Coeurjolly:
Quasi-Affine Transformation in Higher Dimension. DGCI 2009: 493-504 - [c1]David Coeurjolly, Valentin Blot, Marie-Andrée Jacob-Da Col:
Quasi-Affine Transformation in 3-D: Theory and Algorithms. IWCIA 2009: 68-81
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
