Abstract We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Construct...
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of d...
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...