Clik here to view.
Computability Closure: Ten Years Later.
Frédéric Blanqui: Computability Closure: Ten Years Later. CoRR abs/0707.1372 (2007)
View ArticleClik here to view.
Building Decision Procedures in the Calculus of Inductive Constructions.
Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub: Building Decision Procedures in the Calculus of Inductive Constructions. CoRR abs/0707.1266 (2007)
View ArticleClik here to view.
HORPO with Computability Closure: A Reconstruction.
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: HORPO with Computability Closure: A Reconstruction. LPAR 2007: 138-150
View ArticleClik here to view.
On the Implementation of Construction Functions for Non-free Concrete Data...
Frédéric Blanqui, Thérèse Hardin, Pierre Weis: On the Implementation of Construction Functions for Non-free Concrete Data Types. ESOP 2007: 95-109
View ArticleClik here to view.
Building Decision Procedures in the Calculus of Inductive Constructions.
Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub: Building Decision Procedures in the Calculus of Inductive Constructions. CSL 2007: 328-342
View ArticleClik here to view.
Computability Closure: Ten Years Later.
Frédéric Blanqui: Computability Closure: Ten Years Later. Rewriting, Computation and Proof 2007: 68-88
View ArticleClik here to view.
The computability path ordering: the end of a quest.
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: The computability path ordering: the end of a quest. CoRR abs/0806.2517 (2008)
View ArticleClik here to view.
From formal proofs to mathematical proofs: a safe, incremental way for...
Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub: From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures. CoRR abs/0804.3762 (2008)
View ArticleClik here to view.
From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for...
Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub: From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures. IFIP TCS 2008: 349-365
View ArticleClik here to view.
The Computability Path Ordering: The End of a Quest.
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: The Computability Path Ordering: The End of a Quest. CSL 2008: 1-14
View ArticleClik here to view.
On the relation between size-based termination and semantic labelling.
Frédéric Blanqui, Cody Roux: On the relation between size-based termination and semantic labelling. CoRR abs/0906.4173 (2009)
View ArticleClik here to view.
On the Relation between Sized-Types Based Termination and Semantic Labelling.
Frédéric Blanqui, Cody Roux: On the Relation between Sized-Types Based Termination and Semantic Labelling. CSL 2009: 147-162
View ArticleClik here to view.
Static Dependency Pair Method Based on Strong Computability for Higher-Order...
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui: Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems. IEICE Trans. Inf. Syst. 92-D(10):...
View ArticleClik here to view.
On the confluence of lambda-calculus with conditional rewriting.
Frédéric Blanqui, Claude Kirchner, Colin Riba: On the confluence of lambda-calculus with conditional rewriting. Theor. Comput. Sci. 411(37): 3301-3327 (2010)
View ArticleClik here to view.
Static Dependency Pair Method based on Strong Computability for Higher-Order...
Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui: Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems. CoRR abs/1109.5468 (2011)
View ArticleClik here to view.
Argument filterings and usable rules in higher-order rewrite systems.
Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui: Argument filterings and usable rules in higher-order rewrite systems. CoRR abs/1109.4357 (2011)
View ArticleClik here to view.
On the confluence of lambda-calculus with conditional rewriting.
Frédéric Blanqui, Claude Kirchner, Colin Riba: On the confluence of lambda-calculus with conditional rewriting. CoRR abs/1109.4353 (2011)
View ArticleClik here to view.
Designing a CPU model: from a pseudo-formal document to fast code.
Frédéric Blanqui, Claude Helmstetter, Vania Joloboff, Jean-François Monin, Xiaomu Shi: Designing a CPU model: from a pseudo-formal document to fast code. CoRR abs/1109.4351 (2011)
View ArticleClik here to view.
First Steps towards the Certification of an ARM Simulator Using Compcert.
Xiaomu Shi, Jean-François Monin, Frédéric Tuong, Frédéric Blanqui: First Steps towards the Certification of an ARM Simulator Using Compcert. CPP 2011: 346-361
View ArticleClik here to view.
CoLoR: a Coq library on well-founded rewrite relations and its application to...
Frédéric Blanqui, Adam Koprowski: CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. Math. Struct. Comput. Sci. 21(4):...
View ArticleClik here to view.
Automated verification of termination certificates.
Frédéric Blanqui, Kim Quyen Ly: Automated verification of termination certificates. CoRR abs/1212.2350 (2012)
View ArticleClik here to view.
CoLoR: a Coq library on well-founded rewrite relations and its application to...
Frédéric Blanqui, Adam Koprowski: CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. CoRR abs/1202.6473 (2012)
View ArticleClik here to view.
First steps towards the certification of an ARM simulator using Compcert.
Xiaomu Shi, Jean-François Monin, Frédéric Tuong, Frédéric Blanqui: First steps towards the certification of an ARM simulator using Compcert. CoRR abs/1202.6472 (2012)
View ArticleClik here to view.
Terminaison des systèmes de réécriture d'ordre supérieur basée sur la notion...
Frédéric Blanqui: Terminaison des systèmes de réécriture d'ordre supérieur basée sur la notion de clôture de calculabilité. (Termination of higher-order rewrite systems based on the notion of...
View ArticleClik here to view.
Termination of rewrite relations on $λ$-terms based on Girard's notion of...
Frédéric Blanqui: Termination of rewrite relations on $λ$-terms based on Girard's notion of reducibility. CoRR abs/1509.00649 (2015)
View ArticleClik here to view.
A point on fixpoints in posets.
Frédéric Blanqui: A point on fixpoints in posets. CoRR abs/1502.06021 (2015)
View ArticleClik here to view.
The computability path ordering.
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio: The computability path ordering. Log. Methods Comput. Sci. 11(4) (2015)
View ArticleClik here to view.
Termination of rewrite relations on λ-terms based on Girard's notion of...
Frédéric Blanqui: Termination of rewrite relations on λ-terms based on Girard's notion of reducibility. Theor. Comput. Sci. 611: 50-86 (2016)
View ArticleClik here to view.
Termination of λΠ modulo rewriting using the size-change principle (work in...
Frédéric Blanqui, Guillaume Genestier: Termination of λΠ modulo rewriting using the size-change principle (work in progress). CoRR abs/1812.01853 (2018)
View ArticleClik here to view.
Higher-order dependency pairs.
Frédéric Blanqui: Higher-order dependency pairs. CoRR abs/1804.08855 (2018)
View ArticleClik here to view.
Size-based termination of higher-order rewriting.
Frédéric Blanqui: Size-based termination of higher-order rewriting. CoRR abs/1802.06603 (2018)
View ArticleClik here to view.
Proceedings of the 13th International Workshop on Logical Frameworks and...
Frédéric Blanqui, Giselle Reis: Proceedings of the 13th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP@FSCD 2018, Oxford, UK, 7th July 2018. EPTCS 274, 2018...
View ArticleClik here to view.
Size-based termination of higher-order rewriting.
Frédéric Blanqui: Size-based termination of higher-order rewriting. J. Funct. Program. 28: e11 (2018)
View ArticleClik here to view.
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting.
Frédéric Blanqui, Guillaume Genestier, Olivier Hermant: Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. CoRR abs/1906.11649 (2019)
View ArticleClik here to view.
EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended...
Mohamed Yacine El Haddad, Guillaume Burel, Frédéric Blanqui: EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract). PxTP 2019: 27-35
View ArticleClik here to view.
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting.
Frédéric Blanqui, Guillaume Genestier, Olivier Hermant: Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. FSCD 2019: 9:1-9:21
View ArticleClik here to view.
The New Rewriting Engine of Dedukti.
Gabriel Hondet, Frédéric Blanqui: The New Rewriting Engine of Dedukti. CoRR abs/2010.16115 (2020)
View ArticleClik here to view.
Type safety of rewrite rules in dependent types.
Frédéric Blanqui: Type safety of rewrite rules in dependent types. CoRR abs/2010.16111 (2020)
View ArticleClik here to view.
Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus...
Gabriel Hondet, Frédéric Blanqui: Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus Modulo Theory. TYPES 2020: 6:1-6:18
View ArticleClik here to view.
The New Rewriting Engine of Dedukti (System Description).
Gabriel Hondet, Frédéric Blanqui: The New Rewriting Engine of Dedukti (System Description). FSCD 2020: 35:1-35:16
View ArticleClik here to view.
Type Safety of Rewrite Rules in Dependent Types.
Frédéric Blanqui: Type Safety of Rewrite Rules in Dependent Types. FSCD 2020: 13:1-13:14
View ArticleClik here to view.
Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2)...
Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada: Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]. Theor. Comput. Sci. 817: 81-82 (2020)
View ArticleClik here to view.
Some axioms for mathematics.
Frédéric Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, François Thiré: Some axioms for mathematics. CoRR abs/2111.00543 (2021)
View ArticleClik here to view.
Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus...
Gabriel Hondet, Frédéric Blanqui: Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus Modulo Theory. CoRR abs/2110.13704 (2021)
View ArticleClik here to view.
Some Axioms for Mathematics.
Frédéric Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, François Thiré: Some Axioms for Mathematics. FSCD 2021: 20:1-20:19
View ArticleClik here to view.
Translating proofs from an impredicative type system to a predicative one.
Thiago Felicissimo, Frédéric Blanqui, Ashish Kumar Barnawal: Translating proofs from an impredicative type system to a predicative one. CoRR abs/2211.05700 (2022)
View ArticleClik here to view.
Encoding Type Universes Without Using Matching Modulo Associativity and...
Frédéric Blanqui: Encoding Type Universes Without Using Matching Modulo Associativity and Commutativity. FSCD 2022: 24:1-24:14
View ArticleClik here to view.
Sharing proofs with predicative theories through universe polymorphic...
Thiago Felicissimo, Frédéric Blanqui: Sharing proofs with predicative theories through universe polymorphic elaboration. CoRR abs/2308.15465 (2023)
View ArticleClik here to view.
Translating Proofs from an Impredicative Type System to a Predicative One.
Thiago Felicissimo, Frédéric Blanqui, Ashish Kumar Barnawal: Translating Proofs from an Impredicative Type System to a Predicative One. CSL 2023: 19:1-19:19
View ArticleClik here to view.
A modular construction of type theories.
Frédéric Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, François Thiré: A modular construction of type theories. Log. Methods Comput. Sci. 19(1) (2023)
View Article
