ShortestPathProblems-0.0.0.1: grammars for TSP and SHP

Safe HaskellNone
LanguageHaskell2010

ShortestPath.SHP.Grammar.MinDist

Documentation

data SigMinDist m s r t_k_0_ t_s_0_ Source #

Constructors

SigMinDist 

Fields

Instances

(Monad mL0, Monad mR0, Eq xL0, (~) (* -> *) mL0 mR0, (~) * xL0 rL0) => ProductBacktracking (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) Source # 

Associated Types

type SigBacktracking (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) :: * #

Methods

(<||) :: SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0 -> SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0 -> SigBacktracking (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) #

(Monad mL0, Monad mR0, Eq xL0, Ord xL0, Ord xR0, (~) (* -> *) mL0 mR0) => ProductCombining (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) Source # 

Associated Types

type SigCombining (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) :: * #

Methods

(**>) :: SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0 -> SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0 -> SigCombining (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) #

type SigBacktracking (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) Source # 
type SigBacktracking (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) = SigMinDist mR0 (xL0, [xR0]) rR0 t_k_0_0 t_s_0_0
type SigCombining (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) Source # 
type SigCombining (SigMinDist mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigMinDist mR0 xR0 rR0 t_k_0_0 t_s_0_0) = SigMinDist mR0 (xL0, [xR0]) (Vector (rL0, rR0)) t_k_0_0 t_s_0_0

gMinDist :: ((~#) * * (Fun (Arg (Stack (TW t1 (i1 -> i1 -> t6 t4))) -> t5)) (t5 -> t5), (~#) * * (Fun (Arg (Stack x) -> t5)) (t2 -> t5), (~#) * * (Fun (Arg ((:!:) (Stack (TW t1 (i1 -> i1 -> t6 t4))) b) -> t5)) (t5 -> t3 -> t5), Apply (Arg (Stack (TW t1 (i1 -> i1 -> t6 t4))) -> t5), Apply (Arg (Stack x) -> t5), Apply (Arg ((:!:) (Stack (TW t1 (i1 -> i1 -> t6 t4))) b) -> t5), Element ((:!:) (Stack (TW t1 (i1 -> i1 -> t6 t4))) b) i1, Element (Stack (TW t1 (i1 -> i1 -> t6 t4))) i, Element (Stack x) i1, MkStream t6 ((:!:) S Epsilon) i1, MkStream t6 ((:!:) (Stack (TW t1 (i1 -> i1 -> t6 t4))) b) i1, MkStream t6 (Stack (TW t1 (i1 -> i1 -> t6 t4))) i, MkStream t6 (Stack x) i1, RuleContext i, RuleContext i1, Build (TW t1 (i1 -> i1 -> t6 t4)), Build x) => SigMinDist t6 t5 t4 t3 t2 -> t1 -> t -> b -> x -> (:.) ((:.) Z (TW t1 (i1 -> i1 -> t6 t4))) (TW t (i -> i -> t6 t4)) Source #