Inductive Types in the Calculus of Algebraic Constructions

  • Frédéric Blanqui
Conference paper

DOI: 10.1007/3-540-44904-3_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2701)
Cite this paper as:
Blanqui F. (2003) Inductive Types in the Calculus of Algebraic Constructions. In: Hofmann M. (eds) Typed Lambda Calculi and Applications. TLCA 2003. Lecture Notes in Computer Science, vol 2701. Springer, Berlin, Heidelberg

Abstract

In a previous work, we proved that almost all of the Calculus of Inductive Constructions (CIC), 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 prove that CIC as a whole can be seen as a CAC, and that it can be extended with non-strictly positive types and inductive-recursive types together with non-free constructors and pattern-matching on defined symbols.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Frédéric Blanqui
    • 1
  1. 1.Laboratoire d’Informatique de l’École PolytechniquePalaiseau CedexFrance

Personalised recommendations