(* 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.

Lemma get_set:
forall (m: map) (n1 n2: positive) (x: A),
get (set m n1 x) n2 =
if peq n1 n2 then Some x else get m n2.