Safe Haskell	None
Language	Haskell2010

ShortestPath.SHP.Grammar.EdgeProb

Documentation

data SigEdgeProb m s r t_k_0_ t_s_0_ Source #

Constructors

SigEdgeProb
Fields edge :: (s -> t_k_0_ -> s) fini :: (s -> t_k_0_ -> s -> s) mpty :: (() -> s) node :: (t_s_0_ -> s) h :: (Stream m s -> m r)

Instances

(Monad mL0, Monad mR0, Eq xL0, (~) (* -> ) mL0 mR0, (~) xL0 rL0) => ProductBacktracking (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) Source #
Associated Types type SigBacktracking (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) :: * # Methods (<\|\|) :: SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0 -> SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0 -> SigBacktracking (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) #
(Monad mL0, Monad mR0, Eq xL0, Ord xL0, Ord xR0, (~) (* -> *) mL0 mR0) => ProductCombining (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) Source #
Associated Types type SigCombining (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) :: * # Methods (**>) :: SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0 -> SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0 -> SigCombining (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) #
type SigBacktracking (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) Source #
type SigBacktracking (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) = SigEdgeProb mR0 (xL0, [xR0]) rR0 t_k_0_0 t_s_0_0
type SigCombining (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) Source #
type SigCombining (SigEdgeProb mL0 xL0 rL0 t_k_0_0 t_s_0_0) (SigEdgeProb mR0 xR0 rR0 t_k_0_0 t_s_0_0) = SigEdgeProb mR0 (xL0, [xR0]) (Vector (rL0, rR0)) t_k_0_0 t_s_0_0

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