DeepDarkFantasy-0.2017.8.8: A DSL for creating neural network.

Safe HaskellSafe
LanguageHaskell2010

DDF.List

Documentation

class Y r => List r where Source #

Minimal complete definition

nil, cons, listMatch

Methods

nil :: r h [a] Source #

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

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

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

Instances

List Eval Source # 

Methods

nil :: Eval h [a] Source #

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

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

listAppend :: Eval h ([a] -> [a] -> [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 #

List Size Source # 

Methods

nil :: Size h [a] Source #

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

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

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

List UInt Source # 

Methods

nil :: UInt h [a] Source #

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

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

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

SubL c List => List (Term c) Source # 

Methods

nil :: Term c h [a] Source #

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

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

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

List r => List (UnHOAS r) Source # 

Methods

nil :: UnHOAS r h [a] Source #

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

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

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

(Unit r, Prod r, List r) => List (UnLiftEnv r) Source # 

Methods

nil :: UnLiftEnv r h [a] Source #

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

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

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

(Prod r, List r) => List (ImpW r) Source # 

Methods

nil :: ImpW r h [a] Source #

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

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

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

type SubLC c List Source # 
type SubLC c List = SubL c Y

cons2 :: List r => r h a1 -> r h [a1] -> r h [a1] Source #

listMatch2 :: List r => r h a1 -> r h (a -> [a] -> a1) -> r h ([a] -> a1) Source #

module DDF.Y