Safe Haskell	None
Language	Haskell2010

ADP.Fusion.Term.EdgeWithSet.Type

Description

TODO merge with Edge and handle via phantom typing?

Synopsis

Documentation

An edge in a graph. As a parsing symbol, it will provide (From:.To) pairs.

Constructors

Instances

Build EdgeWithSet Source #
Associated Types type Stack EdgeWithSet :: * # Methods build :: EdgeWithSet -> Stack EdgeWithSet #
(Show i, Show (RunningIndex i), Show (Elm ls i)) => Show (Elm ((:!:) ls EdgeWithSet) i) Source #
Methods showsPrec :: Int -> Elm (ls :!: EdgeWithSet) i -> ShowS # show :: Elm (ls :!: EdgeWithSet) i -> String # showList :: [Elm (ls :!: EdgeWithSet) i] -> ShowS #
Element ls i => Element ((:!:) ls EdgeWithSet) i Source #
Associated Types data Elm ((:!:) ls EdgeWithSet) i :: * # type RecElm ((:!:) ls EdgeWithSet) i :: * # type Arg ((:!:) ls EdgeWithSet) :: * # Methods getArg :: Elm (ls :!: EdgeWithSet) i -> Arg (ls :!: EdgeWithSet) # getIdx :: Elm (ls :!: EdgeWithSet) i -> RunningIndex i # getElm :: Elm (ls :!: EdgeWithSet) i -> RecElm (ls :!: EdgeWithSet) i #
type TermArg EdgeWithSet Source #
type TermArg EdgeWithSet = (:.) ((:.) Int From) To
type Stack EdgeWithSet Source #
type Stack EdgeWithSet = (:!:) S EdgeWithSet
type Arg ((:!:) ls EdgeWithSet) Source #
type Arg ((:!:) ls EdgeWithSet) = (:.) (Arg ls) ((:.) ((:.) Int From) To)
data Elm ((:!:) ls EdgeWithSet) Source #
data Elm ((:!:) ls EdgeWithSet) = ElmEdgeWithSet !((:.) ((:.) Int From) To) !(RunningIndex i) (Elm ls i)