1.1 --- a/doc-src/TutorialI/Misc/Tree2.thy	Fri Sep 01 18:29:52 2000 +0200
     1.2 +++ b/doc-src/TutorialI/Misc/Tree2.thy	Fri Sep 01 19:09:44 2000 +0200
     1.3 @@ -3,9 +3,9 @@
     1.4  (*>*)
     1.5  
     1.6  text{*\noindent In Exercise~\ref{ex:Tree} we defined a function
     1.7 -\isa{flatten} from trees to lists. The straightforward version of
     1.8 -\isa{flatten} is based on \isa{\at} and is thus, like \isa{rev}, quadratic.
     1.9 -A linear time version of \isa{flatten} again reqires an extra
    1.10 +@{term"flatten"} from trees to lists. The straightforward version of
    1.11 +@{term"flatten"} is based on @{text"@"} and is thus, like @{term"rev"},
    1.12 +quadratic. A linear time version of @{term"flatten"} again reqires an extra
    1.13  argument, the accumulator: *}
    1.14  
    1.15  consts flatten2 :: "'a tree => 'a list => 'a list"
    1.16 @@ -15,7 +15,7 @@
    1.17  "flatten2 (Node l x r) xs = flatten2 l (x#(flatten2 r xs))"
    1.18  (*>*)
    1.19  
    1.20 -text{*\noindent Define \isa{flatten2} and prove
    1.21 +text{*\noindent Define @{term"flatten2"} and prove
    1.22  *}
    1.23  (*<*)
    1.24  lemma [simp]: "!xs. flatten2 t xs = flatten t @ xs";