Frédéric Blanqui
Orcid: 0000-0001-7438-5554
According to our database1,
Frédéric Blanqui
authored at least 52 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Log. Methods Comput. Sci., 2024
Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024
Translating Libraries of Definitions and Theorems Between Proof Systems (Invited Talk).
Proceedings of the 15th International Conference on Interactive Theorem Proving, 2024
2023
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
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
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
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020
2019
Proceedings of the Proceedings Sixth Workshop on Proof eXchange for Theorem Proving, 2019
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019
2018
Termination of λΠ modulo rewriting using the size-change principle (work in progress).
CoRR, 2018
2016
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility.
Theor. Comput. Sci., 2016
2015
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
Inf. Media Technol., 2011
Proceedings of the Certified Programs and Proofs - First International Conference, 2011
2010
Theor. Comput. Sci., 2010
2009
Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems.
IEICE Trans. Inf. Syst., 2009
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
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008
2007
Proceedings of the Logic for Programming, 2007
Proceedings of the Programming Languages and Systems, 2007
Proceedings of the Computer Science Logic, 21st International Workshop, 2007
2006
An Isabelle formalization of protocol-independent secrecy with an application to e-commerce
CoRR, 2006
Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems.
Proceedings of the Logic for Programming, 2006
Proceedings of the Logic for Programming, 2006
Proceedings of the Foundations of Software Science and Computation Structures, 2006
2005
Math. Struct. Comput. Sci., 2005
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
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003
2002
2001
2000
Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000
1999
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