## Induction principles formalized in the Calculus of Constructions (1988)

Venue: | Programming of Future Generation Computers. Elsevier Science |

Citations: | 10 - 4 self |

### BibTeX

@INPROCEEDINGS{Huet88inductionprinciples,

author = {Gérard Huet},

title = {Induction principles formalized in the Calculus of Constructions},

booktitle = {Programming of Future Generation Computers. Elsevier Science},

year = {1988},

pages = {276--286},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin-Löf [14] and Scott [18]. The calculus and its syntactic theory were presented in Coquand’s thesis [7], and an implementation by the author was used to mechanically verify a substantial number of proofs demonstrating the power of expression of the formalism [9]. The Calculus of Constructions is proposed as a foundation for the design of programming environments where programs are developed consistently with formal specifications. The current paper shows how to define inductive concepts in the calculus. A very general induction schema is obtained by postulating all elements of the type of interest to belong to the standard interpretation associated with a predicate map. This is similar to the treatment of D. Park [16], but the power of expression of the formalism permits a very direct treatment, in a language that is formalized enough to be actually implemented on computer. Special instances of the induction schema specialize to Nœtherian induction and Structural induction over any algebraic type. Computational Induction is treated in an axiomatization of Domain Theory in Constructions. It is argued that the resulting principle is more powerful than LCF’s [13], since the restriction on admissibility is expressible in the object language. Notations We assume the reader is familiar with the Calculus of Constructions, as presented in [7, 9, 10, 11]. More precisely, we shall use in the present paper the extended system defined in Section 11 of [8]. The notation [x: A]B stands for the algorithm with formal parameter x of type A and body B, whereas (x: A)B stands for the product of types B indexed by x ranging over A. Thus square brackets are used for λ-abstraction, whereas parentheses stand for product formation. The atom P rop is the type of logical propositions. The atom T ype stands for the first level in the predicative hierarchy of types (and thus we have P rop: T ype). We abbreviate (x: A)B into A → B whenever x does not occur in B. When B: P rop, we think of (x: A)B as the universally quantified proposition ∀x: A·B. When x does not occur in B and A: P rop,

### Citations

545 |
A lattice-theoretical fixpoint theorem and its applications
- Tarski
- 1955
(Show Context)
Citation Context ... is concluded easily, that is Γ ⊢ T arski : (Eq (f x0) x0)), with T arski := (Leqantisym (f x0) x0 Lemma2 Lemma3). The careful reader will check that this is the traditional proof of Tarski’s theorem =-=[20]-=-. We may now use Tarski’s theorem in the particular case of the subset relation. That is, we instantiate the type variable T with Set, (Leq x y) becomes y ⊆ x, and Eq is set equality. The hypotheses L... |

485 |
The calculus of constructions
- Coquand, Huet
- 1988
(Show Context)
Citation Context ... powerful than LCF’s [13], since the restriction on admissibility is expressible in the object language. Notations We assume the reader is familiar with the Calculus of Constructions, as presented in =-=[7, 9, 10, 11]-=-. More precisely, we shall use in the present paper the extended system defined in Section 11 of [8]. The notation [x : A]B stands for the algorithm with formal parameter x of type A and body B, where... |

242 |
Interpre'tation fonctionnelle et e'limination des coupures de l'arithme'tique d'ordre supe'rieur
- Girard
- 1972
(Show Context)
Citation Context ...ons 1 Gérard Huet INRIA 2 France The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard =-=[12]-=-, Martin-Löf [14] and Scott [18]. The calculus and its syntactic theory were presented in Coquand’s thesis [7], and an implementation by the author was used to mechanically verify a substantial number... |

220 | Data Types as Lattices - Scott - 1976 |

93 |
1980], A survey of the project AUTOMATH
- Bruijn
(Show Context)
Citation Context ...s of Constructions 1 Gérard Huet INRIA 2 France The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn =-=[2, 3]-=-, Girard [12], Martin-Löf [14] and Scott [18]. The calculus and its syntactic theory were presented in Coquand’s thesis [7], and an implementation by the author was used to mechanically verify a subst... |

91 | Proving properties of programs by structural induction
- Burstall
- 1969
(Show Context)
Citation Context ...x ∈ A ⇒ E, and similarly we let {x ∈ A | E} stand for {x | x ∈ A ∧ E}. We shall also use the notation ∃x ∈ A · E to stand for ∃[x : U](x ∈ A ∧ E). We shall now show how to express structural induction=-=[4]-=- in the calculus. First we define the relation “f preserves A”, when f is a U-function (i.e. f : U → U) and A is a U-set: (P reserve f A) := ∀x ∈ A · (f x) ∈ A. Now we define what it means for the ele... |

73 |
Constructions: A higher order proof system for mechanizing mathematics
- Coquand, Huet
(Show Context)
Citation Context ...heory were presented in Coquand’s thesis [7], and an implementation by the author was used to mechanically verify a substantial number of proofs demonstrating the power of expression of the formalism =-=[9]-=-. The Calculus of Constructions is proposed as a foundation for the design of programming environments where programs are developed consistently with formal specifications. The current paper shows how... |

70 | An analysis of Girard's paradox
- Coquand
- 1986
(Show Context)
Citation Context ...ons We assume the reader is familiar with the Calculus of Constructions, as presented in [7, 9, 10, 11]. More precisely, we shall use in the present paper the extended system defined in Section 11 of =-=[8]-=-. The notation [x : A]B stands for the algorithm with formal parameter x of type A and body B, whereas (x : A)B stands for the product of types B indexed by x ranging over A. Thus square brackets are ... |

65 | An intuitionistic theory of types
- Martin-Löf
- 1972
(Show Context)
Citation Context ... INRIA 2 France The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin-Löf =-=[14]-=- and Scott [18]. The calculus and its syntactic theory were presented in Coquand’s thesis [7], and an implementation by the author was used to mechanically verify a substantial number of proofs demons... |

43 |
Fixpoint induction and proofs of program properties”, in
- Park
- 1969
(Show Context)
Citation Context ... induction schema is obtained by postulating all elements of the type of interest to belong to the standard interpretation associated with a predicate map. This is similar to the treatment of D. Park =-=[16]-=-, but the power of expression of the formalism permits a very direct treatment, in a language that is formalized enough to be actually implemented on computer. Special instances of the induction schem... |

22 | Constructing recursion operators in intuitionistic type theory - Paulson - 1986 |

15 |
Une Théorie des Constructions. Thèse de troisième cycle
- Coquand
- 1985
(Show Context)
Citation Context ...tive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin-Löf [14] and Scott [18]. The calculus and its syntactic theory were presented in Coquand’s thesis =-=[7]-=-, and an implementation by the author was used to mechanically verify a substantial number of proofs demonstrating the power of expression of the formalism [9]. The Calculus of Constructions is propos... |

8 |
Concepts Mathématiques et Informatiques Formalisés dans le Calcul des Constructions.” Presented at the Colloque de Logique d’Orsay
- Coquand, Huet
- 1985
(Show Context)
Citation Context ... powerful than LCF’s [13], since the restriction on admissibility is expressible in the object language. Notations We assume the reader is familiar with the Calculus of Constructions, as presented in =-=[7, 9, 10, 11]-=-. More precisely, we shall use in the present paper the extended system defined in Section 11 of [8]. The notation [x : A]B stands for the algorithm with formal parameter x of type A and body B, where... |

5 |
Constructive validity, Symposium on Automatic Demonstration
- Scott
- 1968
(Show Context)
Citation Context ... The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin-Löf [14] and Scott =-=[18]-=-. The calculus and its syntactic theory were presented in Coquand’s thesis [7], and an implementation by the author was used to mechanically verify a substantial number of proofs demonstrating the pow... |

2 |
Automath a language for mathematics.” Les Presses de l’Université de Montréal
- Bruijn
- 1973
(Show Context)
Citation Context ...s of Constructions 1 Gérard Huet INRIA 2 France The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn =-=[2, 3]-=-, Girard [12], Martin-Löf [14] and Scott [18]. The calculus and its syntactic theory were presented in Coquand’s thesis [7], and an implementation by the author was used to mechanically verify a subst... |

2 | First and Second-Order Lambda Calculi with Recursive Types - Mendler - 1986 |