doc-src/TutorialI/Advanced/advanced.tex
author nipkow
Wed, 11 Oct 2000 09:09:06 +0200
changeset 10186 499637e8f2c6
parent 10178 aecb5bf6f76f
child 10187 0376cccd9118
permissions -rw-r--r--
*** empty log message ***
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
10178
aecb5bf6f76f *** empty log message ***
nipkow
parents: 10171
diff changeset
     1
\chapter{Advanced Simplification, Recursion and Induction}
aecb5bf6f76f *** empty log message ***
nipkow
parents: 10171
diff changeset
     2
\markboth{}{CHAPTER 4: ADVANCED SIMPLIFICATION, RECURSION ...}
9958
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
     3
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
     4
Although we have already learned a lot about simplification, recursion and
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
     5
induction, there are some advanced proof techniques that we have not covered
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
     6
yet and which are worth knowing about if you intend to beome a serious
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
     7
(human) theorem prover. The three sections of this chapter are almost
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
     8
independent of each other and can be read in any order. Only the notion of
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
     9
\emph{congruence rules}, introduced in the section on simplification, is
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    10
required for parts of the section on recursion.
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    11
9993
c0f7fb6e538e *** empty log message ***
nipkow
parents: 9958
diff changeset
    12
\input{Advanced/document/simp.tex}
9958
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    13
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    14
\section{Advanced forms of recursion}
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    15
\index{*recdef|(}
10186
499637e8f2c6 *** empty log message ***
nipkow
parents: 10178
diff changeset
    16
499637e8f2c6 *** empty log message ***
nipkow
parents: 10178
diff changeset
    17
\subsection{Recursion over nested datatypes}
499637e8f2c6 *** empty log message ***
nipkow
parents: 10178
diff changeset
    18
\label{sec:nested-recdef}
9993
c0f7fb6e538e *** empty log message ***
nipkow
parents: 9958
diff changeset
    19
\input{Recdef/document/Nested0.tex}
c0f7fb6e538e *** empty log message ***
nipkow
parents: 9958
diff changeset
    20
\input{Recdef/document/Nested1.tex}
c0f7fb6e538e *** empty log message ***
nipkow
parents: 9958
diff changeset
    21
\input{Recdef/document/Nested2.tex}
9958
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    22
\index{*recdef|)}
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    23
10186
499637e8f2c6 *** empty log message ***
nipkow
parents: 10178
diff changeset
    24
\subsection{Beyond measure}
499637e8f2c6 *** empty log message ***
nipkow
parents: 10178
diff changeset
    25
\label{sec:wellfounded}
499637e8f2c6 *** empty log message ***
nipkow
parents: 10178
diff changeset
    26
\input{Recdef/document/WFrec.tex}
499637e8f2c6 *** empty log message ***
nipkow
parents: 10178
diff changeset
    27
9958
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    28
\section{Advanced induction techniques}
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    29
\label{sec:advanced-ind}
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    30
\index{induction|(}
9993
c0f7fb6e538e *** empty log message ***
nipkow
parents: 9958
diff changeset
    31
\input{Misc/document/AdvancedInd.tex}
9958
67f2920862c7 *** empty log message ***
nipkow
parents:
diff changeset
    32
\index{induction|)}