|Maintainer||Edward Kmett <firstname.lastname@example.org>|
- type Iso a b c d = forall k f. (Isomorphic k, Functor f) => k (c -> f d) (a -> f b)
- iso :: (Isomorphic k, Functor f) => (a -> b) -> (b -> a) -> k (b -> f b) (a -> f a)
- isos :: (Isomorphic k, Functor f) => (a -> c) -> (c -> a) -> (b -> d) -> (d -> b) -> k (c -> f d) (a -> f b)
- au :: Simple Iso a b -> ((a -> b) -> c -> b) -> c -> a
- auf :: Simple Iso a b -> ((d -> b) -> c -> b) -> (d -> a) -> c -> a
- under :: Isomorphism (c -> Mutator d) (a -> Mutator b) -> (a -> b) -> c -> d
- from :: Isomorphic k => Isomorphism a b -> k b a
- via :: Isomorphic k => Isomorphism a b -> k a b
- data Isomorphism a b = Isomorphism (a -> b) (b -> a)
- class Category k => Isomorphic k where
- _const :: Iso a b (Const a c) (Const b d)
- identity :: Iso a b (Identity a) (Identity b)
- type SimpleIso a b = Iso a a b b
Isomorphim families can be composed with other lenses using either (
from the Prelude or from Control.Category. However, if you compose them
with each other using (
.) from the Prelude, they will be dumbed down to a
import Control.Category import Prelude hiding ((.),id)
type Iso a b c d = forall k f. (
Overloadedk f a b c d
ala from Conor McBride's work on Epigram.
Mnemonically, au is a French contraction of à le.
:m + Control.Lens Data.Monoid.Lens Data.Foldable
au _sum foldMap [1,2,3,4]10
ala' from Conor McBride's work on Epigram.
Mnemonically, the German auf plays a similar role to à la, and the combinator is au with an extra function argument.
A concrete data type for isomorphisms.
This lets you place an isomorphism inside a container without using
|Isomorphism (a -> b) (b -> a)|
Used to provide overloading of isomorphism application
This is a
Category with a canonical mapping to it from the
category of isomorphisms over Haskell types.
Build this morphism out of an isomorphism
The intention is that by using
isomorphic, you can supply both halves of an
isomorphism, but k can be instantiated to
(->), so you can freely use
the resulting isomorphism as a function.
Map a morphism in the target category using an isomorphism between morphisms in Hask.