DeepDarkFantasy-0.2017.8.4: A DSL for creating neural network.

Safe HaskellSafe
LanguageHaskell2010

DDF.Show

Documentation

data AST Source #

Constructors

Leaf String 
App String AST [AST] 
Lam String [String] AST 

Instances

Show AST Source # 

Methods

showsPrec :: Int -> AST -> ShowS #

show :: AST -> String #

showList :: [AST] -> ShowS #

newtype Show h a Source #

Constructors

Show 

Fields

Instances

DBI Show Source # 

Methods

z :: Show (a, h) a Source #

s :: Show h b -> Show (a, h) b Source #

abs :: Show (a, h) b -> Show h (a -> b) Source #

app :: Show h (a -> b) -> Show h a -> Show h b Source #

hoas :: (Show (a, h) a -> Show (a, h) b) -> Show h (a -> b) Source #

com :: Show h ((b -> c) -> (a -> b) -> a -> c) Source #

flip :: Show h ((a -> b -> c) -> b -> a -> c) Source #

id :: Show h (a -> a) Source #

const :: Show h (a -> b -> a) Source #

scomb :: Show h ((a -> b -> c) -> (a -> b) -> a -> c) Source #

dup :: Show h ((a -> a -> b) -> a -> b) Source #

let_ :: Show h (a -> (a -> b) -> b) Source #

Fix Show Source # 

Methods

fix :: Show h (f (Fix f) -> Fix f) Source #

runFix :: Show h (Fix f -> f (Fix f)) Source #

Float Show Source # 
FreeVector Show Source # 

Methods

freeVector :: Show h ((b -> d) -> FreeVector b d) Source #

runFreeVector :: Show h (FreeVector b d -> b -> d) Source #

Option Show Source # 

Methods

nothing :: Show h (Maybe a) Source #

just :: Show h (a -> Maybe a) Source #

optionMatch :: Show h (b -> (a -> b) -> Maybe a -> b) Source #

Prod Show Source # 

Methods

mkProd :: Show h (a -> b -> (a, b)) Source #

zro :: Show h ((a, b) -> a) Source #

fst :: Show h ((a, b) -> b) Source #

swap :: Show h ((x, y) -> (y, x)) Source #

curry :: Show h (((a, b) -> c) -> a -> b -> c) Source #

uncurry :: Show h ((a -> b -> c) -> (a, b) -> c) Source #

Dual Show Source # 

Methods

dual :: Show h ((x, y) -> Dual x y) Source #

runDual :: Show h (Dual x y -> (x, y)) Source #

mkDual :: Show h (x -> y -> Dual x y) Source #

dualOrig :: Show h (Dual x y -> x) Source #

dualDiff :: Show h (Dual x y -> y) Source #

Sum Show Source # 

Methods

left :: Show h (a -> Either a b) Source #

right :: Show h (b -> Either a b) Source #

sumMatch :: Show h ((a -> c) -> (b -> c) -> Either a b -> c) Source #

Unit Show Source # 

Methods

unit :: Show h () Source #

Y Show Source # 

Methods

y :: Show h ((a -> a) -> a) Source #

undefined :: Show h a Source #

List Show Source # 

Methods

nil :: Show h [a] Source #

cons :: Show h (a -> [a] -> [a]) Source #

listMatch :: Show h (b -> (a -> [a] -> b) -> [a] -> b) Source #

listAppend :: Show h ([a] -> [a] -> [a]) Source #

Char Show Source # 

Methods

char :: Char -> Show h Char Source #

IO Show Source # 

Methods

putStrLn :: Show h (String -> IO ()) Source #

Bool Show Source # 

Methods

bool :: Bool -> Show h Bool Source #

ite :: Show h (a -> a -> Bool -> a) Source #

Double Show Source # 
Map Show Source # 

Methods

empty :: Show h (Map k a) Source #

singleton :: Show h (k -> a -> Map k a) Source #

lookup :: Ord k => Show h (Map k a -> k -> Maybe a) Source #

alter :: Ord k => Show h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #

mapMap :: Show h ((a -> b) -> Map k a -> Map k b) Source #

unionWith :: Ord k => Show h ((a -> a -> a) -> Map k a -> Map k a -> Map k a) Source #

insert :: Ord k => Show h (k -> a -> Map k a -> Map k a) Source #

DiffWrapper Show Source # 
VectorTF Show Source # 

Methods

zero :: Show h (VectorTF t f) Source #

basis :: Show h (t -> VectorTF t f) Source #

plus :: Show h (f -> f -> VectorTF t f) Source #

mult :: Show h (Double -> f -> VectorTF t f) Source #

vtfMatch :: Show h (a -> (t -> a) -> (f -> f -> a) -> (Double -> f -> a) -> VectorTF t f -> a) Source #

Int Show Source # 

Methods

int :: Int -> Show h Int Source #

pred :: Show h (Int -> Int) Source #

isZero :: Show h (Int -> Bool) Source #

Bimap Show Source # 

Methods

size :: Show h (Bimap a b -> Int) Source #

lookupL :: (Ord a, Ord b) => Show h (Bimap a b -> a -> Maybe b) Source #

lookupR :: (Ord a, Ord b) => Show h (Bimap a b -> b -> Maybe a) Source #

empty :: Show h (Bimap a b) Source #

singleton :: Show h ((a, b) -> Bimap a b) Source #

toMapL :: Show h (Bimap a b -> Map a b) Source #

toMapR :: Show h (Bimap a b -> Map b a) Source #

insert :: (Ord a, Ord b) => Show h ((a, b) -> Bimap a b -> Bimap a b) Source #

updateL :: (Ord a, Ord b) => Show h ((b -> Maybe b) -> a -> Bimap a b -> Bimap a b) Source #

updateR :: (Ord a, Ord b) => Show h ((a -> Maybe a) -> b -> Bimap a b -> Bimap a b) Source #

Lang Show Source # 

Methods

exfalso :: Show h (Void -> a) Source #

writer :: Show h ((a, w) -> Writer w a) Source #

runWriter :: Show h (Writer w a -> (a, w)) Source #

float2Double :: Show h (Float -> Double) Source #

double2Float :: Show h (Double -> Float) Source #

state :: Show h ((x -> (y, x)) -> State x y) Source #

runState :: Show h (State x y -> x -> (y, x)) Source #

iterate :: Show h ((x -> x) -> x -> [x]) Source #

buildFreeVector :: Ord b => Show h (FreeVectorBuilder b -> FreeVector b Double) Source #

toSVTFBuilder :: Ord b => Show h (VectorTF b Int -> SVTFBuilder b) Source #

get :: Show h (Maybe a -> a) Source #

getVar :: Show h (State x x) Source #

update :: Show h ((x -> x) -> State x ()) Source #

updateWengert :: Show h (Int -> Double -> Map Int Double -> Map Int Double) Source #

vtfCata :: Show h ((VectorTF a b -> b) -> Fix (VectorTF a) -> b) Source #

Monad Show x Source # 

Methods

bind :: Show h (x a -> (a -> x b) -> x b) Source #

join :: Show h (x (x a) -> x a) Source #

Applicative Show x Source # 

Methods

pure :: Show h (x -> x x) Source #

ap :: Show h (x (x -> y) -> x x -> x y) Source #

Functor Show x Source # 

Methods

map :: Show h ((a -> b) -> x a -> x b) Source #

name :: String -> Show h a Source #