Frédéric Blanqui

Orcid: 0000-0001-7438-5554

According to our database1, Frédéric Blanqui authored at least 50 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A modular construction of type theories.
Log. Methods Comput. Sci., 2023

Sharing proofs with predicative theories through universe polymorphic elaboration.
CoRR, 2023

Translating Proofs from an Impredicative Type System to a Predicative One.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
Encoding Type Universes Without Using Matching Modulo Associativity and Commutativity.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Some Axioms for Mathematics.
Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020
Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68].
Theor. Comput. Sci., 2020

The New Rewriting Engine of Dedukti.
CoRR, 2020

Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus Modulo Theory.
Proceedings of the 26th International Conference on Types for Proofs and Programs, 2020

The New Rewriting Engine of Dedukti (System Description).
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

Type Safety of Rewrite Rules in Dependent Types.
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019
EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract).
Proceedings of the Proceedings Sixth Workshop on Proof eXchange for Theorem Proving, 2019

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018
Size-based termination of higher-order rewriting.
J. Funct. Program., 2018

Termination of λΠ modulo rewriting using the size-change principle (work in progress).
CoRR, 2018

Higher-order dependency pairs.
CoRR, 2018

2016
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility.
Theor. Comput. Sci., 2016

2015
The computability path ordering.
Log. Methods Comput. Sci., 2015

A point on fixpoints in posets.
CoRR, 2015

2012
Automated verification of termination certificates
CoRR, 2012

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 computability closure).
, 2012

2011
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates.
Math. Struct. Comput. Sci., 2011

Argument filterings and usable rules in higher-order rewrite systems
CoRR, 2011

Designing a CPU model: from a pseudo-formal document to fast code
CoRR, 2011

First Steps towards the Certification of an ARM Simulator Using Compcert.
Proceedings of the Certified Programs and Proofs - First International Conference, 2011

2010
On the confluence of lambda-calculus with conditional rewriting.
Theor. Comput. Sci., 2010

2009
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems.
IEICE Trans. Inf. Syst., 2009

On the relation between size-based termination and semantic labelling
CoRR, 2009

On the Relation between Sized-Types Based Termination and Semantic Labelling.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2008
From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

The Computability Path Ordering: The End of a Quest.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
HORPO with Computability Closure: A Reconstruction.
Proceedings of the Logic for Programming, 2007

On the Implementation of Construction Functions for Non-free Concrete Data Types.
Proceedings of the Programming Languages and Systems, 2007

Building Decision Procedures in the Calculus of Inductive Constructions.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

Computability Closure: Ten Years Later.
Proceedings of the Rewriting, 2007

2006
An Isabelle formalization of protocol-independent secrecy with an application to e-commerce
CoRR, 2006

Type theory and rewriting
CoRR, 2006

(HO)RPO Revisited
CoRR, 2006

Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems.
Proceedings of the Logic for Programming, 2006

Higher-Order Termination: From Kruskal to Computability.
Proceedings of the Logic for Programming, 2006

On the Confluence of <i>lambda</i>-Calculus with Conditional Rewriting.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005
Definitions by rewriting in the Calculus of Constructions.
Math. Struct. Comput. Sci., 2005

Inductive types in the Calculus of Algebraic Constructions.
Fundam. Informaticae, 2005

Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems.
Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

2003
Rewriting Modulo in Deduction Modulo.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2002
Inductive-data-type systems.
Theor. Comput. Sci., 2002

2001
Théorie des types et réécriture. (Type theory and rewriting).
PhD thesis, 2001

2000
Termination and Confluence of Higher-Order Rewrite Systems.
Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

1999
The Calculus of algebraic Constructions.
Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

1997
A document-centered approach for an open CASE environment framework connected with the world-wide web.
ACM SIGSOFT Softw. Eng. Notes, 1997


  Loading...