default search action
Olivier Hermant
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c25]Olivier Hermant, Wojciech Loboda:
Numeric Base Conversion with Rewriting. LPAR Complementary Volume 2024: 92-106 - [c24]Johann Rosain, Richard Bonichon, Julie Cailler
, Olivier Hermant:
A Generic Deskolemization Strategy. LPAR 2024: 246-263 - 2023
- [i8]Gilles Dowek, Olivier Hermant:
A Simple Proof That Super-Consistency Implies Cut Elimination. CoRR abs/2304.10975 (2023) - [i7]Ali Assaf, Guillaume Burel, Raphaël Cauderlier, David Delahaye, Gilles Dowek, Catherine Dubois, Frédéric Gilbert, Pierre Halmagrand, Olivier Hermant, Ronan Saillard:
Dedukti: a Logical Framework based on the λΠ-Calculus Modulo Theory. CoRR abs/2311.07185 (2023) - 2020
- [j4]Guillaume Burel, Guillaume Bury, Raphaël Cauderlier, David Delahaye
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice. J. Autom. Reason. 64(6): 1001-1050 (2020)
2010 – 2019
- 2019
- [c23]Frédéric Blanqui
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. FSCD 2019: 9:1-9:21 - [i6]Frédéric Blanqui, Guillaume Genestier, Olivier Hermant
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. CoRR abs/1906.11649 (2019) - 2018
- [c22]Thomas F. J.-M. Pasquier
Runtime Analysis of Whole-System Provenance. CCS 2018: 1601-1616 - [c21]Olivier Hermant:
Polarized Rewriting and Tableaux in B Set Theory. SETS@ABZ 2018: 67-72 - [i5]Olivier Hermant
Polarized Rewriting and Tableaux in B Set Theory. CoRR abs/1806.08536 (2018) - [i4]Thomas F. J.-M. Pasquier, Xueyuan Han, Thomas Moyer, Adam Bates, Olivier Hermant, David M. Eyers, Jean Bacon, Margo I. Seltzer:
Runtime Analysis of Whole-System Provenance. CoRR abs/1808.06049 (2018) - 2017
- [b1]Olivier Hermant:
Complétude en Logiques. Paris Diderot University, France, 2017 - 2016
- [c20]Sathiya Prabhu Kumar, Sylvain Lefebvre, Raja Chiky, Olivier Hermant
Consistency-Latency Trade-Off of the LibRe Protocol: A Detailed Study. EGC (best of volume) 2016: 83-108 - 2015
- [c19]Thomas F. J.-M. Pasquier
Managing Big Data with Information Flow Control. CLOUD 2015: 524-531 - [c18]Guillaume Bury, David Delahaye, Damien Doligez, Pierre Halmagrand, Olivier Hermant:
Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo. LPAR (short papers) 2015: 42-58 - [c17]Gaëtan Gilbert, Olivier Hermant:
Normalisation by Completeness with Heyting Algebras. LPAR 2015: 469-482 - [i3]Richard Bonichon, Olivier Hermant
A syntactic soundness proof for free-variable tableaux with on-the-fly Skolemization. CoRR abs/1505.06376 (2015) - 2014
- [c16]Vivien Maisonneuve, Olivier Hermant
Computing Invariants with Transformers: Experimental Scalability and Accuracy. NSAD 2014: 17-31 - [i2]Lisa Allali, Olivier Hermant
Semantic A-translation and Super-consistency entail Classical Cut Elimination. CoRR abs/1401.0998 (2014) - 2013
- [c15]Truong Giang Le, Olivier Hermant
Using Event-Based Style for Developing M2M Applications. GPC 2013: 348-357 - [c14]Truong Giang Le, Dmitriy Fedosov, Olivier Hermant
Programming Robots with Events. IESS 2013: 14-25 - [c13]Mélanie Boudard, Olivier Hermant:
Polarizing Double-Negation Translations. LPAR 2013: 182-197 - [c12]David Delahaye, Damien Doligez, Frédéric Gilbert, Pierre Halmagrand, Olivier Hermant
Zenon Modulo: When Achilles Outruns the Tortoise Using Deduction Modulo. LPAR 2013: 274-290 - [c11]Lisa Allali, Olivier Hermant
Semantic A-translations and Super-Consistency Entail Classical Cut Elimination. LPAR 2013: 407-422 - [i1]Mélanie Boudard, Olivier Hermant
Polarizing Double Negation Translations. CoRR abs/1312.5420 (2013) - 2012
- [j3]Gilles Dowek
A Simple Proof that Super-Consistency Implies Cut Elimination. Notre Dame J. Formal Log. 53(4): 439-456 (2012) - [c10]Truong Giang Le, Olivier Hermant, Matthieu Manceny, Renaud Pawlak, Renaud Rioboo:
Unifying Event-based and Rule-based Styles to Develop Concurrent and Context-aware Reactive Applications - Toward a Convenient Support for Concurrent and Reactive Programming. ICSOFT 2012: 347-350 - [c9]Mathieu Boespflug, Quentin Carbonneaux, Olivier Hermant:
The λΠ-calculus Modulo as a Universal Proof Language. PxTP 2012: 28-43 - [c8]Denis Cousineau, Olivier Hermant
A Semantic Proof that Reducibility Candidates entail Cut Elimination. RTA 2012: 133-148 - 2011
- [c7]Truong Giang Le, Olivier Hermant, Matthieu Manceny, Renaud Pawlak:
Dynamic Adaptation through Event Reconfiguration. OTM Workshops 2011: 637-646 - [c6]Aloïs Brunel, Olivier Hermant, Clément Houtmann:
Orthogonality and Boolean Algebras for Deduction Modulo. TLCA 2011: 76-90 - 2010
- [j2]Olivier Hermant
Resolution is Cut-Free. J. Autom. Reason. 44(3): 245-276 (2010) - [j1]Olivier Hermant, James Lipton:
Completeness and Cut-elimination in the Intuitionistic Theory of Types - Part 2. J. Log. Comput. 20(2): 597-602 (2010)
2000 – 2009
- 2008
- [c5]Olivier Hermant
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms. CSL 2008: 169-183 - 2007
- [c4]Gilles Dowek, Olivier Hermant
A Simple Proof That Super-Consistency Implies Cut Elimination. RTA 2007: 93-106 - 2006
- [c3]Richard Bonichon, Olivier Hermant
A Semantic Completeness Proof for TaMeD. LPAR 2006: 167-181 - [c2]Richard Bonichon, Olivier Hermant
On Constructive Cut Admissibility in Deduction Modulo. TYPES 2006: 33-47 - 2005
- [c1]Olivier Hermant:
Semantic Cut Elimination in the Intuitionistic Sequent Calculus. TLCA 2005: 221-233
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-08-05 20:24 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: