DDF.PE

Documentation

data P repr h a where

Constructors

Open :: (forall hout. EnvT repr h hout -> P repr hout a) -> P repr h a

Unk :: repr h a -> P repr h a

Known :: K repr h a -> repr h a -> (forall hout. EnvT repr h hout -> P repr hout a) -> (forall any. P repr (any, h) a) -> (forall hh ht. (hh, ht) ~ h => P repr ht (hh -> a)) -> P repr h a

Instances

DBI r => DBI (P r)

Methods

z :: P r (a, h) a

s :: P r h b -> P r (a, h) b

abs :: P r (a, h) b -> P r h (a -> b)

app :: P r h (a -> b) -> P r h a -> P r h b

hoas :: (P r (a, h) a -> P r (a, h) b) -> P r h (a -> b)

com :: P r h ((b -> c) -> (a -> b) -> a -> c)

flip :: P r h ((a -> b -> c) -> b -> a -> c)

id :: P r h (a -> a)

const :: P r h (a -> b -> a)

scomb :: P r h ((a -> b -> c) -> (a -> b) -> a -> c)

dup :: P r h ((a -> a -> b) -> a -> b)

let_ :: P r h (a -> (a -> b) -> b)

Prod r => Prod (P r)

Methods

mkProd :: P r h (a -> b -> (a, b))

zro :: P r h ((a, b) -> a)

fst :: P r h ((a, b) -> b)

swap :: P r h ((x, y) -> (y, x))

curry :: P r h (((a, b) -> c) -> a -> b -> c)

uncurry :: P r h ((a -> b -> c) -> (a, b) -> c)

Sum r => Sum (P r)

Methods

left :: P r h (a -> Either a b)

right :: P r h (b -> Either a b)

sumMatch :: P r h ((a -> c) -> (b -> c) -> Either a b -> c)

Y r => Y (P r)

Methods

y :: P r h ((a -> a) -> a)

undefined :: P r h a

List repr => List (P repr)

Methods

nil :: P repr h [a]

cons :: P repr h (a -> [a] -> [a])

listMatch :: P repr h (b -> (a -> [a] -> b) -> [a] -> b)

listAppend :: P repr h ([a] -> [a] -> [a])

Bool r => Bool (P r)

Methods

bool :: Bool -> P r h Bool

ite :: P r h (a -> a -> Bool -> a)

Double r => Double (P r)

Methods

double :: Double -> P r h Double

doubleZero :: P r h Double

doubleOne :: P r h Double

doublePlus :: P r h (Double -> Double -> Double)

doubleMinus :: P r h (Double -> Double -> Double)

doubleMult :: P r h (Double -> Double -> Double)

doubleDivide :: P r h (Double -> Double -> Double)

doubleExp :: P r h (Double -> Double)

doubleEq :: P r h (Double -> Double -> Bool)

isOpen :: P t2 t1 t -> Bool

type family K (repr :: * -> * -> *) h a

Instances

type K repr h Double

type K repr h Double = Double

type K repr h Bool

type K repr h Bool = Bool

type K repr h [a]

type K repr h [a] = Maybe (P repr h a, P repr h [a])

type K repr h (Either a b)

type K repr h (Either a b) = Either (P repr h a) (P repr h b)

type K repr h (a, b)

type K repr h (a, b) = (P repr h a, P repr h b)

type K repr h (a -> b)

type K repr h (a -> b) = Fun repr h a b

mkFun :: DBI repr => (forall hout. EnvT repr (a, h) hout -> P repr hout b) -> P repr h (a -> b)

data EnvT repr hin hout where

Constructors

Dyn :: EnvT repr hin hin

Arg :: P repr hout a -> EnvT repr (a, hout) hout

Weak :: EnvT repr h (a, h)

Next :: EnvT repr hin hout -> EnvT repr (a, hin) (a, hout)

dynamic :: DBI repr => P repr h a -> repr h a

app_open :: DBI repr => P repr hin r -> EnvT repr hin hout -> P repr hout r

newtype Fun repr h a b

Constructors

Fun

Fields

• runFun :: forall hout. EnvT repr (a, h) hout -> P repr hout b

pe :: DBI repr => P repr () a -> repr () a