author nipkow
Wed, 18 Oct 2000 17:19:18 +0200
changeset 10242 028f54cd2cc9
parent 10225 b9fd52525b69
child 10327 19214ac381cf
permissions -rw-r--r--
*** empty log message ***

\chapter{Inductively Defined Sets}
\index{inductive definition|(}

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.


\index{inductive definition|)}

\section{Advanced inductive definitions}