Safe Haskell	None
Language	Haskell2010

DP.Tree.Edit.Global.Linear2

Description

Simple, linear tree editing grammar.

Documentation

data SigGlobal m s r t_x_0_ t_x_1_ Source #

Constructors

SigGlobal
Fields align :: (s -> (:.) ((:.) Z t_x_0_) t_x_1_ -> s) delin :: (s -> (:.) ((:.) Z t_x_0_) () -> s) done :: ((:.) ((:.) Z ()) () -> s) indel :: (s -> (:.) ((:.) Z ()) t_x_1_ -> s) iter :: (s -> s -> s) h :: (Stream m s -> m r)

Instances

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

gGlobal :: ((~#) * * (Fun ((:.) (Arg (Stack (TW t1 (i1 -> i1 -> t6 t4)))) ((:.) ((:.) Z (TermArg b1)) (TermArg b)) -> t5)) (t5 -> (:.) ((:.) Z t3) t2 -> t5), (~#) * * (Fun (Arg ((:!:) (Stack (TW t1 (i1 -> i1 -> t6 t4))) (TW t (i -> i -> t6 t4))) -> t5)) (t5 -> t5 -> t5), (~#) * * (Fun ((:.) (Arg (Stack (TW t1 (i1 -> i1 -> t6 t4)))) ((:.) ((:.) Z ()) (TermArg b)) -> t5)) (t5 -> (:.) ((:.) Z ()) t2 -> t5), (~#) * * (Fun ((:.) (Arg (Stack (TW t1 (i1 -> i1 -> t6 t4)))) ((:.) ((:.) Z (TermArg b1)) ()) -> t5)) (t5 -> (:.) ((:.) Z t3) () -> t5), Apply ((:.) (Arg (Stack (TW t1 (i1 -> i1 -> t6 t4)))) ((:.) ((:.) Z ()) (TermArg b)) -> t5), Apply ((:.) (Arg (Stack (TW t1 (i1 -> i1 -> t6 t4)))) ((:.) ((:.) Z (TermArg b1)) ()) -> t5), Apply ((:.) (Arg (Stack (TW t1 (i1 -> i1 -> t6 t4)))) ((:.) ((:.) Z (TermArg b1)) (TermArg b)) -> t5), Apply (Arg ((:!:) (Stack (TW t1 (i1 -> i1 -> t6 t4))) (TW t (i -> i -> t6 t4))) -> t5), TermStream t6 (TermSymbol (TermSymbol M Deletion) b) (Elm (Stack (TW t1 (i1 -> i1 -> t6 t4))) i1) i1, TermStream t6 (TermSymbol (TermSymbol M Epsilon) Epsilon) (Elm S i1) i1, TermStream t6 (TermSymbol (TermSymbol M b1) Deletion) (Elm (Stack (TW t1 (i1 -> i1 -> t6 t4))) i1) i1, TermStream t6 (TermSymbol (TermSymbol M b1) b) (Elm (Stack (TW t1 (i1 -> i1 -> t6 t4))) i) i, TermStaticVar (TermSymbol (TermSymbol M Deletion) b) i1, TermStaticVar (TermSymbol (TermSymbol M Epsilon) Epsilon) i1, TermStaticVar (TermSymbol (TermSymbol M b1) Deletion) i1, TermStaticVar (TermSymbol (TermSymbol M b1) b) i, Element ((:!:) (Stack (TW t1 (i1 -> i1 -> t6 t4))) (TW t (i -> i -> t6 t4))) i1, Element (Stack (TW t1 (i1 -> i1 -> t6 t4))) i, Element (Stack (TW t1 (i1 -> i1 -> t6 t4))) i1, MkStream t6 S i1, MkStream t6 ((:!:) (Stack (TW t1 (i1 -> i1 -> t6 t4))) (TW t (i -> i -> t6 t4))) i1, MkStream t6 (Stack (TW t1 (i1 -> i1 -> t6 t4))) i, MkStream t6 (Stack (TW t1 (i1 -> i1 -> t6 t4))) i1, RuleContext i, RuleContext i1, Build (TW t1 (i1 -> i1 -> t6 t4))) => SigGlobal t6 t5 t4 t3 t2 -> t1 -> t -> b1 -> b -> (:.) ((:.) Z (TW t1 (i1 -> i1 -> t6 t4))) (TW t (i -> i -> t6 t4)) Source #