Language.CSPM.AST

This module defines an Abstract Syntax Tree for CSPM. This is the AST that is computed by the parser. For historical reasons, it is rather unstructured.

Documentation

type AstAnnotation x = IntMap x

type Bindings = Map String UniqueIdent

type FreeNames = IntMap UniqueIdent

newtype NodeId

Constructors

NodeId

Fields

• unNodeId :: Int

Instances

Enum NodeId

Methods

succ :: NodeId -> NodeId

pred :: NodeId -> NodeId

toEnum :: Int -> NodeId

fromEnum :: NodeId -> Int

enumFrom :: NodeId -> [NodeId]

enumFromThen :: NodeId -> NodeId -> [NodeId]

enumFromTo :: NodeId -> NodeId -> [NodeId]

enumFromThenTo :: NodeId -> NodeId -> NodeId -> [NodeId]

Eq NodeId

Methods

(==) :: NodeId -> NodeId -> Bool

(/=) :: NodeId -> NodeId -> Bool

Data NodeId

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NodeId -> c NodeId

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NodeId

toConstr :: NodeId -> Constr

dataTypeOf :: NodeId -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c NodeId)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NodeId)

gmapT :: (forall b. Data b => b -> b) -> NodeId -> NodeId

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NodeId -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NodeId -> r

gmapQ :: (forall d. Data d => d -> u) -> NodeId -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NodeId -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NodeId -> m NodeId

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeId -> m NodeId

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NodeId -> m NodeId

Ord NodeId

Methods

compare :: NodeId -> NodeId -> Ordering

(<) :: NodeId -> NodeId -> Bool

(<=) :: NodeId -> NodeId -> Bool

(>) :: NodeId -> NodeId -> Bool

(>=) :: NodeId -> NodeId -> Bool

max :: NodeId -> NodeId -> NodeId

min :: NodeId -> NodeId -> NodeId

Show NodeId

Methods

showsPrec :: Int -> NodeId -> ShowS

show :: NodeId -> String

showList :: [NodeId] -> ShowS

Ix NodeId

Methods

range :: (NodeId, NodeId) -> [NodeId]

index :: (NodeId, NodeId) -> NodeId -> Int

unsafeIndex :: (NodeId, NodeId) -> NodeId -> Int

inRange :: (NodeId, NodeId) -> NodeId -> Bool

rangeSize :: (NodeId, NodeId) -> Int

unsafeRangeSize :: (NodeId, NodeId) -> Int

Generic NodeId

Associated Types

type Rep NodeId :: * -> *

Methods

from :: NodeId -> Rep NodeId x

to :: Rep NodeId x -> NodeId

type Rep NodeId

type Rep NodeId = D1 (MetaData "NodeId" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" True) (C1 (MetaCons "NodeId" PrefixI True) (S1 (MetaSel (Just Symbol "unNodeId") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)))

mkNodeId :: Int -> NodeId

data Labeled t

Constructors

Labeled

Fields

• nodeId :: NodeId
• srcLoc :: SrcLoc
• unLabel :: t

Instances

Eq t => Eq (Labeled t)

Methods

(==) :: Labeled t -> Labeled t -> Bool

(/=) :: Labeled t -> Labeled t -> Bool

Data t => Data (Labeled t)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Labeled t -> c (Labeled t)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Labeled t)

toConstr :: Labeled t -> Constr

dataTypeOf :: Labeled t -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Labeled t))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Labeled t))

gmapT :: (forall b. Data b => b -> b) -> Labeled t -> Labeled t

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Labeled t -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Labeled t -> r

gmapQ :: (forall d. Data d => d -> u) -> Labeled t -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Labeled t -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Labeled t -> m (Labeled t)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Labeled t -> m (Labeled t)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Labeled t -> m (Labeled t)

Ord t => Ord (Labeled t)

Methods

compare :: Labeled t -> Labeled t -> Ordering

(<) :: Labeled t -> Labeled t -> Bool

(<=) :: Labeled t -> Labeled t -> Bool

(>) :: Labeled t -> Labeled t -> Bool

(>=) :: Labeled t -> Labeled t -> Bool

max :: Labeled t -> Labeled t -> Labeled t

min :: Labeled t -> Labeled t -> Labeled t

Show t => Show (Labeled t)

Methods

showsPrec :: Int -> Labeled t -> ShowS

show :: Labeled t -> String

showList :: [Labeled t] -> ShowS

Generic (Labeled t)

Associated Types

type Rep (Labeled t) :: * -> *

Methods

from :: Labeled t -> Rep (Labeled t) x

to :: Rep (Labeled t) x -> Labeled t

type Rep (Labeled t)

type Rep (Labeled t) = D1 (MetaData "Labeled" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) (C1 (MetaCons "Labeled" PrefixI True) ((:*:) (S1 (MetaSel (Just Symbol "nodeId") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 NodeId)) ((:*:) (S1 (MetaSel (Just Symbol "srcLoc") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 SrcLoc)) (S1 (MetaSel (Just Symbol "unLabel") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 t)))))

labeled :: t -> Labeled t

Wrap a node with a dummyLabel. todo: Redo we need a specal case in DataConstructor Labeled.

setNode :: Labeled t -> y -> Labeled y

type LIdent = Labeled Ident

data Ident

Constructors

Ident

Fields

• unIdent :: String

UIdent UniqueIdent

Instances

Eq Ident

Methods

(==) :: Ident -> Ident -> Bool

(/=) :: Ident -> Ident -> Bool

Data Ident

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Ident -> c Ident

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Ident

toConstr :: Ident -> Constr

dataTypeOf :: Ident -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Ident)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Ident)

gmapT :: (forall b. Data b => b -> b) -> Ident -> Ident

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ident -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ident -> r

gmapQ :: (forall d. Data d => d -> u) -> Ident -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Ident -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ident -> m Ident

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ident -> m Ident

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ident -> m Ident

Ord Ident

Methods

compare :: Ident -> Ident -> Ordering

(<) :: Ident -> Ident -> Bool

(<=) :: Ident -> Ident -> Bool

(>) :: Ident -> Ident -> Bool

(>=) :: Ident -> Ident -> Bool

max :: Ident -> Ident -> Ident

min :: Ident -> Ident -> Ident

Show Ident

Methods

showsPrec :: Int -> Ident -> ShowS

show :: Ident -> String

showList :: [Ident] -> ShowS

Generic Ident

Associated Types

type Rep Ident :: * -> *

Methods

from :: Ident -> Rep Ident x

to :: Rep Ident x -> Ident

type Rep Ident

type Rep Ident = D1 (MetaData "Ident" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "Ident" PrefixI True) (S1 (MetaSel (Just Symbol "unIdent") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 String))) (C1 (MetaCons "UIdent" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 UniqueIdent))))

unUIdent :: Ident -> UniqueIdent

identId :: LIdent -> Int

data UniqueIdent

Constructors

UniqueIdent

Fields

• uniqueIdentId :: Int
• bindingSide :: NodeId
• bindingLoc :: SrcLoc
• idType :: IDType
• realName :: String
• newName :: String
• prologMode :: PrologMode
• bindType :: BindType

Instances

Eq UniqueIdent

Methods

(==) :: UniqueIdent -> UniqueIdent -> Bool

(/=) :: UniqueIdent -> UniqueIdent -> Bool

Data UniqueIdent

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UniqueIdent -> c UniqueIdent

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UniqueIdent

toConstr :: UniqueIdent -> Constr

dataTypeOf :: UniqueIdent -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c UniqueIdent)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UniqueIdent)

gmapT :: (forall b. Data b => b -> b) -> UniqueIdent -> UniqueIdent

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UniqueIdent -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UniqueIdent -> r

gmapQ :: (forall d. Data d => d -> u) -> UniqueIdent -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> UniqueIdent -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> UniqueIdent -> m UniqueIdent

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqueIdent -> m UniqueIdent

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqueIdent -> m UniqueIdent

Ord UniqueIdent

Methods

compare :: UniqueIdent -> UniqueIdent -> Ordering

(<) :: UniqueIdent -> UniqueIdent -> Bool

(<=) :: UniqueIdent -> UniqueIdent -> Bool

(>) :: UniqueIdent -> UniqueIdent -> Bool

(>=) :: UniqueIdent -> UniqueIdent -> Bool

max :: UniqueIdent -> UniqueIdent -> UniqueIdent

min :: UniqueIdent -> UniqueIdent -> UniqueIdent

Show UniqueIdent

Methods

showsPrec :: Int -> UniqueIdent -> ShowS

show :: UniqueIdent -> String

showList :: [UniqueIdent] -> ShowS

Generic UniqueIdent

Associated Types

type Rep UniqueIdent :: * -> *

Methods

from :: UniqueIdent -> Rep UniqueIdent x

to :: Rep UniqueIdent x -> UniqueIdent

type Rep UniqueIdent

type Rep UniqueIdent = D1 (MetaData "UniqueIdent" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) (C1 (MetaCons "UniqueIdent" PrefixI True) ((:*:) ((:*:) ((:*:) (S1 (MetaSel (Just Symbol "uniqueIdentId") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Just Symbol "bindingSide") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 NodeId))) ((:*:) (S1 (MetaSel (Just Symbol "bindingLoc") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 SrcLoc)) (S1 (MetaSel (Just Symbol "idType") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 IDType)))) ((:*:) ((:*:) (S1 (MetaSel (Just Symbol "realName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 String)) (S1 (MetaSel (Just Symbol "newName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 String))) ((:*:) (S1 (MetaSel (Just Symbol "prologMode") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 PrologMode)) (S1 (MetaSel (Just Symbol "bindType") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 BindType))))))

data IDType

Constructors

VarID

ChannelID

NameTypeID

FunID

ConstrID

DataTypeID

TransparentID

BuiltInID

Instances

Eq IDType

Methods

(==) :: IDType -> IDType -> Bool

(/=) :: IDType -> IDType -> Bool

Data IDType

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IDType -> c IDType

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IDType

toConstr :: IDType -> Constr

dataTypeOf :: IDType -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c IDType)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IDType)

gmapT :: (forall b. Data b => b -> b) -> IDType -> IDType

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IDType -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IDType -> r

gmapQ :: (forall d. Data d => d -> u) -> IDType -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IDType -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IDType -> m IDType

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IDType -> m IDType

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IDType -> m IDType

Ord IDType

Methods

compare :: IDType -> IDType -> Ordering

(<) :: IDType -> IDType -> Bool

(<=) :: IDType -> IDType -> Bool

(>) :: IDType -> IDType -> Bool

(>=) :: IDType -> IDType -> Bool

max :: IDType -> IDType -> IDType

min :: IDType -> IDType -> IDType

Show IDType

Methods

showsPrec :: Int -> IDType -> ShowS

show :: IDType -> String

showList :: [IDType] -> ShowS

Generic IDType

Associated Types

type Rep IDType :: * -> *

Methods

from :: IDType -> Rep IDType x

to :: Rep IDType x -> IDType

type Rep IDType

type Rep IDType = D1 (MetaData "IDType" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "VarID" PrefixI False) U1) (C1 (MetaCons "ChannelID" PrefixI False) U1)) ((:+:) (C1 (MetaCons "NameTypeID" PrefixI False) U1) (C1 (MetaCons "FunID" PrefixI False) U1))) ((:+:) ((:+:) (C1 (MetaCons "ConstrID" PrefixI False) U1) (C1 (MetaCons "DataTypeID" PrefixI False) U1)) ((:+:) (C1 (MetaCons "TransparentID" PrefixI False) U1) (C1 (MetaCons "BuiltInID" PrefixI False) U1))))

data PrologMode

Constructors

PrologGround

PrologVariable

Instances

Eq PrologMode

Methods

(==) :: PrologMode -> PrologMode -> Bool

(/=) :: PrologMode -> PrologMode -> Bool

Data PrologMode

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PrologMode -> c PrologMode

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PrologMode

toConstr :: PrologMode -> Constr

dataTypeOf :: PrologMode -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c PrologMode)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PrologMode)

gmapT :: (forall b. Data b => b -> b) -> PrologMode -> PrologMode

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PrologMode -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PrologMode -> r

gmapQ :: (forall d. Data d => d -> u) -> PrologMode -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> PrologMode -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> PrologMode -> m PrologMode

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PrologMode -> m PrologMode

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PrologMode -> m PrologMode

Ord PrologMode

Methods

compare :: PrologMode -> PrologMode -> Ordering

(<) :: PrologMode -> PrologMode -> Bool

(<=) :: PrologMode -> PrologMode -> Bool

(>) :: PrologMode -> PrologMode -> Bool

(>=) :: PrologMode -> PrologMode -> Bool

max :: PrologMode -> PrologMode -> PrologMode

min :: PrologMode -> PrologMode -> PrologMode

Show PrologMode

Methods

showsPrec :: Int -> PrologMode -> ShowS

show :: PrologMode -> String

showList :: [PrologMode] -> ShowS

Generic PrologMode

Associated Types

type Rep PrologMode :: * -> *

Methods

from :: PrologMode -> Rep PrologMode x

to :: Rep PrologMode x -> PrologMode

type Rep PrologMode

type Rep PrologMode = D1 (MetaData "PrologMode" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "PrologGround" PrefixI False) U1) (C1 (MetaCons "PrologVariable" PrefixI False) U1))

data BindType

Constructors

LetBound

NotLetBound

Instances

Eq BindType

Methods

(==) :: BindType -> BindType -> Bool

(/=) :: BindType -> BindType -> Bool

Data BindType

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BindType -> c BindType

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BindType

toConstr :: BindType -> Constr

dataTypeOf :: BindType -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c BindType)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BindType)

gmapT :: (forall b. Data b => b -> b) -> BindType -> BindType

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BindType -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BindType -> r

gmapQ :: (forall d. Data d => d -> u) -> BindType -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> BindType -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> BindType -> m BindType

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BindType -> m BindType

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BindType -> m BindType

Ord BindType

Methods

compare :: BindType -> BindType -> Ordering

(<) :: BindType -> BindType -> Bool

(<=) :: BindType -> BindType -> Bool

(>) :: BindType -> BindType -> Bool

(>=) :: BindType -> BindType -> Bool

max :: BindType -> BindType -> BindType

min :: BindType -> BindType -> BindType

Show BindType

Methods

showsPrec :: Int -> BindType -> ShowS

show :: BindType -> String

showList :: [BindType] -> ShowS

Generic BindType

Associated Types

type Rep BindType :: * -> *

Methods

from :: BindType -> Rep BindType x

to :: Rep BindType x -> BindType

type Rep BindType

type Rep BindType = D1 (MetaData "BindType" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "LetBound" PrefixI False) U1) (C1 (MetaCons "NotLetBound" PrefixI False) U1))

isLetBound :: BindType -> Bool

data Module a

Constructors

Module

Fields

• moduleDecls :: [LDecl]
• moduleTokens :: Maybe [Token]
• moduleSrcLoc :: SrcLoc
• moduleComments :: [LocComment]
• modulePragmas :: [Pragma]

Instances

Eq (Module a)

Methods

(==) :: Module a -> Module a -> Bool

(/=) :: Module a -> Module a -> Bool

Data a => Data (Module a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Module a -> c (Module a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Module a)

toConstr :: Module a -> Constr

dataTypeOf :: Module a -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Module a))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Module a))

gmapT :: (forall b. Data b => b -> b) -> Module a -> Module a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Module a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Module a -> r

gmapQ :: (forall d. Data d => d -> u) -> Module a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Module a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Module a -> m (Module a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Module a -> m (Module a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Module a -> m (Module a)

Ord (Module a)

Methods

compare :: Module a -> Module a -> Ordering

(<) :: Module a -> Module a -> Bool

(<=) :: Module a -> Module a -> Bool

(>) :: Module a -> Module a -> Bool

(>=) :: Module a -> Module a -> Bool

max :: Module a -> Module a -> Module a

min :: Module a -> Module a -> Module a

Show (Module a)

Methods

showsPrec :: Int -> Module a -> ShowS

show :: Module a -> String

showList :: [Module a] -> ShowS

Generic (Module a)

Associated Types

type Rep (Module a) :: * -> *

Methods

from :: Module a -> Rep (Module a) x

to :: Rep (Module a) x -> Module a

type Rep (Module a)

type Rep (Module a) = D1 (MetaData "Module" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) (C1 (MetaCons "Module" PrefixI True) ((:*:) ((:*:) (S1 (MetaSel (Just Symbol "moduleDecls") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LDecl])) (S1 (MetaSel (Just Symbol "moduleTokens") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe [Token])))) ((:*:) (S1 (MetaSel (Just Symbol "moduleSrcLoc") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 SrcLoc)) ((:*:) (S1 (MetaSel (Just Symbol "moduleComments") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LocComment])) (S1 (MetaSel (Just Symbol "modulePragmas") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Pragma]))))))

data FromParser

Instances

Eq FromParser

Methods

(==) :: FromParser -> FromParser -> Bool

(/=) :: FromParser -> FromParser -> Bool

Data FromParser

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FromParser -> c FromParser

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FromParser

toConstr :: FromParser -> Constr

dataTypeOf :: FromParser -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c FromParser)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FromParser)

gmapT :: (forall b. Data b => b -> b) -> FromParser -> FromParser

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FromParser -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FromParser -> r

gmapQ :: (forall d. Data d => d -> u) -> FromParser -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FromParser -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FromParser -> m FromParser

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FromParser -> m FromParser

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FromParser -> m FromParser

Generic FromParser

Associated Types

type Rep FromParser :: * -> *

Methods

from :: FromParser -> Rep FromParser x

to :: Rep FromParser x -> FromParser

type Rep FromParser

type Rep FromParser = D1 (MetaData "FromParser" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) V1

castModule :: Module a -> Module b

type ModuleFromParser = Module FromParser

type LExp = Labeled Exp

type LProc = LExp

data Exp

Constructors

Var LIdent

IntExp Integer

SetExp LRange (Maybe [LCompGen])

ListExp LRange (Maybe [LCompGen])

ClosureComprehension ([LExp], [LCompGen])

Let [LDecl] LExp

Ifte LExp LExp LExp

CallFunction LExp [[LExp]]

CallBuiltIn LBuiltIn [[LExp]]

Lambda [LPattern] LExp

Stop

Skip

CTrue

CFalse

Events

BoolSet

IntSet

TupleExp [LExp]

Parens LExp

AndExp LExp LExp

OrExp LExp LExp

NotExp LExp

NegExp LExp

Fun1 LBuiltIn LExp

Fun2 LBuiltIn LExp LExp

DotTuple [LExp]

Closure [LExp]

ProcSharing LExp LProc LProc

ProcAParallel LExp LExp LProc LProc

ProcLinkParallel LLinkList LProc LProc

ProcRenaming [LRename] (Maybe LCompGenList) LProc

ProcException LExp LProc LProc

ProcRepSequence LCompGenList LProc

ProcRepInternalChoice LCompGenList LProc

ProcRepExternalChoice LCompGenList LProc

ProcRepInterleave LCompGenList LProc

ProcRepAParallel LCompGenList LExp LProc

ProcRepLinkParallel LCompGenList LLinkList LProc

ProcRepSharing LCompGenList LExp LProc

PrefixExp LExp [LCommField] LProc

PrefixI FreeNames LExp [LCommField] LProc

LetI [LDecl] FreeNames LExp

LambdaI FreeNames [LPattern] LExp

ExprWithFreeNames FreeNames LExp

Instances

Eq Exp

Methods

(==) :: Exp -> Exp -> Bool

(/=) :: Exp -> Exp -> Bool

Data Exp

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Exp -> c Exp

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Exp

toConstr :: Exp -> Constr

dataTypeOf :: Exp -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Exp)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Exp)

gmapT :: (forall b. Data b => b -> b) -> Exp -> Exp

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Exp -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Exp -> r

gmapQ :: (forall d. Data d => d -> u) -> Exp -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Exp -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Exp -> m Exp

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Exp -> m Exp

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Exp -> m Exp

Ord Exp

Methods

compare :: Exp -> Exp -> Ordering

(<) :: Exp -> Exp -> Bool

(<=) :: Exp -> Exp -> Bool

(>) :: Exp -> Exp -> Bool

(>=) :: Exp -> Exp -> Bool

max :: Exp -> Exp -> Exp

min :: Exp -> Exp -> Exp

Show Exp

Methods

showsPrec :: Int -> Exp -> ShowS

show :: Exp -> String

showList :: [Exp] -> ShowS

Generic Exp

Associated Types

type Rep Exp :: * -> *

Methods

from :: Exp -> Rep Exp x

to :: Rep Exp x -> Exp

type Rep Exp

type Rep Exp = D1 (MetaData "Exp" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) ((:+:) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "Var" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LIdent))) (C1 (MetaCons "IntExp" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Integer)))) ((:+:) (C1 (MetaCons "SetExp" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LRange)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe [LCompGen]))))) ((:+:) (C1 (MetaCons "ListExp" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LRange)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe [LCompGen]))))) (C1 (MetaCons "ClosureComprehension" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 ([LExp], [LCompGen]))))))) ((:+:) ((:+:) (C1 (MetaCons "Let" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LDecl])) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))) ((:+:) (C1 (MetaCons "Ifte" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))) (C1 (MetaCons "CallFunction" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [[LExp]])))))) ((:+:) (C1 (MetaCons "CallBuiltIn" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LBuiltIn)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [[LExp]])))) ((:+:) (C1 (MetaCons "Lambda" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LPattern])) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))) (C1 (MetaCons "Stop" PrefixI False) U1))))) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "Skip" PrefixI False) U1) (C1 (MetaCons "CTrue" PrefixI False) U1)) ((:+:) (C1 (MetaCons "CFalse" PrefixI False) U1) ((:+:) (C1 (MetaCons "Events" PrefixI False) U1) (C1 (MetaCons "BoolSet" PrefixI False) U1)))) ((:+:) ((:+:) (C1 (MetaCons "IntSet" PrefixI False) U1) ((:+:) (C1 (MetaCons "TupleExp" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LExp]))) (C1 (MetaCons "Parens" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))) ((:+:) (C1 (MetaCons "AndExp" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))) ((:+:) (C1 (MetaCons "OrExp" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))) (C1 (MetaCons "NotExp" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))))))) ((:+:) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "NegExp" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))) (C1 (MetaCons "Fun1" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LBuiltIn)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))) ((:+:) (C1 (MetaCons "Fun2" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LBuiltIn)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))) ((:+:) (C1 (MetaCons "DotTuple" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LExp]))) (C1 (MetaCons "Closure" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LExp])))))) ((:+:) ((:+:) (C1 (MetaCons "ProcSharing" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))) ((:+:) (C1 (MetaCons "ProcAParallel" PrefixI False) ((:*:) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))) (C1 (MetaCons "ProcLinkParallel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LLinkList)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))))) ((:+:) (C1 (MetaCons "ProcRenaming" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LRename])) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe LCompGenList))) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))) ((:+:) (C1 (MetaCons "ProcException" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))) (C1 (MetaCons "ProcRepSequence" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LCompGenList)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc)))))))) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "ProcRepInternalChoice" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LCompGenList)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc)))) (C1 (MetaCons "ProcRepExternalChoice" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LCompGenList)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))) ((:+:) (C1 (MetaCons "ProcRepInterleave" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LCompGenList)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc)))) ((:+:) (C1 (MetaCons "ProcRepAParallel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LCompGenList)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))) (C1 (MetaCons "ProcRepLinkParallel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LCompGenList)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LLinkList)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc)))))))) ((:+:) ((:+:) (C1 (MetaCons "ProcRepSharing" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LCompGenList)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))) ((:+:) (C1 (MetaCons "PrefixExp" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LCommField])) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))) (C1 (MetaCons "PrefixI" PrefixI False) ((:*:) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 FreeNames)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LCommField])) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LProc))))))) ((:+:) (C1 (MetaCons "LetI" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LDecl])) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 FreeNames)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))) ((:+:) (C1 (MetaCons "LambdaI" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 FreeNames)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LPattern])) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))) (C1 (MetaCons "ExprWithFreeNames" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 FreeNames)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))))))))

type LRange = Labeled Range

data Range

Constructors

RangeEnum [LExp]

RangeClosed LExp LExp

RangeOpen LExp

Instances

Eq Range

Methods

(==) :: Range -> Range -> Bool

(/=) :: Range -> Range -> Bool

Data Range

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Range -> c Range

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Range

toConstr :: Range -> Constr

dataTypeOf :: Range -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Range)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Range)

gmapT :: (forall b. Data b => b -> b) -> Range -> Range

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Range -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Range -> r

gmapQ :: (forall d. Data d => d -> u) -> Range -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Range -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Range -> m Range

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Range -> m Range

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Range -> m Range

Ord Range

Methods

compare :: Range -> Range -> Ordering

(<) :: Range -> Range -> Bool

(<=) :: Range -> Range -> Bool

(>) :: Range -> Range -> Bool

(>=) :: Range -> Range -> Bool

max :: Range -> Range -> Range

min :: Range -> Range -> Range

Show Range

Methods

showsPrec :: Int -> Range -> ShowS

show :: Range -> String

showList :: [Range] -> ShowS

Generic Range

Associated Types

type Rep Range :: * -> *

Methods

from :: Range -> Rep Range x

to :: Rep Range x -> Range

type Rep Range

type Rep Range = D1 (MetaData "Range" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "RangeEnum" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LExp]))) ((:+:) (C1 (MetaCons "RangeClosed" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))) (C1 (MetaCons "RangeOpen" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))))

type LCommField = Labeled CommField

data CommField

Constructors

InComm LPattern

InCommGuarded LPattern LExp

OutComm LExp

Instances

Eq CommField

Methods

(==) :: CommField -> CommField -> Bool

(/=) :: CommField -> CommField -> Bool

Data CommField

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CommField -> c CommField

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CommField

toConstr :: CommField -> Constr

dataTypeOf :: CommField -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c CommField)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CommField)

gmapT :: (forall b. Data b => b -> b) -> CommField -> CommField

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CommField -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CommField -> r

gmapQ :: (forall d. Data d => d -> u) -> CommField -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CommField -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CommField -> m CommField

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CommField -> m CommField

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CommField -> m CommField

Ord CommField

Methods

compare :: CommField -> CommField -> Ordering

(<) :: CommField -> CommField -> Bool

(<=) :: CommField -> CommField -> Bool

(>) :: CommField -> CommField -> Bool

(>=) :: CommField -> CommField -> Bool

max :: CommField -> CommField -> CommField

min :: CommField -> CommField -> CommField

Show CommField

Methods

showsPrec :: Int -> CommField -> ShowS

show :: CommField -> String

showList :: [CommField] -> ShowS

Generic CommField

Associated Types

type Rep CommField :: * -> *

Methods

from :: CommField -> Rep CommField x

to :: Rep CommField x -> CommField

type Rep CommField

type Rep CommField = D1 (MetaData "CommField" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "InComm" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LPattern))) ((:+:) (C1 (MetaCons "InCommGuarded" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LPattern)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))) (C1 (MetaCons "OutComm" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))))

type LLinkList = Labeled LinkList

data LinkList

Constructors

LinkList [LLink]

LinkListComprehension [LCompGen] [LLink]

Instances

Eq LinkList

Methods

(==) :: LinkList -> LinkList -> Bool

(/=) :: LinkList -> LinkList -> Bool

Data LinkList

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LinkList -> c LinkList

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LinkList

toConstr :: LinkList -> Constr

dataTypeOf :: LinkList -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c LinkList)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LinkList)

gmapT :: (forall b. Data b => b -> b) -> LinkList -> LinkList

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LinkList -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LinkList -> r

gmapQ :: (forall d. Data d => d -> u) -> LinkList -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> LinkList -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> LinkList -> m LinkList

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LinkList -> m LinkList

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LinkList -> m LinkList

Ord LinkList

Methods

compare :: LinkList -> LinkList -> Ordering

(<) :: LinkList -> LinkList -> Bool

(<=) :: LinkList -> LinkList -> Bool

(>) :: LinkList -> LinkList -> Bool

(>=) :: LinkList -> LinkList -> Bool

max :: LinkList -> LinkList -> LinkList

min :: LinkList -> LinkList -> LinkList

Show LinkList

Methods

showsPrec :: Int -> LinkList -> ShowS

show :: LinkList -> String

showList :: [LinkList] -> ShowS

Generic LinkList

Associated Types

type Rep LinkList :: * -> *

Methods

from :: LinkList -> Rep LinkList x

to :: Rep LinkList x -> LinkList

type Rep LinkList

type Rep LinkList = D1 (MetaData "LinkList" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "LinkList" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LLink]))) (C1 (MetaCons "LinkListComprehension" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LCompGen])) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LLink])))))

type LLink = Labeled Link

data Link

Constructors

Link LExp LExp

Instances

Eq Link

Methods

(==) :: Link -> Link -> Bool

(/=) :: Link -> Link -> Bool

Data Link

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Link -> c Link

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Link

toConstr :: Link -> Constr

dataTypeOf :: Link -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Link)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Link)

gmapT :: (forall b. Data b => b -> b) -> Link -> Link

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Link -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Link -> r

gmapQ :: (forall d. Data d => d -> u) -> Link -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Link -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Link -> m Link

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Link -> m Link

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Link -> m Link

Ord Link

Methods

compare :: Link -> Link -> Ordering

(<) :: Link -> Link -> Bool

(<=) :: Link -> Link -> Bool

(>) :: Link -> Link -> Bool

(>=) :: Link -> Link -> Bool

max :: Link -> Link -> Link

min :: Link -> Link -> Link

Show Link

Methods

showsPrec :: Int -> Link -> ShowS

show :: Link -> String

showList :: [Link] -> ShowS

Generic Link

Associated Types

type Rep Link :: * -> *

Methods

from :: Link -> Rep Link x

to :: Rep Link x -> Link

type Rep Link

type Rep Link = D1 (MetaData "Link" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) (C1 (MetaCons "Link" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))

type LRename = Labeled Rename

data Rename

Constructors

Rename LExp LExp

Instances

Eq Rename

Methods

(==) :: Rename -> Rename -> Bool

(/=) :: Rename -> Rename -> Bool

Data Rename

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Rename -> c Rename

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Rename

toConstr :: Rename -> Constr

dataTypeOf :: Rename -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Rename)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Rename)

gmapT :: (forall b. Data b => b -> b) -> Rename -> Rename

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Rename -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Rename -> r

gmapQ :: (forall d. Data d => d -> u) -> Rename -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Rename -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Rename -> m Rename

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Rename -> m Rename

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Rename -> m Rename

Ord Rename

Methods

compare :: Rename -> Rename -> Ordering

(<) :: Rename -> Rename -> Bool

(<=) :: Rename -> Rename -> Bool

(>) :: Rename -> Rename -> Bool

(>=) :: Rename -> Rename -> Bool

max :: Rename -> Rename -> Rename

min :: Rename -> Rename -> Rename

Show Rename

Methods

showsPrec :: Int -> Rename -> ShowS

show :: Rename -> String

showList :: [Rename] -> ShowS

Generic Rename

Associated Types

type Rep Rename :: * -> *

Methods

from :: Rename -> Rep Rename x

to :: Rep Rename x -> Rename

type Rep Rename

type Rep Rename = D1 (MetaData "Rename" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) (C1 (MetaCons "Rename" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))

type LBuiltIn = Labeled BuiltIn

data BuiltIn

Constructors

BuiltIn Const

Instances

Eq BuiltIn

Methods

(==) :: BuiltIn -> BuiltIn -> Bool

(/=) :: BuiltIn -> BuiltIn -> Bool

Data BuiltIn

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BuiltIn -> c BuiltIn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BuiltIn

toConstr :: BuiltIn -> Constr

dataTypeOf :: BuiltIn -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c BuiltIn)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BuiltIn)

gmapT :: (forall b. Data b => b -> b) -> BuiltIn -> BuiltIn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BuiltIn -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BuiltIn -> r

gmapQ :: (forall d. Data d => d -> u) -> BuiltIn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> BuiltIn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> BuiltIn -> m BuiltIn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BuiltIn -> m BuiltIn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BuiltIn -> m BuiltIn

Ord BuiltIn

Methods

compare :: BuiltIn -> BuiltIn -> Ordering

(<) :: BuiltIn -> BuiltIn -> Bool

(<=) :: BuiltIn -> BuiltIn -> Bool

(>) :: BuiltIn -> BuiltIn -> Bool

(>=) :: BuiltIn -> BuiltIn -> Bool

max :: BuiltIn -> BuiltIn -> BuiltIn

min :: BuiltIn -> BuiltIn -> BuiltIn

Show BuiltIn

Methods

showsPrec :: Int -> BuiltIn -> ShowS

show :: BuiltIn -> String

showList :: [BuiltIn] -> ShowS

Generic BuiltIn

Associated Types

type Rep BuiltIn :: * -> *

Methods

from :: BuiltIn -> Rep BuiltIn x

to :: Rep BuiltIn x -> BuiltIn

type Rep BuiltIn

type Rep BuiltIn = D1 (MetaData "BuiltIn" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) (C1 (MetaCons "BuiltIn" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Const)))

lBuiltInToConst :: LBuiltIn -> Const

type LCompGenList = Labeled [LCompGen]

type LCompGen = Labeled CompGen

data CompGen

Constructors

Generator LPattern LExp

Guard LExp

Instances

Eq CompGen

Methods

(==) :: CompGen -> CompGen -> Bool

(/=) :: CompGen -> CompGen -> Bool

Data CompGen

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CompGen -> c CompGen

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CompGen

toConstr :: CompGen -> Constr

dataTypeOf :: CompGen -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c CompGen)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CompGen)

gmapT :: (forall b. Data b => b -> b) -> CompGen -> CompGen

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CompGen -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CompGen -> r

gmapQ :: (forall d. Data d => d -> u) -> CompGen -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CompGen -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CompGen -> m CompGen

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CompGen -> m CompGen

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CompGen -> m CompGen

Ord CompGen

Methods

compare :: CompGen -> CompGen -> Ordering

(<) :: CompGen -> CompGen -> Bool

(<=) :: CompGen -> CompGen -> Bool

(>) :: CompGen -> CompGen -> Bool

(>=) :: CompGen -> CompGen -> Bool

max :: CompGen -> CompGen -> CompGen

min :: CompGen -> CompGen -> CompGen

Show CompGen

Methods

showsPrec :: Int -> CompGen -> ShowS

show :: CompGen -> String

showList :: [CompGen] -> ShowS

Generic CompGen

Associated Types

type Rep CompGen :: * -> *

Methods

from :: CompGen -> Rep CompGen x

to :: Rep CompGen x -> CompGen

type Rep CompGen

type Rep CompGen = D1 (MetaData "CompGen" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "Generator" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LPattern)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))) (C1 (MetaCons "Guard" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))))

type LPattern = Labeled Pattern

data Pattern

Constructors

IntPat Integer

TruePat

FalsePat

WildCard

Also [LPattern]

Append [LPattern]

DotPat [LPattern]

SingleSetPat LPattern

EmptySetPat

ListEnumPat [LPattern]

TuplePat [LPattern]

ConstrPat LIdent

VarPat LIdent

Selectors

Fields

• selectors :: Array Int Selector
• idents :: Array Int (Maybe LIdent)

Selector Selector (Maybe LIdent)

Instances

Eq Pattern

Methods

(==) :: Pattern -> Pattern -> Bool

(/=) :: Pattern -> Pattern -> Bool

Data Pattern

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Pattern -> c Pattern

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Pattern

toConstr :: Pattern -> Constr

dataTypeOf :: Pattern -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Pattern)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Pattern)

gmapT :: (forall b. Data b => b -> b) -> Pattern -> Pattern

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pattern -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pattern -> r

gmapQ :: (forall d. Data d => d -> u) -> Pattern -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Pattern -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pattern -> m Pattern

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pattern -> m Pattern

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pattern -> m Pattern

Ord Pattern

Methods

compare :: Pattern -> Pattern -> Ordering

(<) :: Pattern -> Pattern -> Bool

(<=) :: Pattern -> Pattern -> Bool

(>) :: Pattern -> Pattern -> Bool

(>=) :: Pattern -> Pattern -> Bool

max :: Pattern -> Pattern -> Pattern

min :: Pattern -> Pattern -> Pattern

Show Pattern

Methods

showsPrec :: Int -> Pattern -> ShowS

show :: Pattern -> String

showList :: [Pattern] -> ShowS

Generic Pattern

Associated Types

type Rep Pattern :: * -> *

Methods

from :: Pattern -> Rep Pattern x

to :: Rep Pattern x -> Pattern

type Rep Pattern

type Rep Pattern = D1 (MetaData "Pattern" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "IntPat" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Integer))) ((:+:) (C1 (MetaCons "TruePat" PrefixI False) U1) (C1 (MetaCons "FalsePat" PrefixI False) U1))) ((:+:) ((:+:) (C1 (MetaCons "WildCard" PrefixI False) U1) (C1 (MetaCons "Also" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LPattern])))) ((:+:) (C1 (MetaCons "Append" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LPattern]))) (C1 (MetaCons "DotPat" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LPattern])))))) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "SingleSetPat" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LPattern))) (C1 (MetaCons "EmptySetPat" PrefixI False) U1)) ((:+:) (C1 (MetaCons "ListEnumPat" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LPattern]))) (C1 (MetaCons "TuplePat" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LPattern]))))) ((:+:) ((:+:) (C1 (MetaCons "ConstrPat" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LIdent))) (C1 (MetaCons "VarPat" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LIdent)))) ((:+:) (C1 (MetaCons "Selectors" PrefixI True) ((:*:) (S1 (MetaSel (Just Symbol "selectors") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Array Int Selector))) (S1 (MetaSel (Just Symbol "idents") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Array Int (Maybe LIdent)))))) (C1 (MetaCons "Selector" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe LIdent)))))))))

data Selector

Constructors

IntSel Integer

TrueSel

FalseSel

SelectThis

ConstrSel UniqueIdent

DotSel Int Selector

SingleSetSel Selector

EmptySetSel

TupleLengthSel Int Selector

TupleIthSel Int Selector

ListLengthSel Int Selector

ListIthSel Int Selector

HeadSel Selector

HeadNSel Int Selector

PrefixSel Int Int Selector

TailSel Selector

SliceSel Int Int Selector

SuffixSel Int Int Selector

Instances

Eq Selector

Methods

(==) :: Selector -> Selector -> Bool

(/=) :: Selector -> Selector -> Bool

Data Selector

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Selector -> c Selector

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Selector

toConstr :: Selector -> Constr

dataTypeOf :: Selector -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Selector)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Selector)

gmapT :: (forall b. Data b => b -> b) -> Selector -> Selector

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Selector -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Selector -> r

gmapQ :: (forall d. Data d => d -> u) -> Selector -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Selector -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Selector -> m Selector

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Selector -> m Selector

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Selector -> m Selector

Ord Selector

Methods

compare :: Selector -> Selector -> Ordering

(<) :: Selector -> Selector -> Bool

(<=) :: Selector -> Selector -> Bool

(>) :: Selector -> Selector -> Bool

(>=) :: Selector -> Selector -> Bool

max :: Selector -> Selector -> Selector

min :: Selector -> Selector -> Selector

Show Selector

Methods

showsPrec :: Int -> Selector -> ShowS

show :: Selector -> String

showList :: [Selector] -> ShowS

Generic Selector

Associated Types

type Rep Selector :: * -> *

Methods

from :: Selector -> Rep Selector x

to :: Rep Selector x -> Selector

type Rep Selector

type Rep Selector = D1 (MetaData "Selector" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "IntSel" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Integer))) (C1 (MetaCons "TrueSel" PrefixI False) U1)) ((:+:) (C1 (MetaCons "FalseSel" PrefixI False) U1) (C1 (MetaCons "SelectThis" PrefixI False) U1))) ((:+:) ((:+:) (C1 (MetaCons "ConstrSel" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 UniqueIdent))) (C1 (MetaCons "DotSel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector))))) ((:+:) (C1 (MetaCons "SingleSetSel" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector))) ((:+:) (C1 (MetaCons "EmptySetSel" PrefixI False) U1) (C1 (MetaCons "TupleLengthSel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector)))))))) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "TupleIthSel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector)))) (C1 (MetaCons "ListLengthSel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector))))) ((:+:) (C1 (MetaCons "ListIthSel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector)))) (C1 (MetaCons "HeadSel" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector))))) ((:+:) ((:+:) (C1 (MetaCons "HeadNSel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector)))) (C1 (MetaCons "PrefixSel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector)))))) ((:+:) (C1 (MetaCons "TailSel" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector))) ((:+:) (C1 (MetaCons "SliceSel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector))))) (C1 (MetaCons "SuffixSel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Int)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Selector))))))))))

type LDecl = Labeled Decl

data Decl

Constructors

PatBind LPattern LExp

FunBind LIdent [FunCase]

Assert LAssertDecl

Transparent [LIdent]

SubType LIdent [LConstructor]

DataType LIdent [LConstructor]

NameType LIdent LTypeDef

Channel [LIdent] (Maybe LTypeDef)

Print LExp

Instances

Eq Decl

Methods

(==) :: Decl -> Decl -> Bool

(/=) :: Decl -> Decl -> Bool

Data Decl

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Decl -> c Decl

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Decl

toConstr :: Decl -> Constr

dataTypeOf :: Decl -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Decl)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Decl)

gmapT :: (forall b. Data b => b -> b) -> Decl -> Decl

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Decl -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Decl -> r

gmapQ :: (forall d. Data d => d -> u) -> Decl -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Decl -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Decl -> m Decl

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Decl -> m Decl

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Decl -> m Decl

Ord Decl

Methods

compare :: Decl -> Decl -> Ordering

(<) :: Decl -> Decl -> Bool

(<=) :: Decl -> Decl -> Bool

(>) :: Decl -> Decl -> Bool

(>=) :: Decl -> Decl -> Bool

max :: Decl -> Decl -> Decl

min :: Decl -> Decl -> Decl

Show Decl

Methods

showsPrec :: Int -> Decl -> ShowS

show :: Decl -> String

showList :: [Decl] -> ShowS

Generic Decl

Associated Types

type Rep Decl :: * -> *

Methods

from :: Decl -> Rep Decl x

to :: Rep Decl x -> Decl

type Rep Decl

type Rep Decl = D1 (MetaData "Decl" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "PatBind" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LPattern)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))) (C1 (MetaCons "FunBind" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LIdent)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [FunCase]))))) ((:+:) (C1 (MetaCons "Assert" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LAssertDecl))) (C1 (MetaCons "Transparent" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LIdent]))))) ((:+:) ((:+:) (C1 (MetaCons "SubType" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LIdent)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LConstructor])))) (C1 (MetaCons "DataType" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LIdent)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LConstructor]))))) ((:+:) (C1 (MetaCons "NameType" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LIdent)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LTypeDef)))) ((:+:) (C1 (MetaCons "Channel" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LIdent])) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe LTypeDef))))) (C1 (MetaCons "Print" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))))))

type FunArgs = [[LPattern]]

data FunCase

Constructors

FunCase FunArgs LExp

FunCaseI [LPattern] LExp

Instances

Eq FunCase

Methods

(==) :: FunCase -> FunCase -> Bool

(/=) :: FunCase -> FunCase -> Bool

Data FunCase

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FunCase -> c FunCase

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FunCase

toConstr :: FunCase -> Constr

dataTypeOf :: FunCase -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c FunCase)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FunCase)

gmapT :: (forall b. Data b => b -> b) -> FunCase -> FunCase

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FunCase -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FunCase -> r

gmapQ :: (forall d. Data d => d -> u) -> FunCase -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FunCase -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FunCase -> m FunCase

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FunCase -> m FunCase

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FunCase -> m FunCase

Ord FunCase

Methods

compare :: FunCase -> FunCase -> Ordering

(<) :: FunCase -> FunCase -> Bool

(<=) :: FunCase -> FunCase -> Bool

(>) :: FunCase -> FunCase -> Bool

(>=) :: FunCase -> FunCase -> Bool

max :: FunCase -> FunCase -> FunCase

min :: FunCase -> FunCase -> FunCase

Show FunCase

Methods

showsPrec :: Int -> FunCase -> ShowS

show :: FunCase -> String

showList :: [FunCase] -> ShowS

Generic FunCase

Associated Types

type Rep FunCase :: * -> *

Methods

from :: FunCase -> Rep FunCase x

to :: Rep FunCase x -> FunCase

type Rep FunCase

type Rep FunCase = D1 (MetaData "FunCase" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "FunCase" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 FunArgs)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))) (C1 (MetaCons "FunCaseI" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LPattern])) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))))

type LTypeDef = Labeled TypeDef

data TypeDef

Constructors

TypeTuple [LExp]

TypeDot [LExp]

Instances

Eq TypeDef

Methods

(==) :: TypeDef -> TypeDef -> Bool

(/=) :: TypeDef -> TypeDef -> Bool

Data TypeDef

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TypeDef -> c TypeDef

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TypeDef

toConstr :: TypeDef -> Constr

dataTypeOf :: TypeDef -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c TypeDef)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeDef)

gmapT :: (forall b. Data b => b -> b) -> TypeDef -> TypeDef

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TypeDef -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TypeDef -> r

gmapQ :: (forall d. Data d => d -> u) -> TypeDef -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TypeDef -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TypeDef -> m TypeDef

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeDef -> m TypeDef

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeDef -> m TypeDef

Ord TypeDef

Methods

compare :: TypeDef -> TypeDef -> Ordering

(<) :: TypeDef -> TypeDef -> Bool

(<=) :: TypeDef -> TypeDef -> Bool

(>) :: TypeDef -> TypeDef -> Bool

(>=) :: TypeDef -> TypeDef -> Bool

max :: TypeDef -> TypeDef -> TypeDef

min :: TypeDef -> TypeDef -> TypeDef

Show TypeDef

Methods

showsPrec :: Int -> TypeDef -> ShowS

show :: TypeDef -> String

showList :: [TypeDef] -> ShowS

Generic TypeDef

Associated Types

type Rep TypeDef :: * -> *

Methods

from :: TypeDef -> Rep TypeDef x

to :: Rep TypeDef x -> TypeDef

type Rep TypeDef

type Rep TypeDef = D1 (MetaData "TypeDef" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "TypeTuple" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LExp]))) (C1 (MetaCons "TypeDot" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [LExp]))))

type LConstructor = Labeled Constructor

data Constructor

Constructors

Constructor LIdent (Maybe LTypeDef)

Instances

Eq Constructor

Methods

(==) :: Constructor -> Constructor -> Bool

(/=) :: Constructor -> Constructor -> Bool

Data Constructor

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Constructor -> c Constructor

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Constructor

toConstr :: Constructor -> Constr

dataTypeOf :: Constructor -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Constructor)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Constructor)

gmapT :: (forall b. Data b => b -> b) -> Constructor -> Constructor

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Constructor -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Constructor -> r

gmapQ :: (forall d. Data d => d -> u) -> Constructor -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Constructor -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Constructor -> m Constructor

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Constructor -> m Constructor

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Constructor -> m Constructor

Ord Constructor

Methods

compare :: Constructor -> Constructor -> Ordering

(<) :: Constructor -> Constructor -> Bool

(<=) :: Constructor -> Constructor -> Bool

(>) :: Constructor -> Constructor -> Bool

(>=) :: Constructor -> Constructor -> Bool

max :: Constructor -> Constructor -> Constructor

min :: Constructor -> Constructor -> Constructor

Show Constructor

Methods

showsPrec :: Int -> Constructor -> ShowS

show :: Constructor -> String

showList :: [Constructor] -> ShowS

Generic Constructor

Associated Types

type Rep Constructor :: * -> *

Methods

from :: Constructor -> Rep Constructor x

to :: Rep Constructor x -> Constructor

type Rep Constructor

type Rep Constructor = D1 (MetaData "Constructor" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) (C1 (MetaCons "Constructor" PrefixI False) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LIdent)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe LTypeDef)))))

withLabel :: (NodeId -> a -> b) -> Labeled a -> Labeled b

type LAssertDecl = Labeled AssertDecl

data AssertDecl

Constructors

AssertBool LExp

AssertRefine Bool LExp LRefineOp LExp

AssertTauPrio Bool LExp LTauRefineOp LExp LExp

AssertModelCheck Bool LExp LFDRModels (Maybe LFdrExt)

Instances

Eq AssertDecl

Methods

(==) :: AssertDecl -> AssertDecl -> Bool

(/=) :: AssertDecl -> AssertDecl -> Bool

Data AssertDecl

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AssertDecl -> c AssertDecl

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AssertDecl

toConstr :: AssertDecl -> Constr

dataTypeOf :: AssertDecl -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c AssertDecl)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AssertDecl)

gmapT :: (forall b. Data b => b -> b) -> AssertDecl -> AssertDecl

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AssertDecl -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AssertDecl -> r

gmapQ :: (forall d. Data d => d -> u) -> AssertDecl -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AssertDecl -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AssertDecl -> m AssertDecl

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AssertDecl -> m AssertDecl

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AssertDecl -> m AssertDecl

Ord AssertDecl

Methods

compare :: AssertDecl -> AssertDecl -> Ordering

(<) :: AssertDecl -> AssertDecl -> Bool

(<=) :: AssertDecl -> AssertDecl -> Bool

(>) :: AssertDecl -> AssertDecl -> Bool

(>=) :: AssertDecl -> AssertDecl -> Bool

max :: AssertDecl -> AssertDecl -> AssertDecl

min :: AssertDecl -> AssertDecl -> AssertDecl

Show AssertDecl

Methods

showsPrec :: Int -> AssertDecl -> ShowS

show :: AssertDecl -> String

showList :: [AssertDecl] -> ShowS

Generic AssertDecl

Associated Types

type Rep AssertDecl :: * -> *

Methods

from :: AssertDecl -> Rep AssertDecl x

to :: Rep AssertDecl x -> AssertDecl

type Rep AssertDecl

type Rep AssertDecl = D1 (MetaData "AssertDecl" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) ((:+:) (C1 (MetaCons "AssertBool" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))) (C1 (MetaCons "AssertRefine" PrefixI False) ((:*:) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Bool)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LRefineOp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))))) ((:+:) (C1 (MetaCons "AssertTauPrio" PrefixI False) ((:*:) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Bool)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LTauRefineOp)) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp)))))) (C1 (MetaCons "AssertModelCheck" PrefixI False) ((:*:) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Bool)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LExp))) ((:*:) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 LFDRModels)) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe LFdrExt))))))))

type LFDRModels = Labeled FDRModels

data FDRModels

Constructors

DeadlockFree

Deterministic

LivelockFree

Instances

Eq FDRModels

Methods

(==) :: FDRModels -> FDRModels -> Bool

(/=) :: FDRModels -> FDRModels -> Bool

Data FDRModels

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FDRModels -> c FDRModels

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FDRModels

toConstr :: FDRModels -> Constr

dataTypeOf :: FDRModels -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c FDRModels)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FDRModels)

gmapT :: (forall b. Data b => b -> b) -> FDRModels -> FDRModels

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FDRModels -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FDRModels -> r

gmapQ :: (forall d. Data d => d -> u) -> FDRModels -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FDRModels -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FDRModels -> m FDRModels

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FDRModels -> m FDRModels

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FDRModels -> m FDRModels

Ord FDRModels

Methods

compare :: FDRModels -> FDRModels -> Ordering

(<) :: FDRModels -> FDRModels -> Bool

(<=) :: FDRModels -> FDRModels -> Bool

(>) :: FDRModels -> FDRModels -> Bool

(>=) :: FDRModels -> FDRModels -> Bool

max :: FDRModels -> FDRModels -> FDRModels

min :: FDRModels -> FDRModels -> FDRModels

Show FDRModels

Methods

showsPrec :: Int -> FDRModels -> ShowS

show :: FDRModels -> String

showList :: [FDRModels] -> ShowS

Generic FDRModels

Associated Types

type Rep FDRModels :: * -> *

Methods

from :: FDRModels -> Rep FDRModels x

to :: Rep FDRModels x -> FDRModels

type Rep FDRModels

type Rep FDRModels = D1 (MetaData "FDRModels" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "DeadlockFree" PrefixI False) U1) ((:+:) (C1 (MetaCons "Deterministic" PrefixI False) U1) (C1 (MetaCons "LivelockFree" PrefixI False) U1)))

type LFdrExt = Labeled FdrExt

data FdrExt

Constructors

F

FD

T

Instances

Eq FdrExt

Methods

(==) :: FdrExt -> FdrExt -> Bool

(/=) :: FdrExt -> FdrExt -> Bool

Data FdrExt

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FdrExt -> c FdrExt

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FdrExt

toConstr :: FdrExt -> Constr

dataTypeOf :: FdrExt -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c FdrExt)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FdrExt)

gmapT :: (forall b. Data b => b -> b) -> FdrExt -> FdrExt

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FdrExt -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FdrExt -> r

gmapQ :: (forall d. Data d => d -> u) -> FdrExt -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FdrExt -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FdrExt -> m FdrExt

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FdrExt -> m FdrExt

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FdrExt -> m FdrExt

Ord FdrExt

Methods

compare :: FdrExt -> FdrExt -> Ordering

(<) :: FdrExt -> FdrExt -> Bool

(<=) :: FdrExt -> FdrExt -> Bool

(>) :: FdrExt -> FdrExt -> Bool

(>=) :: FdrExt -> FdrExt -> Bool

max :: FdrExt -> FdrExt -> FdrExt

min :: FdrExt -> FdrExt -> FdrExt

Show FdrExt

Methods

showsPrec :: Int -> FdrExt -> ShowS

show :: FdrExt -> String

showList :: [FdrExt] -> ShowS

Generic FdrExt

Associated Types

type Rep FdrExt :: * -> *

Methods

from :: FdrExt -> Rep FdrExt x

to :: Rep FdrExt x -> FdrExt

type Rep FdrExt

type Rep FdrExt = D1 (MetaData "FdrExt" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "F" PrefixI False) U1) ((:+:) (C1 (MetaCons "FD" PrefixI False) U1) (C1 (MetaCons "T" PrefixI False) U1)))

type LTauRefineOp = Labeled TauRefineOp

data TauRefineOp

Constructors

TauTrace

TauRefine

Instances

Eq TauRefineOp

Methods

(==) :: TauRefineOp -> TauRefineOp -> Bool

(/=) :: TauRefineOp -> TauRefineOp -> Bool

Data TauRefineOp

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TauRefineOp -> c TauRefineOp

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TauRefineOp

toConstr :: TauRefineOp -> Constr

dataTypeOf :: TauRefineOp -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c TauRefineOp)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TauRefineOp)

gmapT :: (forall b. Data b => b -> b) -> TauRefineOp -> TauRefineOp

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TauRefineOp -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TauRefineOp -> r

gmapQ :: (forall d. Data d => d -> u) -> TauRefineOp -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TauRefineOp -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TauRefineOp -> m TauRefineOp

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TauRefineOp -> m TauRefineOp

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TauRefineOp -> m TauRefineOp

Ord TauRefineOp

Methods

compare :: TauRefineOp -> TauRefineOp -> Ordering

(<) :: TauRefineOp -> TauRefineOp -> Bool

(<=) :: TauRefineOp -> TauRefineOp -> Bool

(>) :: TauRefineOp -> TauRefineOp -> Bool

(>=) :: TauRefineOp -> TauRefineOp -> Bool

max :: TauRefineOp -> TauRefineOp -> TauRefineOp

min :: TauRefineOp -> TauRefineOp -> TauRefineOp

Show TauRefineOp

Methods

showsPrec :: Int -> TauRefineOp -> ShowS

show :: TauRefineOp -> String

showList :: [TauRefineOp] -> ShowS

Generic TauRefineOp

Associated Types

type Rep TauRefineOp :: * -> *

Methods

from :: TauRefineOp -> Rep TauRefineOp x

to :: Rep TauRefineOp x -> TauRefineOp

type Rep TauRefineOp

type Rep TauRefineOp = D1 (MetaData "TauRefineOp" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "TauTrace" PrefixI False) U1) (C1 (MetaCons "TauRefine" PrefixI False) U1))

type LRefineOp = Labeled RefineOp

data RefineOp

Constructors

Trace

Failure

FailureDivergence

RefusalTesting

RefusalTestingDiv

RevivalTesting

RevivalTestingDiv

TauPriorityOp

Instances

Eq RefineOp

Methods

(==) :: RefineOp -> RefineOp -> Bool

(/=) :: RefineOp -> RefineOp -> Bool

Data RefineOp

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RefineOp -> c RefineOp

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RefineOp

toConstr :: RefineOp -> Constr

dataTypeOf :: RefineOp -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c RefineOp)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RefineOp)

gmapT :: (forall b. Data b => b -> b) -> RefineOp -> RefineOp

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RefineOp -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RefineOp -> r

gmapQ :: (forall d. Data d => d -> u) -> RefineOp -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> RefineOp -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RefineOp -> m RefineOp

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RefineOp -> m RefineOp

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RefineOp -> m RefineOp

Ord RefineOp

Methods

compare :: RefineOp -> RefineOp -> Ordering

(<) :: RefineOp -> RefineOp -> Bool

(<=) :: RefineOp -> RefineOp -> Bool

(>) :: RefineOp -> RefineOp -> Bool

(>=) :: RefineOp -> RefineOp -> Bool

max :: RefineOp -> RefineOp -> RefineOp

min :: RefineOp -> RefineOp -> RefineOp

Show RefineOp

Methods

showsPrec :: Int -> RefineOp -> ShowS

show :: RefineOp -> String

showList :: [RefineOp] -> ShowS

Generic RefineOp

Associated Types

type Rep RefineOp :: * -> *

Methods

from :: RefineOp -> Rep RefineOp x

to :: Rep RefineOp x -> RefineOp

type Rep RefineOp

type Rep RefineOp = D1 (MetaData "RefineOp" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "Trace" PrefixI False) U1) (C1 (MetaCons "Failure" PrefixI False) U1)) ((:+:) (C1 (MetaCons "FailureDivergence" PrefixI False) U1) (C1 (MetaCons "RefusalTesting" PrefixI False) U1))) ((:+:) ((:+:) (C1 (MetaCons "RefusalTestingDiv" PrefixI False) U1) (C1 (MetaCons "RevivalTesting" PrefixI False) U1)) ((:+:) (C1 (MetaCons "RevivalTestingDiv" PrefixI False) U1) (C1 (MetaCons "TauPriorityOp" PrefixI False) U1))))

data Const

Constructors

F_true

F_false

F_not

F_and

F_or

F_union

F_inter

F_diff

F_Union

F_Inter

F_member

F_card

F_empty

F_set

F_Set

F_Seq

F_null

F_head

F_tail

F_concat

F_elem

F_length

F_STOP

F_SKIP

F_Events

F_Int

F_Bool

F_CHAOS

F_Concat

F_Len2

F_Mult

F_Div

F_Mod

F_Add

F_Sub

F_Eq

F_NEq

F_GE

F_LE

F_LT

F_GT

F_Guard

F_Sequential

F_Interrupt

F_ExtChoice

F_IntChoice

F_Hiding

F_Timeout

F_Interleave

Instances

Eq Const

Methods

(==) :: Const -> Const -> Bool

(/=) :: Const -> Const -> Bool

Data Const

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Const -> c Const

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Const

toConstr :: Const -> Constr

dataTypeOf :: Const -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Const)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Const)

gmapT :: (forall b. Data b => b -> b) -> Const -> Const

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Const -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Const -> r

gmapQ :: (forall d. Data d => d -> u) -> Const -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Const -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Const -> m Const

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Const -> m Const

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Const -> m Const

Ord Const

Methods

compare :: Const -> Const -> Ordering

(<) :: Const -> Const -> Bool

(<=) :: Const -> Const -> Bool

(>) :: Const -> Const -> Bool

(>=) :: Const -> Const -> Bool

max :: Const -> Const -> Const

min :: Const -> Const -> Const

Show Const

Methods

showsPrec :: Int -> Const -> ShowS

show :: Const -> String

showList :: [Const] -> ShowS

Generic Const

Associated Types

type Rep Const :: * -> *

Methods

from :: Const -> Rep Const x

to :: Rep Const x -> Const

type Rep Const

type Rep Const = D1 (MetaData "Const" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) ((:+:) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "F_true" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_false" PrefixI False) U1) (C1 (MetaCons "F_not" PrefixI False) U1))) ((:+:) (C1 (MetaCons "F_and" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_or" PrefixI False) U1) (C1 (MetaCons "F_union" PrefixI False) U1)))) ((:+:) ((:+:) (C1 (MetaCons "F_inter" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_diff" PrefixI False) U1) (C1 (MetaCons "F_Union" PrefixI False) U1))) ((:+:) (C1 (MetaCons "F_Inter" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_member" PrefixI False) U1) (C1 (MetaCons "F_card" PrefixI False) U1))))) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "F_empty" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_set" PrefixI False) U1) (C1 (MetaCons "F_Set" PrefixI False) U1))) ((:+:) (C1 (MetaCons "F_Seq" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_null" PrefixI False) U1) (C1 (MetaCons "F_head" PrefixI False) U1)))) ((:+:) ((:+:) (C1 (MetaCons "F_tail" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_concat" PrefixI False) U1) (C1 (MetaCons "F_elem" PrefixI False) U1))) ((:+:) (C1 (MetaCons "F_length" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_STOP" PrefixI False) U1) (C1 (MetaCons "F_SKIP" PrefixI False) U1)))))) ((:+:) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "F_Events" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_Int" PrefixI False) U1) (C1 (MetaCons "F_Bool" PrefixI False) U1))) ((:+:) (C1 (MetaCons "F_CHAOS" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_Concat" PrefixI False) U1) (C1 (MetaCons "F_Len2" PrefixI False) U1)))) ((:+:) ((:+:) (C1 (MetaCons "F_Mult" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_Div" PrefixI False) U1) (C1 (MetaCons "F_Mod" PrefixI False) U1))) ((:+:) (C1 (MetaCons "F_Add" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_Sub" PrefixI False) U1) (C1 (MetaCons "F_Eq" PrefixI False) U1))))) ((:+:) ((:+:) ((:+:) (C1 (MetaCons "F_NEq" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_GE" PrefixI False) U1) (C1 (MetaCons "F_LE" PrefixI False) U1))) ((:+:) (C1 (MetaCons "F_LT" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_GT" PrefixI False) U1) (C1 (MetaCons "F_Guard" PrefixI False) U1)))) ((:+:) ((:+:) (C1 (MetaCons "F_Sequential" PrefixI False) U1) ((:+:) (C1 (MetaCons "F_Interrupt" PrefixI False) U1) (C1 (MetaCons "F_ExtChoice" PrefixI False) U1))) ((:+:) ((:+:) (C1 (MetaCons "F_IntChoice" PrefixI False) U1) (C1 (MetaCons "F_Hiding" PrefixI False) U1)) ((:+:) (C1 (MetaCons "F_Timeout" PrefixI False) U1) (C1 (MetaCons "F_Interleave" PrefixI False) U1)))))))

type Pragma = String

type LocComment = (Comment, SrcLoc)

data Comment

Constructors

LineComment String

BlockComment String

PragmaComment Pragma

Instances

Eq Comment

Methods

(==) :: Comment -> Comment -> Bool

(/=) :: Comment -> Comment -> Bool

Data Comment

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Comment -> c Comment

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Comment

toConstr :: Comment -> Constr

dataTypeOf :: Comment -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c Comment)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Comment)

gmapT :: (forall b. Data b => b -> b) -> Comment -> Comment

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Comment -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Comment -> r

gmapQ :: (forall d. Data d => d -> u) -> Comment -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Comment -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Comment -> m Comment

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Comment -> m Comment

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Comment -> m Comment

Ord Comment

Methods

compare :: Comment -> Comment -> Ordering

(<) :: Comment -> Comment -> Bool

(<=) :: Comment -> Comment -> Bool

(>) :: Comment -> Comment -> Bool

(>=) :: Comment -> Comment -> Bool

max :: Comment -> Comment -> Comment

min :: Comment -> Comment -> Comment

Show Comment

Methods

showsPrec :: Int -> Comment -> ShowS

show :: Comment -> String

showList :: [Comment] -> ShowS

Generic Comment

Associated Types

type Rep Comment :: * -> *

Methods

from :: Comment -> Rep Comment x

to :: Rep Comment x -> Comment

type Rep Comment

type Rep Comment = D1 (MetaData "Comment" "Language.CSPM.AST" "CSPM-Frontend-0.12.1.0-2XObDhQeBFNG5DmoldftgD" False) ((:+:) (C1 (MetaCons "LineComment" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 String))) ((:+:) (C1 (MetaCons "BlockComment" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 String))) (C1 (MetaCons "PragmaComment" PrefixI False) (S1 (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Pragma)))))