Building Decision Procedures in the Calculus of Inductive Constructions

From MaRDI portal
Publication:3608422

DOI10.1007/978-3-540-74915-8_26zbMATH Open1179.68135arXiv0707.1266OpenAlexW1628824908MaRDI QIDQ3608422FDOQ3608422


Authors: Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub Edit this on Wikidata


Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0707.1266




Recommendations





Cited In (10)

Uses Software





This page was built for publication: Building Decision Procedures in the Calculus of Inductive Constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608422)