proposition: Lemma finenc_one : one ≅ (forall r, r -> r).
proof: Proof. intros. exists (fun u r => id). exists (fun _ => tt). extensionalize. rewrite (@id_parametricity A). reflexivity. Admitted. Lemma finenc_a : forall a, a ≅ (forall r, (a -> r) -> r). Proof. intros. rewrite <- (Cont_iso a). apply iso_ext; intros. unfold Cont. 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