proposition: Lemma algrec_init: forall p n n', algrec (alg_state (node_states (init p) n)) n' = 0.
proof: Proof. intros; reflexivity. Qed.
imports: Coq(FunctionalExtensionality List Bool) Coq(Arith Arith.Peano_dec Arith.Compare_dec) Coq(Program.Basics) Chapar(Predefs extralib KVStore)