summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
file |
latest |
revisions |
annotate |
diff |
comparison |
raw |
help

doc-src/TutorialI/Inductive/inductive.tex

changeset 10242 | 028f54cd2cc9 |

parent 10225 | b9fd52525b69 |

child 10327 | 19214ac381cf |

--- a/doc-src/TutorialI/Inductive/inductive.tex Wed Oct 18 12:30:59 2000 +0200 +++ b/doc-src/TutorialI/Inductive/inductive.tex Wed Oct 18 17:19:18 2000 +0200 @@ -1,4 +1,21 @@ \chapter{Inductively Defined Sets} +\index{inductive definition|(} +\index{*inductive|(} + +This chapter is dedicated to the most important definition principle after +recursive functions and datatypes: inductively defined sets. + +We start with a simple example \ldots . A slightly more complicated example, the +reflexive transitive closure, is the subject of {\S}\ref{sec:rtc}. In particular, +some standard induction heuristics are discussed. To demonstrate the +versatility of inductive definitions, {\S}\ref{sec:CFG} presents a case study +from the realm of context-free grammars. The chapter closes with a discussion +of advanced forms of inductive definitions. \input{Inductive/document/Star} \input{Inductive/document/AB} + +\index{inductive definition|)} +\index{*inductive|)} + +\section{Advanced inductive definitions}