proposition: Lemma IStore_fun_iso : forall s t a b, (IStore s t ⟹ IStore a b) ≅ (s -> (Basics.arrow t ⟹ IStore a b)).
proof: Proof. intros. unfold Basics.arrow, Nat. rewrite exp_exp_sym_dep_iso. apply iso_ext; intros. unfold IStore. rewrite exp_mul_iso. reflexivity. Qed.
imports: Hask.Ltac Hask.Prelude Hask.Control.Applicative Hask.Control.Monad Hask.Control.Monad.Cont Hask.Control.Monad.State Hask.Data.Functor.Contravariant Hask.Data.Functor.Identity Hask.Data.Functor.Kan Hask.Data.Functor.Yoneda Hask.Control.Lens Coq.Classes.Morphisms Coq.Setoids.Setoid Coq.Init.Datatypes Coq.Relations.Relation_Definitions FunctionalExtensionality Hask.Data.Functor.Fix Hask.Control.Monad.Freer