Sciweavers

CORR
2012
Springer
212views Education» more  CORR 2012»
12 years 8 days ago
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdot...
AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
13 years 4 months ago
An effective proof of the well-foundedness of the multiset path ordering
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. ...
Solange Coupet-Grimal, William Delobel
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 4 months ago
From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures
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...
Frédéric Blanqui, Jean-Pierre Jouann...
TPHOL
2007
IEEE
13 years 10 months ago
Extracting Purely Functional Contents from Logical Inductive Types
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
David Delahaye, Catherine Dubois, Jean-Fréd...