Frédéric Blanqui
Title
Cited by
Cited by
Year
Inductive-data-type systems
F Blanqui, JP Jouannaud, M Okada
Theoretical computer science 272 (1-2), 41-68, 2002
1092002
Definitions by rewriting in the Calculus of Constructions
F Blanqui
Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 9-18, 2001
1032001
The calculus of algebraic constructions
F Blanqui, JP Jouannaud, M Okada
International Conference on Rewriting Techniques and Applications, 301-316, 1999
831999
CoLoR: a Coq Library on Rewriting and termination
F Blanqui, S Coupet-Grimal, W Delobel, S Hinderer, A Koprowski
662006
Termination and confluence of higher-order rewrite systems
F Blanqui
International Conference on Rewriting Techniques and Applications, 47-61, 2000
662000
A type-based termination criterion for dependently-typed higher-order rewrite systems
F Blanqui
International Conference on Rewriting Techniques and Applications, 24-39, 2004
652004
The computability path ordering: The end of a quest
F Blanqui, JP Jouannaud, A Rubio
International Workshop on Computer Science Logic, 1-14, 2008
552008
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates
F Blanqui, A Koprowski
arXiv preprint arXiv:1202.6473, 2012
542012
Static dependency pair method based on strong computability for higher-order rewrite systems
K Kusakari, Y Isogai, M Sakai, F Blanqui
IEICE TRANSACTIONS on Information and Systems 92 (10), 2007-2015, 2009
432009
Higher-order dependency pairs
F Blanqui
arXiv preprint arXiv:1804.08855, 2018
342018
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
F Blanqui, C Riba
International Conference on Logic for Programming Artificial Intelligence …, 2006
302006
Théorie des types et réécriture
F Blanqui
Université Paris Sud-Paris XI, 2001
302001
Inductive types in the Calculus of Algebraic Constructions
F Blanqui
Fundamenta Informaticae 65 (1-2), 61-86, 2005
282005
Decidability of type-checking in the Calculus of Algebraic Constructions with size annotations
F Blanqui
International Workshop on Computer Science Logic, 135-150, 2005
272005
Argument filterings and usable rules in higher-order rewrite systems
S Suzuki, K Kusakari, F Blanqui
IPSJ Online Transactions 4, 114-125, 2011
252011
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility
F Blanqui
Theoretical computer science 611, 50-86, 2016
242016
Building decision procedures in the calculus of inductive constructions
F Blanqui, JP Jouannaud, PY Strub
International Workshop on Computer Science Logic, 328-342, 2007
212007
From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures
F Blanqui, JP Jouannaud, PY Strub
Fifth Ifip International Conference On Theoretical Computer Science–Tcs 2008 …, 2008
202008
The computability path ordering
F Blanqui, JP Jouannaud, A Rubio
arXiv preprint arXiv:1506.03943, 2015
192015
On the implementation of construction functions for non-free concrete data types
F Blanqui, T Hardin, P Weis
European Symposium on Programming, 95-109, 2007
192007
The system can't perform the operation now. Try again later.
Articles 1–20