comparison src/InductiveTypes.v @ 43:9bdbc43d510e

Make Chap. 3 title less grand
author Adam Chlipala <adamc@hcoop.net>
date Mon, 15 Sep 2008 10:05:37 -0400
parents d45ba7e9b266
children cb135b19adb8
comparison
equal deleted inserted replaced
42:7021e94dbbec 43:9bdbc43d510e
14 14
15 Set Implicit Arguments. 15 Set Implicit Arguments.
16 (* end hide *) 16 (* end hide *)
17 17
18 18
19 (** %\chapter{Inductive Types}% *) 19 (** %\chapter{Introducing Inductive Types}% *)
20 20
21 (** In a sense, CIC is built from just two relatively straightforward features: function types and inductive types. From this modest foundation, we can prove effectively all of the theorems of math and carry out effectively all program verifications, with enough effort expended. This chapter introduces induction and recursion in Coq and shares some "design patterns" for overcoming common pitfalls with them. *) 21 (** In a sense, CIC is built from just two relatively straightforward features: function types and inductive types. From this modest foundation, we can prove effectively all of the theorems of math and carry out effectively all program verifications, with enough effort expended. This chapter introduces induction and recursion in Coq and shares some "design patterns" for overcoming common pitfalls with them. *)
22 22
23 23
24 (** * Enumerations *) 24 (** * Enumerations *)