Computer Science – Logic in Computer Science
Scientific paper
2008-06-10
LMCS 4 (3:8) 2008
Computer Science
Logic in Computer Science
20 pages
Scientific paper
10.2168/LMCS-4(3:8)2008
Adding rewriting to a proof assistant based on the Curry-Howard isomorphism, such as Coq, may greatly improve usability of the tool. Unfortunately adding an arbitrary set of rewrite rules may render the underlying formal system undecidable and inconsistent. While ways to ensure termination and confluence, and hence decidability of type-checking, have already been studied to some extent, logical consistency has got little attention so far. In this paper we show that consistency is a consequence of canonicity, which in turn follows from the assumption that all functions defined by rewrite rules are complete. We provide a sound and terminating, but necessarily incomplete algorithm to verify this property. The algorithm accepts all definitions that follow dependent pattern matching schemes presented by Coquand and studied by McBride in his PhD thesis. It also accepts many definitions by rewriting, containing rules which depart from standard pattern matching.
Chrzaszcz Jacek
Walukiewicz-Chrzaszcz Daria
No associations
LandOfFree
Consistency and Completeness of Rewriting in the Calculus of 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 Consistency and Completeness of Rewriting in the Calculus of Constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Consistency and Completeness of Rewriting in the Calculus of Constructions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-264315