Inductive Definitions in the System Coq Rules and Properties

Inductive Definitions in the System Coq Rules and Properties (1992)

by Christine Paulin-Mohring

Citations:

143 - 1 self

Datum	Value	Source
TITLE	Rules and Properties	SVM HeaderParse 0.1
AUTHOR NAME	Ecole Normale	SVM HeaderParse 0.1
AUTHOR AFFIL	Institut IMAG; Unit de recherche associe au CNRS n1398	SVM HeaderParse 0.2
AUTHOR NAME	Suprieure Lyon	SVM HeaderParse 0.1
AUTHOR AFFIL	Institut IMAG; Unit de recherche associe au CNRS n1398	SVM HeaderParse 0.2
AUTHOR NAME	In The System Coq	SVM HeaderParse 0.1
AUTHOR AFFIL	o	SVM HeaderParse 0.2
AUTHOR ADDR	92-49; Ecole Normale Suprieure de Lyon; 46, Alle d'Italie, 69364 Lyon Cedex 07, France,; Tlphone: + 33 72 72 80 00; Tlcopieur: + 33 72 72 80 80;	SVM HeaderParse 0.1
AUTHOR NAME	Adresses Lectroniques	SVM HeaderParse 0.1
AUTHOR NAME	Christine Paulin-mohring	SVM HeaderParse 0.1
ABSTRACT	In the pure Calculus of Constructions, it is possible to represent data structures and predicates using higher-order quantification. However, this representation is not satisfactory, from the point of view of both the efficiency of the underlying programs and the power of the logical system. For these reasons, the calculus was extended with a primitive notion of inductive definitions [8]. This paper describes the rules for inductive definitions in the system Coq. They are general enough to be seen as one formulation of adding inductive definitions to a typed lambda-calculus. We prove strong normalization for a subsystem of Coq corresponding to the pure Calculus of Constructions plus Inductive Definitions with only weak non-dependent eliminations.	SVM HeaderParse 0.1
CITATIONS	23 found	ParsCit 1.0