proposition: Lemma slowsort_nil : slowsort [::] = Ret [::].
proof: Proof. by rewrite /slowsort kleisliE qpermE bindretf assertE guardT bindskipf. Qed.
imports: mathcomp(all_ssreflect) monae_lib hierarchy monad_lib fail_lib state_lib infotheo(ssr_ext) Recdef Equations(Equations) mathcomp(ssrnat)