Control.Monad.Hyper

Based on the construction of hyperfunctions as parameterized monads in http://crab.rutgers.edu/~pjohann/f14-ghani.pdf

Documentation

class ContraFunctor f where

Methods

contramap :: (a -> b) -> f b -> f a

Instances

ContraFunctor (Const a)

ContraFunctor (ContraF a)

ContraFunctor (Const2 t a)

(Bifunctor p Hask Hask Hask, ContraFunctor f, ContraFunctor g) => ContraFunctor (Lift p f g)

type Hyper h a = Fix (PHyper h)

A generic recursive hyperfunction-like combinator

type Hyp e a = Hyper (ContraF e) a

Traditional Hyper functions

newtype PHyper h a b

Constructors

PHyper

Fields

runPHyper :: h b -> a

Instances

ContraFunctor h => PPointed (PHyper h)

ContraFunctor h => PApplicative (PHyper h)

ContraFunctor h => PMonad (PHyper h)

ContraFunctor h => QFunctor (PHyper h) Hask Hask

PFunctor (PHyper h) Hask Hask

ContraFunctor h => Bifunctor (PHyper h) Hask Hask Hask