doc-src/Tutorial/Misc/Sep2.thy

modified proofs: better rules for cancellation of common factors across comparisons

Sep2 = List +
consts sep :: "'a * 'a list => 'a list"
recdef sep "measure (%(a,xs). length xs)"
    "sep(a, x#y#zs) = x # a # sep(a,y#zs)"
    "sep(a, xs)     = xs"
end