doc-src/TutorialI/Inductive/inductive.tex
author obua
Tue, 07 Jun 2005 20:04:41 +0200
changeset 16313 79b37d5e50b1
parent 11428 332347b9b942
child 23843 4cd60e5d2999
permissions -rw-r--r--
A flag DEFS_CHAIN_HISTORY can be used to improve the error message in case a cycle has been detected. If it is switched off and a cycle has been detected, the user is notified that there is such a flag.

\chapter{Inductively Defined Sets} \label{chap:inductive}
\index{inductive definitions|(}

This chapter is dedicated to the most important definition principle after
recursive functions and datatypes: inductively defined sets.

We start with a simple example: the set of even numbers.  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. Advanced forms of inductive definitions are discussed in
{\S}\ref{sec:adv-ind-def}. To demonstrate the versatility of inductive
definitions, the chapter closes with a case study from the realm of
context-free grammars. The first two sections are required reading for anybody
interested in mathematical modelling.

\input{Inductive/even-example}
\input{Inductive/document/Mutual}
\input{Inductive/document/Star}

\section{Advanced Inductive Definitions}
\label{sec:adv-ind-def}
\input{Inductive/advanced-examples}

\input{Inductive/document/AB}

\index{inductive definitions|)}