9722
|
1 |
%
|
|
2 |
\begin{isabellebody}%
|
9924
|
3 |
\def\isabellecontext{ABexpr}%
|
8749
|
4 |
%
|
|
5 |
\begin{isamarkuptext}%
|
|
6 |
Sometimes it is necessary to define two datatypes that depend on each
|
|
7 |
other. This is called \textbf{mutual recursion}. As an example consider a
|
|
8 |
language of arithmetic and boolean expressions where
|
|
9 |
\begin{itemize}
|
|
10 |
\item arithmetic expressions contain boolean expressions because there are
|
|
11 |
conditional arithmetic expressions like ``if $m<n$ then $n-m$ else $m-n$'',
|
|
12 |
and
|
|
13 |
\item boolean expressions contain arithmetic expressions because of
|
|
14 |
comparisons like ``$m<n$''.
|
|
15 |
\end{itemize}
|
|
16 |
In Isabelle this becomes%
|
|
17 |
\end{isamarkuptext}%
|
9673
|
18 |
\isacommand{datatype}\ {\isacharprime}a\ aexp\ {\isacharequal}\ IF\ \ \ {\isachardoublequote}{\isacharprime}a\ bexp{\isachardoublequote}\ {\isachardoublequote}{\isacharprime}a\ aexp{\isachardoublequote}\ {\isachardoublequote}{\isacharprime}a\ aexp{\isachardoublequote}\isanewline
|
|
19 |
\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ {\isacharbar}\ Sum\ \ {\isachardoublequote}{\isacharprime}a\ aexp{\isachardoublequote}\ {\isachardoublequote}{\isacharprime}a\ aexp{\isachardoublequote}\isanewline
|
|
20 |
\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ {\isacharbar}\ Diff\ {\isachardoublequote}{\isacharprime}a\ aexp{\isachardoublequote}\ {\isachardoublequote}{\isacharprime}a\ aexp{\isachardoublequote}\isanewline
|
|
21 |
\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ {\isacharbar}\ Var\ {\isacharprime}a\isanewline
|
|
22 |
\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ {\isacharbar}\ Num\ nat\isanewline
|
|
23 |
\isakeyword{and}\ \ \ \ \ \ {\isacharprime}a\ bexp\ {\isacharequal}\ Less\ {\isachardoublequote}{\isacharprime}a\ aexp{\isachardoublequote}\ {\isachardoublequote}{\isacharprime}a\ aexp{\isachardoublequote}\isanewline
|
|
24 |
\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ {\isacharbar}\ And\ \ {\isachardoublequote}{\isacharprime}a\ bexp{\isachardoublequote}\ {\isachardoublequote}{\isacharprime}a\ bexp{\isachardoublequote}\isanewline
|
|
25 |
\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ {\isacharbar}\ Neg\ \ {\isachardoublequote}{\isacharprime}a\ bexp{\isachardoublequote}%
|
8749
|
26 |
\begin{isamarkuptext}%
|
|
27 |
\noindent
|
|
28 |
Type \isa{aexp} is similar to \isa{expr} in \S\ref{sec:ExprCompiler},
|
|
29 |
except that we have fixed the values to be of type \isa{nat} and that we
|
9792
|
30 |
have fixed the two binary operations \isa{aexp{\isachardot}Sum} and \isa{Diff}. Boolean
|
8749
|
31 |
expressions can be arithmetic comparisons, conjunctions and negations.
|
|
32 |
The semantics is fixed via two evaluation functions%
|
|
33 |
\end{isamarkuptext}%
|
9673
|
34 |
\isacommand{consts}\ \ evala\ {\isacharcolon}{\isacharcolon}\ {\isachardoublequote}{\isacharprime}a\ aexp\ {\isasymRightarrow}\ {\isacharparenleft}{\isacharprime}a\ {\isasymRightarrow}\ nat{\isacharparenright}\ {\isasymRightarrow}\ nat{\isachardoublequote}\isanewline
|
|
35 |
\ \ \ \ \ \ \ \ evalb\ {\isacharcolon}{\isacharcolon}\ {\isachardoublequote}{\isacharprime}a\ bexp\ {\isasymRightarrow}\ {\isacharparenleft}{\isacharprime}a\ {\isasymRightarrow}\ nat{\isacharparenright}\ {\isasymRightarrow}\ bool{\isachardoublequote}%
|
8749
|
36 |
\begin{isamarkuptext}%
|
|
37 |
\noindent
|
9792
|
38 |
that take an expression and an environment (a mapping from variables \isa{{\isacharprime}a} to values
|
8771
|
39 |
\isa{nat}) and return its arithmetic/boolean
|
8749
|
40 |
value. Since the datatypes are mutually recursive, so are functions that
|
|
41 |
operate on them. Hence they need to be defined in a single \isacommand{primrec}
|
|
42 |
section:%
|
|
43 |
\end{isamarkuptext}%
|
|
44 |
\isacommand{primrec}\isanewline
|
10187
|
45 |
\ \ {\isachardoublequote}evala\ {\isacharparenleft}IF\ b\ a{\isadigit{1}}\ a{\isadigit{2}}{\isacharparenright}\ env\ {\isacharequal}\isanewline
|
|
46 |
\ \ \ \ \ {\isacharparenleft}if\ evalb\ b\ env\ then\ evala\ a{\isadigit{1}}\ env\ else\ evala\ a{\isadigit{2}}\ env{\isacharparenright}{\isachardoublequote}\isanewline
|
|
47 |
\ \ {\isachardoublequote}evala\ {\isacharparenleft}Sum\ a{\isadigit{1}}\ a{\isadigit{2}}{\isacharparenright}\ env\ {\isacharequal}\ evala\ a{\isadigit{1}}\ env\ {\isacharplus}\ evala\ a{\isadigit{2}}\ env{\isachardoublequote}\isanewline
|
|
48 |
\ \ {\isachardoublequote}evala\ {\isacharparenleft}Diff\ a{\isadigit{1}}\ a{\isadigit{2}}{\isacharparenright}\ env\ {\isacharequal}\ evala\ a{\isadigit{1}}\ env\ {\isacharminus}\ evala\ a{\isadigit{2}}\ env{\isachardoublequote}\isanewline
|
9673
|
49 |
\ \ {\isachardoublequote}evala\ {\isacharparenleft}Var\ v{\isacharparenright}\ env\ {\isacharequal}\ env\ v{\isachardoublequote}\isanewline
|
|
50 |
\ \ {\isachardoublequote}evala\ {\isacharparenleft}Num\ n{\isacharparenright}\ env\ {\isacharequal}\ n{\isachardoublequote}\isanewline
|
8749
|
51 |
\isanewline
|
10187
|
52 |
\ \ {\isachardoublequote}evalb\ {\isacharparenleft}Less\ a{\isadigit{1}}\ a{\isadigit{2}}{\isacharparenright}\ env\ {\isacharequal}\ {\isacharparenleft}evala\ a{\isadigit{1}}\ env\ {\isacharless}\ evala\ a{\isadigit{2}}\ env{\isacharparenright}{\isachardoublequote}\isanewline
|
|
53 |
\ \ {\isachardoublequote}evalb\ {\isacharparenleft}And\ b{\isadigit{1}}\ b{\isadigit{2}}{\isacharparenright}\ env\ {\isacharequal}\ {\isacharparenleft}evalb\ b{\isadigit{1}}\ env\ {\isasymand}\ evalb\ b{\isadigit{2}}\ env{\isacharparenright}{\isachardoublequote}\isanewline
|
9673
|
54 |
\ \ {\isachardoublequote}evalb\ {\isacharparenleft}Neg\ b{\isacharparenright}\ env\ {\isacharequal}\ {\isacharparenleft}{\isasymnot}\ evalb\ b\ env{\isacharparenright}{\isachardoublequote}%
|
8749
|
55 |
\begin{isamarkuptext}%
|
|
56 |
\noindent
|
|
57 |
In the same fashion we also define two functions that perform substitution:%
|
|
58 |
\end{isamarkuptext}%
|
9673
|
59 |
\isacommand{consts}\ substa\ {\isacharcolon}{\isacharcolon}\ {\isachardoublequote}{\isacharparenleft}{\isacharprime}a\ {\isasymRightarrow}\ {\isacharprime}b\ aexp{\isacharparenright}\ {\isasymRightarrow}\ {\isacharprime}a\ aexp\ {\isasymRightarrow}\ {\isacharprime}b\ aexp{\isachardoublequote}\isanewline
|
|
60 |
\ \ \ \ \ \ \ substb\ {\isacharcolon}{\isacharcolon}\ {\isachardoublequote}{\isacharparenleft}{\isacharprime}a\ {\isasymRightarrow}\ {\isacharprime}b\ aexp{\isacharparenright}\ {\isasymRightarrow}\ {\isacharprime}a\ bexp\ {\isasymRightarrow}\ {\isacharprime}b\ bexp{\isachardoublequote}%
|
8749
|
61 |
\begin{isamarkuptext}%
|
|
62 |
\noindent
|
|
63 |
The first argument is a function mapping variables to expressions, the
|
|
64 |
substitution. It is applied to all variables in the second argument. As a
|
9792
|
65 |
result, the type of variables in the expression may change from \isa{{\isacharprime}a}
|
|
66 |
to \isa{{\isacharprime}b}. Note that there are only arithmetic and no boolean variables.%
|
8749
|
67 |
\end{isamarkuptext}%
|
|
68 |
\isacommand{primrec}\isanewline
|
10187
|
69 |
\ \ {\isachardoublequote}substa\ s\ {\isacharparenleft}IF\ b\ a{\isadigit{1}}\ a{\isadigit{2}}{\isacharparenright}\ {\isacharequal}\isanewline
|
|
70 |
\ \ \ \ \ IF\ {\isacharparenleft}substb\ s\ b{\isacharparenright}\ {\isacharparenleft}substa\ s\ a{\isadigit{1}}{\isacharparenright}\ {\isacharparenleft}substa\ s\ a{\isadigit{2}}{\isacharparenright}{\isachardoublequote}\isanewline
|
|
71 |
\ \ {\isachardoublequote}substa\ s\ {\isacharparenleft}Sum\ a{\isadigit{1}}\ a{\isadigit{2}}{\isacharparenright}\ {\isacharequal}\ Sum\ {\isacharparenleft}substa\ s\ a{\isadigit{1}}{\isacharparenright}\ {\isacharparenleft}substa\ s\ a{\isadigit{2}}{\isacharparenright}{\isachardoublequote}\isanewline
|
|
72 |
\ \ {\isachardoublequote}substa\ s\ {\isacharparenleft}Diff\ a{\isadigit{1}}\ a{\isadigit{2}}{\isacharparenright}\ {\isacharequal}\ Diff\ {\isacharparenleft}substa\ s\ a{\isadigit{1}}{\isacharparenright}\ {\isacharparenleft}substa\ s\ a{\isadigit{2}}{\isacharparenright}{\isachardoublequote}\isanewline
|
9673
|
73 |
\ \ {\isachardoublequote}substa\ s\ {\isacharparenleft}Var\ v{\isacharparenright}\ {\isacharequal}\ s\ v{\isachardoublequote}\isanewline
|
|
74 |
\ \ {\isachardoublequote}substa\ s\ {\isacharparenleft}Num\ n{\isacharparenright}\ {\isacharequal}\ Num\ n{\isachardoublequote}\isanewline
|
8749
|
75 |
\isanewline
|
10187
|
76 |
\ \ {\isachardoublequote}substb\ s\ {\isacharparenleft}Less\ a{\isadigit{1}}\ a{\isadigit{2}}{\isacharparenright}\ {\isacharequal}\ Less\ {\isacharparenleft}substa\ s\ a{\isadigit{1}}{\isacharparenright}\ {\isacharparenleft}substa\ s\ a{\isadigit{2}}{\isacharparenright}{\isachardoublequote}\isanewline
|
|
77 |
\ \ {\isachardoublequote}substb\ s\ {\isacharparenleft}And\ b{\isadigit{1}}\ b{\isadigit{2}}{\isacharparenright}\ {\isacharequal}\ And\ {\isacharparenleft}substb\ s\ b{\isadigit{1}}{\isacharparenright}\ {\isacharparenleft}substb\ s\ b{\isadigit{2}}{\isacharparenright}{\isachardoublequote}\isanewline
|
9673
|
78 |
\ \ {\isachardoublequote}substb\ s\ {\isacharparenleft}Neg\ b{\isacharparenright}\ {\isacharequal}\ Neg\ {\isacharparenleft}substb\ s\ b{\isacharparenright}{\isachardoublequote}%
|
8749
|
79 |
\begin{isamarkuptext}%
|
|
80 |
Now we can prove a fundamental theorem about the interaction between
|
|
81 |
evaluation and substitution: applying a substitution $s$ to an expression $a$
|
|
82 |
and evaluating the result in an environment $env$ yields the same result as
|
|
83 |
evaluation $a$ in the environment that maps every variable $x$ to the value
|
|
84 |
of $s(x)$ under $env$. If you try to prove this separately for arithmetic or
|
|
85 |
boolean expressions (by induction), you find that you always need the other
|
|
86 |
theorem in the induction step. Therefore you need to state and prove both
|
|
87 |
theorems simultaneously:%
|
|
88 |
\end{isamarkuptext}%
|
9673
|
89 |
\isacommand{lemma}\ {\isachardoublequote}evala\ {\isacharparenleft}substa\ s\ a{\isacharparenright}\ env\ {\isacharequal}\ evala\ a\ {\isacharparenleft}{\isasymlambda}x{\isachardot}\ evala\ {\isacharparenleft}s\ x{\isacharparenright}\ env{\isacharparenright}\ {\isasymand}\isanewline
|
|
90 |
\ \ \ \ \ \ \ \ evalb\ {\isacharparenleft}substb\ s\ b{\isacharparenright}\ env\ {\isacharequal}\ evalb\ b\ {\isacharparenleft}{\isasymlambda}x{\isachardot}\ evala\ {\isacharparenleft}s\ x{\isacharparenright}\ env{\isacharparenright}{\isachardoublequote}\isanewline
|
|
91 |
\isacommand{apply}{\isacharparenleft}induct{\isacharunderscore}tac\ a\ \isakeyword{and}\ b{\isacharparenright}%
|
8749
|
92 |
\begin{isamarkuptxt}%
|
|
93 |
\noindent
|
|
94 |
The resulting 8 goals (one for each constructor) are proved in one fell swoop:%
|
|
95 |
\end{isamarkuptxt}%
|
10171
|
96 |
\isacommand{apply}\ simp{\isacharunderscore}all%
|
8749
|
97 |
\begin{isamarkuptext}%
|
|
98 |
In general, given $n$ mutually recursive datatypes $\tau@1$, \dots, $\tau@n$,
|
|
99 |
an inductive proof expects a goal of the form
|
|
100 |
\[ P@1(x@1)\ \land \dots \land P@n(x@n) \]
|
|
101 |
where each variable $x@i$ is of type $\tau@i$. Induction is started by
|
9792
|
102 |
\begin{isabelle}
|
|
103 |
\isacommand{apply}\isa{{\isacharparenleft}induct{\isacharunderscore}tac} $x@1$ \isa{and} \dots\ \isa{and} $x@n$\isa{{\isacharparenright}}
|
|
104 |
\end{isabelle}
|
8749
|
105 |
|
|
106 |
\begin{exercise}
|
9792
|
107 |
Define a function \isa{norma} of type \isa{{\isacharprime}a\ aexp\ {\isasymRightarrow}\ {\isacharprime}a\ aexp} that
|
8749
|
108 |
replaces \isa{IF}s with complex boolean conditions by nested
|
|
109 |
\isa{IF}s where each condition is a \isa{Less} --- \isa{And} and
|
|
110 |
\isa{Neg} should be eliminated completely. Prove that \isa{norma}
|
|
111 |
preserves the value of an expression and that the result of \isa{norma}
|
|
112 |
is really normal, i.e.\ no more \isa{And}s and \isa{Neg}s occur in
|
|
113 |
it. ({\em Hint:} proceed as in \S\ref{sec:boolex}).
|
|
114 |
\end{exercise}%
|
|
115 |
\end{isamarkuptext}%
|
9722
|
116 |
\end{isabellebody}%
|
9145
|
117 |
%%% Local Variables:
|
|
118 |
%%% mode: latex
|
|
119 |
%%% TeX-master: "root"
|
|
120 |
%%% End:
|