GraphHammer-0.3: GraphHammer Haskell graph analyses framework inspired by STINGER.

Safe Haskell	Safe-Inferred

GraphHammer.HList

Description

Homebrew HList.

Documentation

data Nil Source

Instances

HLength Nil
EnabledAnalyses Nil eas

data a :. b Source

Instances

EnabledAnalysis a as => EnabledAnalysis a (:. a' as)
EnabledAnalysis a (:. a as)
HLength as => HLength (:. a as)
(EnabledAnalyses as eas, EnabledAnalysis a eas) => EnabledAnalyses (:. a as) eas

hHead :: (a :. as) -> aSource

hTail :: (a :. as) -> asSource

data FALSE Source

Instances

TyEq FALSE x y
TyOr TRUE FALSE TRUE
TyOr FALSE TRUE TRUE
TyOr FALSE FALSE FALSE

data TRUE Source

Instances

TyOr TRUE TRUE TRUE
TyOr TRUE FALSE TRUE
TyOr FALSE TRUE TRUE

class FAIL a Source

class TyCast a b | a -> b, b -> aSource

Instances

class TyOr x y r | x y -> rSource

Instances

TyOr TRUE TRUE TRUE
TyOr TRUE FALSE TRUE
TyOr FALSE TRUE TRUE
TyOr FALSE FALSE FALSE

class TyEq b x y | x y -> bSource

Instances

TyCast TRUE b => TyEq b x x
TyEq FALSE x y

Instances

data S n Source

Instances

Nat n => Nat (S n)

class Nat a whereSource

Methods

natural :: a -> Int Source

Instances

Nat Z
Nat n => Nat (S n)

fromSucc :: S n -> nSource

class HLength a whereSource

Methods

hLength :: a -> Int Source

Instances

HLength Nil
HLength as => HLength (:. a as)