Computer Science – Logic in Computer Science
Scientific paper
2006-10-11
Dans Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003 2701 (2003)
Computer Science
Logic in Computer Science
Scientific paper
In a previous work, we proved that almost all of the Calculus of Inductive Constructions (CIC), which is the basis of the proof assistant Coq, 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 not only prove that CIC as a whole can be seen as a CAC, but also that it can be extended with non-free constructors, pattern-matching on defined symbols, non-strictly positive types and inductive-recursive types.
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-578724