Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrédéric Blanqui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c26]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- 2022
- [c25]Frédéric Blanqui:
Encoding Type Universes Without Using Matching Modulo Associativity and Commutativity. FSCD 2022: 24:1-24:14 - [i41]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) - 2021
- [c24]Frédéric Blanqui
, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, François Thiré:
Some Axioms for Mathematics. FSCD 2021: 20:1-20:19 - [i40]Gabriel Hondet, Frédéric Blanqui:
Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus Modulo Theory. CoRR abs/2110.13704 (2021) - [i39]Frédéric Blanqui, Gilles Dowek, Émilie Grienenberger, Gabriel Hondet, François Thiré:
Some axioms for mathematics. CoRR abs/2111.00543 (2021) - 2020
- [j11]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) - [c23]Frédéric Blanqui:
Type Safety of Rewrite Rules in Dependent Types. FSCD 2020: 13:1-13:14 - [c22]Gabriel Hondet, Frédéric Blanqui:
The New Rewriting Engine of Dedukti (System Description). FSCD 2020: 35:1-35:16 - [c21]Gabriel Hondet, Frédéric Blanqui:
Encoding of Predicate Subtyping with Proof Irrelevance in the λΠ-Calculus Modulo Theory. TYPES 2020: 6:1-6:18 - [i38]Frédéric Blanqui:
Type safety of rewrite rules in dependent types. CoRR abs/2010.16111 (2020) - [i37]Gabriel Hondet, Frédéric Blanqui:
The New Rewriting Engine of Dedukti. CoRR abs/2010.16115 (2020)
2010 – 2019
- 2019
- [c20]Frédéric Blanqui, Guillaume Genestier, Olivier Hermant:
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. FSCD 2019: 9:1-9:21 - [c19]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 - [i36]Frédéric Blanqui, Guillaume Genestier, Olivier Hermant:
Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. CoRR abs/1906.11649 (2019) - 2018
- [j10]Frédéric Blanqui:
Size-based termination of higher-order rewriting. J. Funct. Program. 28: e11 (2018) - [e1]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 [contents] - [i35]Frédéric Blanqui:
Size-based termination of higher-order rewriting. CoRR abs/1802.06603 (2018) - [i34]Frédéric Blanqui:
Higher-order dependency pairs. CoRR abs/1804.08855 (2018) - [i33]Frédéric Blanqui, Guillaume Genestier:
Termination of λΠ modulo rewriting using the size-change principle (work in progress). CoRR abs/1812.01853 (2018) - 2016
- [j9]Frédéric Blanqui:
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility. Theor. Comput. Sci. 611: 50-86 (2016) - 2015
- [j8]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
The computability path ordering. Log. Methods Comput. Sci. 11(4) (2015) - [i32]Frédéric Blanqui:
A point on fixpoints in posets. CoRR abs/1502.06021 (2015) - [i31]Frédéric Blanqui:
Termination of rewrite relations on $λ$-terms based on Girard's notion of reducibility. CoRR abs/1509.00649 (2015) - 2012
- [b2]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 computability closure). Paris Diderot University, France, 2012 - [i30]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) - [i29]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) - [i28]Frédéric Blanqui, Kim Quyen Ly:
Automated verification of termination certificates. CoRR abs/1212.2350 (2012) - 2011
- [j7]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): 827-859 (2011) - [c18]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 - [i27]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) - [i26]Frédéric Blanqui, Claude Kirchner, Colin Riba:
On the confluence of lambda-calculus with conditional rewriting. CoRR abs/1109.4353 (2011) - [i25]Sho Suzuki, Keiichirou Kusakari, Frédéric Blanqui:
Argument filterings and usable rules in higher-order rewrite systems. CoRR abs/1109.4357 (2011) - [i24]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) - 2010
- [j6]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)
2000 – 2009
- 2009
- [j5]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): 2007-2015 (2009) - [c17]Frédéric Blanqui, Cody Roux:
On the Relation between Sized-Types Based Termination and Semantic Labelling. CSL 2009: 147-162 - [i23]Frédéric Blanqui, Cody Roux:
On the relation between size-based termination and semantic labelling. CoRR abs/0906.4173 (2009) - 2008
- [c16]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
The Computability Path Ordering: The End of a Quest. CSL 2008: 1-14 - [c15]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 - [i22]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) - [i21]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
The computability path ordering: the end of a quest. CoRR abs/0806.2517 (2008) - 2007
- [c14]Frédéric Blanqui:
Computability Closure: Ten Years Later. Rewriting, Computation and Proof 2007: 68-88 - [c13]Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub:
Building Decision Procedures in the Calculus of Inductive Constructions. CSL 2007: 328-342 - [c12]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 - [c11]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
HORPO with Computability Closure: A Reconstruction. LPAR 2007: 138-150 - [i20]Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub:
Building Decision Procedures in the Calculus of Inductive Constructions. CoRR abs/0707.1266 (2007) - [i19]Frédéric Blanqui:
Computability Closure: Ten Years Later. CoRR abs/0707.1372 (2007) - [i18]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
HORPO with Computability Closure : A Reconstruction. CoRR abs/0708.3582 (2007) - [i17]Frédéric Blanqui, Thérèse Hardin, Pierre Weis:
On the implementation of construction functions for non-free concrete data types. CoRR abs/cs/0701031 (2007) - 2006
- [c10]Frédéric Blanqui, Claude Kirchner, Colin Riba:
On the Confluence of lambda-Calculus with Conditional Rewriting. FoSSaCS 2006: 382-397 - [c9]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
Higher-Order Termination: From Kruskal to Computability. LPAR 2006: 1-14 - [c8]Frédéric Blanqui, Colin Riba:
Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems. LPAR 2006: 105-119 - [i16]Frédéric Blanqui:
Decidability of Type-checking in the Calculus of Algebraic Constructions with Size Annotations. CoRR abs/cs/0608125 (2006) - [i15]Frédéric Blanqui, Claude Kirchner, Colin Riba:
On the confluence of lambda-calculus with conditional rewriting. CoRR abs/cs/0609002 (2006) - [i14]Frédéric Blanqui, Colin Riba:
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems. CoRR abs/cs/0609013 (2006) - [i13]Frédéric Blanqui:
(HO)RPO Revisited. CoRR abs/cs/0609037 (2006) - [i12]Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio:
Higher-Order Termination: from Kruskal to Computability. CoRR abs/cs/0609039 (2006) - [i11]Frédéric Blanqui:
A type-based termination criterion for dependently-typed higher-order rewrite systems. CoRR abs/cs/0610062 (2006) - [i10]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
The Calculus of Algebraic Constructions. CoRR abs/cs/0610063 (2006) - [i9]Frédéric Blanqui:
Termination and Confluence of Higher-Order Rewrite Systems. CoRR abs/cs/0610064 (2006) - [i8]Frédéric Blanqui:
Definitions by Rewriting in the Calculus of Constructions. CoRR abs/cs/0610065 (2006) - [i7]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Inductive-data-type Systems. CoRR abs/cs/0610066 (2006) - [i6]Frédéric Blanqui:
Type theory and rewriting. CoRR abs/cs/0610068 (2006) - [i5]Frédéric Blanqui:
An Isabelle formalization of protocol-independent secrecy with an application to e-commerce. CoRR abs/cs/0610069 (2006) - [i4]Frédéric Blanqui:
Inductive types in the Calculus of Algebraic Constructions. CoRR abs/cs/0610070 (2006) - [i3]Frédéric Blanqui:
Rewriting modulo in Deduction modulo. CoRR abs/cs/0610071 (2006) - [i2]Frédéric Blanqui:
Definitions by rewriting in the Calculus of Constructions. CoRR abs/cs/0610072 (2006) - [i1]Frédéric Blanqui:
Inductive types in the Calculus of Algebraic Constructions. CoRR abs/cs/0610073 (2006) - 2005
- [j4]Frédéric Blanqui:
Inductive types in the Calculus of Algebraic Constructions. Fundam. Informaticae 65(1-2): 61-86 (2005) - [j3]Frédéric Blanqui:
Definitions by rewriting in the Calculus of Constructions. Math. Struct. Comput. Sci. 15(1): 37-92 (2005) - [c7]Frédéric Blanqui:
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations. CSL 2005: 135-150 - 2004
- [c6]Frédéric Blanqui:
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems. RTA 2004: 24-39 - 2003
- [c5]Frédéric Blanqui:
Rewriting Modulo in Deduction Modulo. RTA 2003: 395-409 - [c4]Frédéric Blanqui:
Inductive Types in the Calculus of Algebraic Constructions. TLCA 2003: 46-59 - 2002
- [j2]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
Inductive-data-type systems. Theor. Comput. Sci. 272(1-2): 41-68 (2002) - 2001
- [b1]Frédéric Blanqui:
Théorie des types et réécriture. (Type theory and rewriting). University of Paris-Sud, Orsay, France, 2001 - [c3]Frédéric Blanqui:
Definitions by Rewriting in the Calculus of Constructions. LICS 2001: 9-18 - 2000
- [c2]Frédéric Blanqui:
Termination and Confluence of Higher-Order Rewrite Systems. RTA 2000: 47-61
1990 – 1999
- 1999
- [c1]Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada:
The Calculus of algebraic Constructions. RTA 1999: 301-316 - 1997
- [j1]Frédéric Blanqui:
A document-centered approach for an open CASE environment framework connected with the world-wide web. ACM SIGSOFT Softw. Eng. Notes 22(2): 58-63 (1997)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-03-26 00:10 CET 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:
