(* Copyright 2006, 2008 Andrew W. Appel, Robert Dockins and Xavier Leroy * This file is part of the List-machine Benchmark. * The List-machine Benchmark is licensed under GPLv3; see LICENSE. *)
(*** Library of finite maps indexed by positive binary integers ***)
Require Export ZArith.
Remark get_leaf:
forall (n: positive), get Leaf n = None.
Proof get_empty.
intros m; induction m; intros;
destruct v; simpl; auto.
Qed.

Lemma unset_other : forall m v v',
v <> v' ->
get (unset m v) v' = get m v'.