Skip to content

Removes costrong and cochoice from costar #38

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
thomashoneyman merged 2 commits into from
Dec 17, 2020
Merged

Removes costrong and cochoice from costar #38

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
bf02df0
Removes costrong and cochoice from costar
Dec 11, 2020
ad3e702
Removes unused import
Dec 11, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 0 additions & 17 deletions src/Data/Profunctor/Costar.purs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,13 +6,10 @@ import Control.Comonad (class Comonad, extract)
import Control.Extend (class Extend, (=<=))

import Data.Distributive (class Distributive, distribute)
import Data.Either (Either(..), either)
import Data.Functor.Invariant (class Invariant, imapF)
import Data.Newtype (class Newtype)
import Data.Profunctor (class Profunctor, lcmap)
import Data.Profunctor.Closed (class Closed)
import Data.Profunctor.Cochoice (class Cochoice)
import Data.Profunctor.Costrong (class Costrong)
import Data.Profunctor.Strong (class Strong)
import Data.Tuple (Tuple(..), fst, snd)

Expand Down Expand Up @@ -58,20 +55,6 @@ instance strongCostar :: Comonad f => Strong (Costar f) where
first (Costar f) = Costar \x -> Tuple (f (map fst x)) (snd (extract x))
second (Costar f) = Costar \x -> Tuple (fst (extract x)) (f (map snd x))

instance costrongCostar :: Functor f => Costrong (Costar f) where
unfirst (Costar f) = Costar \fb ->
let bd = f ((\a -> Tuple a (snd bd)) <$> fb) in fst bd
unsecond (Costar f) = Costar \fb ->
let db = f ((\a -> Tuple (fst db) a) <$> fb) in snd db

instance cochoiceCostar :: Applicative f => Cochoice (Costar f) where
unleft (Costar f) =
let g = either identity (\r -> g (pure (Right r))) <<< f
in Costar (g <<< map Left)
unright (Costar f) =
let g = either (\l -> g (pure (Left l))) identity <<< f
in Costar (g <<< map Right)

instance closedCostar :: Functor f => Closed (Costar f) where
closed (Costar f) = Costar \g x -> f (map (_ $ x) g)

Expand Down