International audienceThis 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 types equipped with higher-order primitive recursion, by providing definitions of functions by pattern-matching which capture recursor definitions for arbitrary non-dependent and non-polymorphic inductive types satisfying a strictly positivity condition. CAC also generalizes the first-order framework of abstract data types by providing dependent types and higher-order rewrite rules
International audienceIn a previous work (''Abstract Data Type Systems'', TCS 173(2), 1997), the las...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
International audienceThis paper is concerned with the foundations of the Calculus of Algebraic Cons...
International audienceThis paper is concerned with the foundations of the Calculus of Algebraic Cons...
International audienceIn a previous work, we proved that almost all of the Calculus of Inductive Con...
International audienceIn a previous work, we proved that almost all of the Calculus of Inductive Con...
Journal version of TLCA'03International audienceIn a previous work, we proved that an important part...
AbstractThis paper is concerned with the foundations of an extension of pure type systems by abstrac...
We define the notion of an inductively defined type in the Calculus of Constructions and show how in...
Abstract: "We define the notion of an inductively defined type in the Calculus of Constructions and ...
: In a previous work ("Abstract Data Type Systems", TCS 173(2):349--391 (1997)), the last ...
The Calculus of Constructions (CC) ([Coquand 1985]) is a typed lambda calculus for higher order intu...
International audienceIn a previous work (''Abstract Data Type Systems'', TCS 173(2), 1997), the las...
International audienceIn a previous work (''Abstract Data Type Systems'', TCS 173(2), 1997), the las...
International audienceIn a previous work (''Abstract Data Type Systems'', TCS 173(2), 1997), the las...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
International audienceThis paper is concerned with the foundations of the Calculus of Algebraic Cons...
International audienceThis paper is concerned with the foundations of the Calculus of Algebraic Cons...
International audienceIn a previous work, we proved that almost all of the Calculus of Inductive Con...
International audienceIn a previous work, we proved that almost all of the Calculus of Inductive Con...
Journal version of TLCA'03International audienceIn a previous work, we proved that an important part...
AbstractThis paper is concerned with the foundations of an extension of pure type systems by abstrac...
We define the notion of an inductively defined type in the Calculus of Constructions and show how in...
Abstract: "We define the notion of an inductively defined type in the Calculus of Constructions and ...
: In a previous work ("Abstract Data Type Systems", TCS 173(2):349--391 (1997)), the last ...
The Calculus of Constructions (CC) ([Coquand 1985]) is a typed lambda calculus for higher order intu...
International audienceIn a previous work (''Abstract Data Type Systems'', TCS 173(2), 1997), the las...
International audienceIn a previous work (''Abstract Data Type Systems'', TCS 173(2), 1997), the las...
International audienceIn a previous work (''Abstract Data Type Systems'', TCS 173(2), 1997), the las...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...