Computer Science – Logic in Computer Science
Scientific paper
2006-10-12
Fundamenta Informaticae 65, 1-2 (2005) 61-86
Computer Science
Logic in Computer Science
Journal version of TLCA'03
Scientific paper
In a previous work, we proved that an important part of the Calculus of Inductive Constructions (CIC), the basis of the Coq proof assistant, can be seen as a Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In this paper, we prove that almost all CIC can be seen as a CAC, and that it can be further extended with non-strictly positive types and inductive-recursive types together with non-free constructors and pattern-matching on defined symbols.
No associations
LandOfFree
Inductive types in the Calculus of Algebraic 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 Inductive types in the Calculus of Algebraic Constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inductive types in the Calculus of Algebraic Constructions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-442776