ADP.Fusion.SynVar.Recursive.Type

Documentation

data IRec c i x where

A syntactic variable that does not memoize but simplify recurses. One needs to be somewhat careful when using this one. ITbl performs memoization to perform DP in polynomial time (roughly speaking). If the rules for an IRec are of a particular type, they will exponential running time. Things like X -> X X are, for example, rather bad. Rules of the type X -> Y, Y -> Z are ok, if Y is an IRec since we just continue on. The same holds for Y -> a Y. Basically, things are safe if there is only a (small) constant number of parses of an IRec synvar.

Constructors

IRec :: {..} -> IRec c i x

Fields

• iRecConstraint :: !c
• iRecFrom :: !i
• iRecTo :: !i

Instances

MutateCell CFG ts im i => MutateCell CFG ((:.) ts (TwIRec im c i x)) im i

Methods

mutateCell :: (Monad om, PrimMonad om) => Proxy * CFG -> Int -> Int -> (forall a. im a -> om a) -> (ts :. TwIRec im c i x) -> i -> i -> om ()

(Applicative mB, Monad mB, Element ls ((:.) is i), TableStaticVar ((:.) us u) ((:.) cs c) ((:.) is i), AddIndexDense (Elm ls ((:.) is i)) ((:.) us u) ((:.) cs c) ((:.) is i), MkStream mB ls ((:.) is i)) => MkStream mB ((:!:) ls (TwIRecBt ((:.) cs c) ((:.) us u) x mF mB r)) ((:.) is i)

Methods

mkStream :: (ls :!: TwIRecBt (cs :. c) (us :. u) x mF mB r) -> Context (is :. i) -> (is :. i) -> (is :. i) -> Stream mB (Elm (ls :!: TwIRecBt (cs :. c) (us :. u) x mF mB r) (is :. i))

(Functor m, Monad m, Element ls ((:.) is i), TableStaticVar ((:.) us u) ((:.) cs c) ((:.) is i), AddIndexDense (Elm ls ((:.) is i)) ((:.) us u) ((:.) cs c) ((:.) is i), MkStream m ls ((:.) is i)) => MkStream m ((:!:) ls (TwIRec m ((:.) cs c) ((:.) us u) x)) ((:.) is i)

Methods

mkStream :: (ls :!: TwIRec m (cs :. c) (us :. u) x) -> Context (is :. i) -> (is :. i) -> (is :. i) -> Stream m (Elm (ls :!: TwIRec m (cs :. c) (us :. u) x) (is :. i))

(Monad mB, IndexStream i, (~) * i j, (~) (* -> *) m mB) => Axiom (TW (Backtrack (TwIRec mF c i x) mF mB) (j -> j -> m [r]))

Associated Types

type AxiomStream (TW (Backtrack (TwIRec mF c i x) mF mB) (j -> j -> m [r])) :: *

Methods

axiom :: TW (Backtrack (TwIRec mF c i x) mF mB) (j -> j -> m [r]) -> AxiomStream (TW (Backtrack (TwIRec mF c i x) mF mB) (j -> j -> m [r]))

TSBO ts => TSBO ((:.) ts (TwIRec Id c i x))

Methods

asDyn :: (ts :. TwIRec Id c i x) -> [Q]

fillWithDyn :: (Monad m, PrimMonad m) => [Q] -> (ts :. TwIRec Id c i x) -> m [Q]

TableOrder ts => TableOrder ((:.) ts (TwIRec im c i x))

IRecs do not need an order, given that they do not memoize.

Methods

tableLittleOrder :: (ts :. TwIRec im c i x) -> [Int]

tableBigOrder :: (ts :. TwIRec im c i x) -> [Int]

Element ls i => Element ((:!:) ls (TwIRecBt c u x mF mB r)) i

Associated Types

data Elm ((:!:) ls (TwIRecBt c u x mF mB r)) i :: *

type RecElm ((:!:) ls (TwIRecBt c u x mF mB r)) i :: *

type Arg ((:!:) ls (TwIRecBt c u x mF mB r)) :: *

Methods

getArg :: Elm (ls :!: TwIRecBt c u x mF mB r) i -> Arg (ls :!: TwIRecBt c u x mF mB r)

getIdx :: Elm (ls :!: TwIRecBt c u x mF mB r) i -> RunningIndex i

getElm :: Elm (ls :!: TwIRecBt c u x mF mB r) i -> RecElm (ls :!: TwIRecBt c u x mF mB r) i

Element ls i => Element ((:!:) ls (TwIRec m c u x)) i

Associated Types

data Elm ((:!:) ls (TwIRec m c u x)) i :: *

type RecElm ((:!:) ls (TwIRec m c u x)) i :: *

type Arg ((:!:) ls (TwIRec m c u x)) :: *

Methods

getArg :: Elm (ls :!: TwIRec m c u x) i -> Arg (ls :!: TwIRec m c u x)

getIdx :: Elm (ls :!: TwIRec m c u x) i -> RunningIndex i

getElm :: Elm (ls :!: TwIRec m c u x) i -> RecElm (ls :!: TwIRec m c u x) i

(Monad m, IndexStream i) => Axiom (TwIRec m c i x)

Associated Types

type AxiomStream (TwIRec m c i x) :: *

Methods

axiom :: TwIRec m c i x -> AxiomStream (TwIRec m c i x)

Build (TwIRec m c i x)

Associated Types

type Stack (TwIRec m c i x) :: *

Methods

build :: TwIRec m c i x -> Stack (TwIRec m c i x)

GenBacktrackTable (TwIRec mF c i x) mF mB

Associated Types

data Backtrack (TwIRec mF c i x) (mF :: * -> *) (mB :: * -> *) :: *

type BacktrackIndex (TwIRec mF c i x) :: *

Methods

toBacktrack :: TwIRec mF c i x -> (forall a. mF a -> mB a) -> Backtrack (TwIRec mF c i x) mF mB

Build (TwIRecBt c i x mF mB r)

Associated Types

type Stack (TwIRecBt c i x mF mB r) :: *

Methods

build :: TwIRecBt c i x mF mB r -> Stack (TwIRecBt c i x mF mB r)

type AxiomStream (TW (Backtrack (TwIRec mF c i x) mF mB) (j -> j -> m [r]))

type AxiomStream (TW (Backtrack (TwIRec mF c i x) mF mB) (j -> j -> m [r])) = mB [r]

data Elm ((:!:) ls (TwIRecBt c u x mF mB r))

data Elm ((:!:) ls (TwIRecBt c u x mF mB r)) = ElmBtIRec !x [r] !(RunningIndex i) !(Elm ls i)

data Elm ((:!:) ls (TwIRec m c u x))

data Elm ((:!:) ls (TwIRec m c u x)) = ElmIRec !x !(RunningIndex i) !(Elm ls i)

type Arg ((:!:) ls (TwIRecBt c u x mF mB r))

type Arg ((:!:) ls (TwIRecBt c u x mF mB r)) = (:.) (Arg ls) (x, [r])

type Arg ((:!:) ls (TwIRec m c u x))

type Arg ((:!:) ls (TwIRec m c u x)) = (:.) (Arg ls) x

type BacktrackIndex (TwIRec mF c i x)

type BacktrackIndex (TwIRec mF c i x) = i

type AxiomStream (TwIRec m c i x)

type AxiomStream (TwIRec m c i x) = m x

type Stack (TwIRec m c i x)

type Stack (TwIRec m c i x) = (:!:) S (TwIRec m c i x)

type TermArg (TwIRec m c i x)

type TermArg (TwIRec m c i x) = x

data Backtrack (TwIRec mF c i x) mF

data Backtrack (TwIRec mF c i x) mF = BtIRec !c !i !i !(i -> i -> mB x)

type Stack (TwIRecBt c i x mF mB r)

type Stack (TwIRecBt c i x mF mB r) = (:!:) S (TwIRecBt c i x mF mB r)

type TwIRec m c i x = TW (IRec c i x) (i -> i -> m x)

type TwIRecBt c i x mF mB r = TW (Backtrack (TwIRec mF c i x) mF mB) (i -> i -> mB [r])