(* We use evalDist as the probability measure.  Instead of supplying an event on the return type, we expect the computation to test for the occurrence of the event.  *)
Notation "'Pr' [ c  ] " := (evalDist c true) (at level 20).

Theorem evalDist_le_1_gen : forall (A : Set)(eqd : EqDec A)(c : Comp A)(ls : list A), NoDup ls -> sumList ls (evalDist c) <= 1.