Computer Science – Logic in Computer Science
Scientific paper
2007-07-09
Dans 16th EACSL Annual Conference on Computer Science and Logic - CSL 2007 (2007)
Computer Science
Logic in Computer Science
Scientific paper
It is commonly agreed that the success of future proof assistants will rely on their ability to incorporate computations within deduction in order to mimic the mathematician when replacing the proof of a proposition P by the proof of an equivalent proposition P' obtained from P thanks to possibly complex calculations. In this paper, we investigate a new version of the calculus of inductive constructions which incorporates arbitrary decision procedures into deduction via the conversion rule of the calculus. The novelty of the problem in the context of the calculus of inductive constructions lies in the fact that the computation mechanism varies along proof-checking: goals are sent to the decision procedure together with the set of user hypotheses available from the current context. Our main result shows that this extension of the calculus of constructions does not compromise its main properties: confluence, subject reduction, strong normalization and consistency are all preserved.
Blanqui Frédéric
Jouannaud Jean-Pierre
Strub Pierre-Yves
No associations
LandOfFree
Building Decision Procedures in the Calculus of Inductive Constructions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Building Decision Procedures in the Calculus of Inductive Constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Building Decision Procedures in the Calculus of Inductive Constructions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-159309