doc-src/TutorialI/Recdef/Nested0.thy
changeset 10186 499637e8f2c6
parent 9754 a123a64cadeb
child 10885 90695f46440b
equal deleted inserted replaced
10185:c452fea3ce74 10186:499637e8f2c6
    15 you needed to reprove many lemmas reminiscent of similar lemmas about
    15 you needed to reprove many lemmas reminiscent of similar lemmas about
    16 @{term"rev"}. We will now show you how \isacommand{recdef} can simplify
    16 @{term"rev"}. We will now show you how \isacommand{recdef} can simplify
    17 definitions and proofs about nested recursive datatypes. As an example we
    17 definitions and proofs about nested recursive datatypes. As an example we
    18 choose exercise~\ref{ex:trev-trev}:
    18 choose exercise~\ref{ex:trev-trev}:
    19 *}
    19 *}
    20 (* consts trev  :: "('a,'b)term => ('a,'b)term" *)
    20 
    21 (*<*)
    21 consts trev  :: "('a,'b)term \<Rightarrow> ('a,'b)term"
    22 end
    22 (*<*)end(*>*)
    23 (*>*)