Safe Haskell	Safe
Language	Haskell2010

DDF.List

Documentation

class Y r => List r where Source #

Minimal complete definition

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 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 #
(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 #

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