Contents

• Chapter 1  First Chapter!

0pt0.5ex

Chapter 1  First Chapter!

header {* Binary Tree *}

theory Foo
imports Main 
begin

chapter {* Induction rule *}

text {* 
  The following datatype definition of @{text "'a bintree"} 
  models binary trees with nodes being decorated by elements 
  of type @{typ 'a}. 
*} 

(* This is a comment *)
text_raw {* \begin{isabelle} *}
datatype 'a bintree =
  Leaf | Branch 'a "'a bintree" "'a bintree"
text_raw {* \end{isabelle} *}
text {* 
  \noindent The datatype induction rule generated here is 
  of the form @{thm [display] bintree.induct [no_vars]} 
*} 

end

Binary Tree theory Fooimports Main beginInduction rule The following datatype definition of a bintree models binary trees with nodes being decorated by elements of type a. datatype a bintree Leaf Branch a a bintree a bintree The datatype induction rule generated here is of the form P Leaf a bintree1 bintree2 P bintree1 P bintree2 P Branch a bintree1 bintree2 P bintreeend

This document was translated from L^AT_EX by H^EV^EA.