• Publications
  • Influence
Inductive-data-type systems
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typedExpand
  • 66
  • 5
The Calculus of algebraic Constructions
This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generalizes inductive typesExpand
  • 67
  • 5
Termination and Confluence of Higher-Order Rewrite Systems
  • F. Blanqui
  • Computer Science, Mathematics
  • RTA
  • 10 July 2000
In the last twenty years, several approaches to higher-order rewriting have been proposed, among which Klop’s Combinatory Rewrite Systems (CRSs), Nipkow’s Higher-order Rewrite Systems (HRSs) andExpand
  • 42
  • 5
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates
Termination is an important property of programs, and is notably required for programs formulated in proof assistants. It is a very active subject of research in the Turing-complete formalism of termExpand
  • 43
  • 4
Definitions by rewriting in the calculus of constructions
  • F. Blanqui
  • Computer Science, Mathematics
  • Proceedings 16th Annual IEEE Symposium on Logic…
  • 16 June 2001
Considers an extension of the calculus of constructions where predicates can be defined with a general form of rewrite rules. We prove the strong normalization of the reduction relation generated byExpand
  • 35
  • 4
On the implementation of construction functions for non-free concrete data types
Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence classes of some equationalExpand
  • 16
  • 4
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
  • F. Blanqui
  • Mathematics, Computer Science
  • RTA
  • 3 June 2004
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providingExpand
  • 51
  • 3
Inductive types in the Calculus of Algebraic Constructions
  • F. Blanqui
  • Computer Science, Mathematics
  • Fundam. Informaticae
  • 10 June 2003
In a previous work, we proved that an important part of the Calculus of Inductive Constructions (CIC), the basis of the Coq proof assistant, can be seen as a Calculus of Algebraic ConstructionsExpand
  • 30
  • 3
Decidability of Type-checking in the Calculus of Algebraic Constructions with Size Annotations
  • F. Blanqui
  • Computer Science, Mathematics
  • ArXiv
  • 31 August 2006
Since Val Tannen's pioneer work on the combination of simply-typed lambda-calculus and first-order rewriting (LICS'88), many authors have contributed to this subject by extending it to richer typedExpand
  • 22
  • 3
Definitions by rewriting in the Calculus of Constructions
  • F. Blanqui
  • Computer Science, Mathematics
  • Math. Struct. Comput. Sci.
  • 1 February 2005
This paper presents general syntactic conditions ensuring the strong normalisation and the logical consistency of the Calculus of Algebraic Constructions, an extension of the Calculus ofExpand
  • 53
  • 2