| Abstract: |
The correctness is shown of binary search tree operations
(lookup, insert and remove) implementing a set. Two versions are given, for both structured and
linear (tactic-style) proofs. An implementation of integer-indexed maps is also verified. |