author | wenzelm |
Tue, 01 Aug 2000 13:43:22 +0200 | |
changeset 9490 | c2606af9922c |
parent 9145 | 9f7b8de5bfaf |
child 9493 | 494f8cd34df7 |
permissions | -rw-r--r-- |
\begin{isabelle}% % \begin{isamarkuptext}% \noindent Define the datatype of binary trees% \end{isamarkuptext}% \isacommand{datatype}~'a~tree~=~Tip~|~Node~{"}'a~tree{"}~'a~{"}'a~tree{"}% \begin{isamarkuptext}% \noindent and a function \isa{mirror} that mirrors a binary tree by swapping subtrees (recursively). Prove% \end{isamarkuptext}% \isacommand{lemma}~mirror\_mirror:~{"}mirror(mirror~t)~=~t{"}\end{isabelle}% %%% Local Variables: %%% mode: latex %%% TeX-master: "root" %%% End: