Safe Haskell | None |
---|---|
Language | Haskell2010 |
The abstract syntax of language Syntax.
Synopsis
- type Module = Module' BNFC'Position
- data Module' a = Module a (LanguageDecl' a) [Command' a]
- type HoleIdent = HoleIdent' BNFC'Position
- data HoleIdent' a = HoleIdent a HoleIdentToken
- type VarIdent = VarIdent' BNFC'Position
- data VarIdent' a = VarIdent a VarIdentToken
- type LanguageDecl = LanguageDecl' BNFC'Position
- data LanguageDecl' a = LanguageDecl a (Language' a)
- type Language = Language' BNFC'Position
- data Language' a = Rzk1 a
- type Command = Command' BNFC'Position
- data Command' a
- = CommandSetOption a String String
- | CommandUnsetOption a String
- | CommandCheck a (Term' a) (Term' a)
- | CommandCompute a (Term' a)
- | CommandComputeWHNF a (Term' a)
- | CommandComputeNF a (Term' a)
- | CommandPostulate a (VarIdent' a) (DeclUsedVars' a) [Param' a] (Term' a)
- | CommandAssume a [VarIdent' a] (Term' a)
- | CommandSection a (SectionName' a)
- | CommandSectionEnd a (SectionName' a)
- | CommandDefine a (VarIdent' a) (DeclUsedVars' a) [Param' a] (Term' a) (Term' a)
- type DeclUsedVars = DeclUsedVars' BNFC'Position
- data DeclUsedVars' a = DeclUsedVars a [VarIdent' a]
- type SectionName = SectionName' BNFC'Position
- data SectionName' a
- = NoSectionName a
- | SomeSectionName a (VarIdent' a)
- type Pattern = Pattern' BNFC'Position
- data Pattern' a
- = PatternUnit a
- | PatternVar a (VarIdent' a)
- | PatternPair a (Pattern' a) (Pattern' a)
- | PatternTuple a (Pattern' a) (Pattern' a) [Pattern' a]
- type Param = Param' BNFC'Position
- data Param' a
- = ParamPattern a (Pattern' a)
- | ParamPatternType a [Pattern' a] (Term' a)
- | ParamPatternShape a [Pattern' a] (Term' a) (Term' a)
- | ParamPatternShapeDeprecated a (Pattern' a) (Term' a) (Term' a)
- type ParamDecl = ParamDecl' BNFC'Position
- data ParamDecl' a
- = ParamType a (Term' a)
- | ParamTermType a (Term' a) (Term' a)
- | ParamTermShape a (Term' a) (Term' a) (Term' a)
- | ParamTermTypeDeprecated a (Pattern' a) (Term' a)
- | ParamVarShapeDeprecated a (Pattern' a) (Term' a) (Term' a)
- type SigmaParam = SigmaParam' BNFC'Position
- data SigmaParam' a = SigmaParam a (Pattern' a) (Term' a)
- type Restriction = Restriction' BNFC'Position
- data Restriction' a
- = Restriction a (Term' a) (Term' a)
- | ASCII_Restriction a (Term' a) (Term' a)
- type Term = Term' BNFC'Position
- data Term' a
- = Universe a
- | UniverseCube a
- | UniverseTope a
- | CubeUnit a
- | CubeUnitStar a
- | Cube2 a
- | Cube2_0 a
- | Cube2_1 a
- | CubeProduct a (Term' a) (Term' a)
- | TopeTop a
- | TopeBottom a
- | TopeEQ a (Term' a) (Term' a)
- | TopeLEQ a (Term' a) (Term' a)
- | TopeAnd a (Term' a) (Term' a)
- | TopeOr a (Term' a) (Term' a)
- | RecBottom a
- | RecOr a [Restriction' a]
- | RecOrDeprecated a (Term' a) (Term' a) (Term' a) (Term' a)
- | TypeFun a (ParamDecl' a) (Term' a)
- | TypeSigma a (Pattern' a) (Term' a) (Term' a)
- | TypeSigmaTuple a (SigmaParam' a) [SigmaParam' a] (Term' a)
- | TypeUnit a
- | TypeId a (Term' a) (Term' a) (Term' a)
- | TypeIdSimple a (Term' a) (Term' a)
- | TypeRestricted a (Term' a) [Restriction' a]
- | TypeExtensionDeprecated a (ParamDecl' a) (Term' a)
- | App a (Term' a) (Term' a)
- | Lambda a [Param' a] (Term' a)
- | Pair a (Term' a) (Term' a)
- | Tuple a (Term' a) (Term' a) [Term' a]
- | First a (Term' a)
- | Second a (Term' a)
- | Unit a
- | Refl a
- | ReflTerm a (Term' a)
- | ReflTermType a (Term' a) (Term' a)
- | IdJ a (Term' a) (Term' a) (Term' a) (Term' a) (Term' a) (Term' a)
- | Hole a (HoleIdent' a)
- | Var a (VarIdent' a)
- | TypeAsc a (Term' a) (Term' a)
- | ASCII_CubeUnitStar a
- | ASCII_Cube2_0 a
- | ASCII_Cube2_1 a
- | ASCII_TopeTop a
- | ASCII_TopeBottom a
- | ASCII_TopeEQ a (Term' a) (Term' a)
- | ASCII_TopeLEQ a (Term' a) (Term' a)
- | ASCII_TopeAnd a (Term' a) (Term' a)
- | ASCII_TopeOr a (Term' a) (Term' a)
- | ASCII_TypeFun a (ParamDecl' a) (Term' a)
- | ASCII_TypeSigma a (Pattern' a) (Term' a) (Term' a)
- | ASCII_TypeSigmaTuple a (SigmaParam' a) [SigmaParam' a] (Term' a)
- | ASCII_Lambda a [Param' a] (Term' a)
- | ASCII_TypeExtensionDeprecated a (ParamDecl' a) (Term' a)
- | ASCII_First a (Term' a)
- | ASCII_Second a (Term' a)
- commandPostulateNoParams :: a -> VarIdent' a -> DeclUsedVars' a -> Term' a -> Command' a
- commandVariable :: a -> VarIdent' a -> Term' a -> Command' a
- commandVariables :: a -> [VarIdent' a] -> Term' a -> Command' a
- commandDefineNoParams :: a -> VarIdent' a -> DeclUsedVars' a -> Term' a -> Term' a -> Command' a
- commandDef :: a -> VarIdent' a -> DeclUsedVars' a -> [Param' a] -> Term' a -> Term' a -> Command' a
- commandDefNoParams :: a -> VarIdent' a -> DeclUsedVars' a -> Term' a -> Term' a -> Command' a
- noDeclUsedVars :: a -> DeclUsedVars' a
- paramVarShapeDeprecated :: a -> Pattern' a -> Term' a -> Term' a -> ParamDecl' a
- ascii_CubeProduct :: a -> Term' a -> Term' a -> Term' a
- unicode_TypeSigmaAlt :: a -> Pattern' a -> Term' a -> Term' a -> Term' a
- unicode_TypeSigmaTupleAlt :: a -> SigmaParam' a -> [SigmaParam' a] -> Term' a -> Term' a
- newtype VarIdentToken = VarIdentToken String
- newtype HoleIdentToken = HoleIdentToken String
- type BNFC'Position = Maybe (Int, Int)
- pattern BNFC'NoPosition :: BNFC'Position
- pattern BNFC'Position :: Int -> Int -> BNFC'Position
- class HasPosition a where
- hasPosition :: a -> BNFC'Position
Documentation
type Module = Module' BNFC'Position Source #
Module a (LanguageDecl' a) [Command' a] |
Instances
Foldable Module' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => Module' m -> m # foldMap :: Monoid m => (a -> m) -> Module' a -> m # foldMap' :: Monoid m => (a -> m) -> Module' a -> m # foldr :: (a -> b -> b) -> b -> Module' a -> b # foldr' :: (a -> b -> b) -> b -> Module' a -> b # foldl :: (b -> a -> b) -> b -> Module' a -> b # foldl' :: (b -> a -> b) -> b -> Module' a -> b # foldr1 :: (a -> a -> a) -> Module' a -> a # foldl1 :: (a -> a -> a) -> Module' a -> a # elem :: Eq a => a -> Module' a -> Bool # maximum :: Ord a => Module' a -> a # minimum :: Ord a => Module' a -> a # | |||||
Traversable Module' Source # | |||||
Functor Module' Source # | |||||
HasPosition Module Source # | |||||
Defined in Language.Rzk.Syntax.Abs hasPosition :: Module -> BNFC'Position Source # | |||||
Data a => Data (Module' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs 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 :: forall r r'. (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) # | |||||
Generic (Module' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
| |||||
Read a => Read (Module' a) Source # | |||||
Show a => Show (Module' a) Source # | |||||
Eq a => Eq (Module' a) Source # | |||||
Ord a => Ord (Module' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Print (Module' a) Source # | |||||
type Rep (Module' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (Module' a) = D1 ('MetaData "Module'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) (C1 ('MetaCons "Module" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (LanguageDecl' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Command' a])))) |
type HoleIdent = HoleIdent' BNFC'Position Source #
data HoleIdent' a Source #
Instances
type VarIdent = VarIdent' BNFC'Position Source #
Instances
Foldable VarIdent' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => VarIdent' m -> m # foldMap :: Monoid m => (a -> m) -> VarIdent' a -> m # foldMap' :: Monoid m => (a -> m) -> VarIdent' a -> m # foldr :: (a -> b -> b) -> b -> VarIdent' a -> b # foldr' :: (a -> b -> b) -> b -> VarIdent' a -> b # foldl :: (b -> a -> b) -> b -> VarIdent' a -> b # foldl' :: (b -> a -> b) -> b -> VarIdent' a -> b # foldr1 :: (a -> a -> a) -> VarIdent' a -> a # foldl1 :: (a -> a -> a) -> VarIdent' a -> a # toList :: VarIdent' a -> [a] # length :: VarIdent' a -> Int # elem :: Eq a => a -> VarIdent' a -> Bool # maximum :: Ord a => VarIdent' a -> a # minimum :: Ord a => VarIdent' a -> a # | |||||
Traversable VarIdent' Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Functor VarIdent' Source # | |||||
HasPosition VarIdent Source # | |||||
Defined in Language.Rzk.Syntax.Abs hasPosition :: VarIdent -> BNFC'Position Source # | |||||
Data a => Data (VarIdent' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> VarIdent' a -> c (VarIdent' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (VarIdent' a) # toConstr :: VarIdent' a -> Constr # dataTypeOf :: VarIdent' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (VarIdent' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (VarIdent' a)) # gmapT :: (forall b. Data b => b -> b) -> VarIdent' a -> VarIdent' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> VarIdent' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> VarIdent' a -> r # gmapQ :: (forall d. Data d => d -> u) -> VarIdent' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> VarIdent' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> VarIdent' a -> m (VarIdent' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> VarIdent' a -> m (VarIdent' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> VarIdent' a -> m (VarIdent' a) # | |||||
Generic (VarIdent' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
| |||||
Read a => Read (VarIdent' a) Source # | |||||
Show a => Show (VarIdent' a) Source # | |||||
Eq a => Eq (VarIdent' a) Source # | |||||
Ord a => Ord (VarIdent' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Print (VarIdent' a) Source # | |||||
Print [VarIdent' a] Source # | |||||
type Rep (VarIdent' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (VarIdent' a) = D1 ('MetaData "VarIdent'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) (C1 ('MetaCons "VarIdent" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 VarIdentToken))) |
data LanguageDecl' a Source #
LanguageDecl a (Language' a) |
Instances
Foldable LanguageDecl' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => LanguageDecl' m -> m # foldMap :: Monoid m => (a -> m) -> LanguageDecl' a -> m # foldMap' :: Monoid m => (a -> m) -> LanguageDecl' a -> m # foldr :: (a -> b -> b) -> b -> LanguageDecl' a -> b # foldr' :: (a -> b -> b) -> b -> LanguageDecl' a -> b # foldl :: (b -> a -> b) -> b -> LanguageDecl' a -> b # foldl' :: (b -> a -> b) -> b -> LanguageDecl' a -> b # foldr1 :: (a -> a -> a) -> LanguageDecl' a -> a # foldl1 :: (a -> a -> a) -> LanguageDecl' a -> a # toList :: LanguageDecl' a -> [a] # null :: LanguageDecl' a -> Bool # length :: LanguageDecl' a -> Int # elem :: Eq a => a -> LanguageDecl' a -> Bool # maximum :: Ord a => LanguageDecl' a -> a # minimum :: Ord a => LanguageDecl' a -> a # sum :: Num a => LanguageDecl' a -> a # product :: Num a => LanguageDecl' a -> a # | |||||
Traversable LanguageDecl' Source # | |||||
Defined in Language.Rzk.Syntax.Abs traverse :: Applicative f => (a -> f b) -> LanguageDecl' a -> f (LanguageDecl' b) # sequenceA :: Applicative f => LanguageDecl' (f a) -> f (LanguageDecl' a) # mapM :: Monad m => (a -> m b) -> LanguageDecl' a -> m (LanguageDecl' b) # sequence :: Monad m => LanguageDecl' (m a) -> m (LanguageDecl' a) # | |||||
Functor LanguageDecl' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fmap :: (a -> b) -> LanguageDecl' a -> LanguageDecl' b # (<$) :: a -> LanguageDecl' b -> LanguageDecl' a # | |||||
HasPosition LanguageDecl Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Data a => Data (LanguageDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LanguageDecl' a -> c (LanguageDecl' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (LanguageDecl' a) # toConstr :: LanguageDecl' a -> Constr # dataTypeOf :: LanguageDecl' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (LanguageDecl' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (LanguageDecl' a)) # gmapT :: (forall b. Data b => b -> b) -> LanguageDecl' a -> LanguageDecl' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LanguageDecl' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LanguageDecl' a -> r # gmapQ :: (forall d. Data d => d -> u) -> LanguageDecl' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LanguageDecl' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LanguageDecl' a -> m (LanguageDecl' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LanguageDecl' a -> m (LanguageDecl' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LanguageDecl' a -> m (LanguageDecl' a) # | |||||
Generic (LanguageDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
from :: LanguageDecl' a -> Rep (LanguageDecl' a) x # to :: Rep (LanguageDecl' a) x -> LanguageDecl' a # | |||||
Read a => Read (LanguageDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs readsPrec :: Int -> ReadS (LanguageDecl' a) # readList :: ReadS [LanguageDecl' a] # readPrec :: ReadPrec (LanguageDecl' a) # readListPrec :: ReadPrec [LanguageDecl' a] # | |||||
Show a => Show (LanguageDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs showsPrec :: Int -> LanguageDecl' a -> ShowS # show :: LanguageDecl' a -> String # showList :: [LanguageDecl' a] -> ShowS # | |||||
Eq a => Eq (LanguageDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs (==) :: LanguageDecl' a -> LanguageDecl' a -> Bool # (/=) :: LanguageDecl' a -> LanguageDecl' a -> Bool # | |||||
Ord a => Ord (LanguageDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs compare :: LanguageDecl' a -> LanguageDecl' a -> Ordering # (<) :: LanguageDecl' a -> LanguageDecl' a -> Bool # (<=) :: LanguageDecl' a -> LanguageDecl' a -> Bool # (>) :: LanguageDecl' a -> LanguageDecl' a -> Bool # (>=) :: LanguageDecl' a -> LanguageDecl' a -> Bool # max :: LanguageDecl' a -> LanguageDecl' a -> LanguageDecl' a # min :: LanguageDecl' a -> LanguageDecl' a -> LanguageDecl' a # | |||||
Print (LanguageDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
type Rep (LanguageDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (LanguageDecl' a) = D1 ('MetaData "LanguageDecl'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) (C1 ('MetaCons "LanguageDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Language' a)))) |
type Language = Language' BNFC'Position Source #
Rzk1 a |
Instances
Foldable Language' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => Language' m -> m # foldMap :: Monoid m => (a -> m) -> Language' a -> m # foldMap' :: Monoid m => (a -> m) -> Language' a -> m # foldr :: (a -> b -> b) -> b -> Language' a -> b # foldr' :: (a -> b -> b) -> b -> Language' a -> b # foldl :: (b -> a -> b) -> b -> Language' a -> b # foldl' :: (b -> a -> b) -> b -> Language' a -> b # foldr1 :: (a -> a -> a) -> Language' a -> a # foldl1 :: (a -> a -> a) -> Language' a -> a # toList :: Language' a -> [a] # length :: Language' a -> Int # elem :: Eq a => a -> Language' a -> Bool # maximum :: Ord a => Language' a -> a # minimum :: Ord a => Language' a -> a # | |||||
Traversable Language' Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Functor Language' Source # | |||||
HasPosition Language Source # | |||||
Defined in Language.Rzk.Syntax.Abs hasPosition :: Language -> BNFC'Position Source # | |||||
Data a => Data (Language' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Language' a -> c (Language' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Language' a) # toConstr :: Language' a -> Constr # dataTypeOf :: Language' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Language' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Language' a)) # gmapT :: (forall b. Data b => b -> b) -> Language' a -> Language' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Language' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Language' a -> r # gmapQ :: (forall d. Data d => d -> u) -> Language' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Language' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Language' a -> m (Language' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Language' a -> m (Language' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Language' a -> m (Language' a) # | |||||
Generic (Language' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
| |||||
Read a => Read (Language' a) Source # | |||||
Show a => Show (Language' a) Source # | |||||
Eq a => Eq (Language' a) Source # | |||||
Ord a => Ord (Language' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Print (Language' a) Source # | |||||
type Rep (Language' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs |
type Command = Command' BNFC'Position Source #
CommandSetOption a String String | |
CommandUnsetOption a String | |
CommandCheck a (Term' a) (Term' a) | |
CommandCompute a (Term' a) | |
CommandComputeWHNF a (Term' a) | |
CommandComputeNF a (Term' a) | |
CommandPostulate a (VarIdent' a) (DeclUsedVars' a) [Param' a] (Term' a) | |
CommandAssume a [VarIdent' a] (Term' a) | |
CommandSection a (SectionName' a) | |
CommandSectionEnd a (SectionName' a) | |
CommandDefine a (VarIdent' a) (DeclUsedVars' a) [Param' a] (Term' a) (Term' a) |
Instances
Foldable Command' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => Command' m -> m # foldMap :: Monoid m => (a -> m) -> Command' a -> m # foldMap' :: Monoid m => (a -> m) -> Command' a -> m # foldr :: (a -> b -> b) -> b -> Command' a -> b # foldr' :: (a -> b -> b) -> b -> Command' a -> b # foldl :: (b -> a -> b) -> b -> Command' a -> b # foldl' :: (b -> a -> b) -> b -> Command' a -> b # foldr1 :: (a -> a -> a) -> Command' a -> a # foldl1 :: (a -> a -> a) -> Command' a -> a # elem :: Eq a => a -> Command' a -> Bool # maximum :: Ord a => Command' a -> a # minimum :: Ord a => Command' a -> a # | |||||
Traversable Command' Source # | |||||
Functor Command' Source # | |||||
HasPosition Command Source # | |||||
Defined in Language.Rzk.Syntax.Abs hasPosition :: Command -> BNFC'Position Source # | |||||
Data a => Data (Command' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Command' a -> c (Command' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Command' a) # toConstr :: Command' a -> Constr # dataTypeOf :: Command' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Command' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Command' a)) # gmapT :: (forall b. Data b => b -> b) -> Command' a -> Command' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Command' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Command' a -> r # gmapQ :: (forall d. Data d => d -> u) -> Command' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Command' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Command' a -> m (Command' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Command' a -> m (Command' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Command' a -> m (Command' a) # | |||||
Generic (Command' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
| |||||
Read a => Read (Command' a) Source # | |||||
Show a => Show (Command' a) Source # | |||||
Eq a => Eq (Command' a) Source # | |||||
Ord a => Ord (Command' a) Source # | |||||
Print (Command' a) Source # | |||||
Print [Command' a] Source # | |||||
type Rep (Command' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (Command' a) = D1 ('MetaData "Command'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) (((C1 ('MetaCons "CommandSetOption" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: C1 ('MetaCons "CommandUnsetOption" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: (C1 ('MetaCons "CommandCheck" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: (C1 ('MetaCons "CommandCompute" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :+: C1 ('MetaCons "CommandComputeWHNF" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))))) :+: ((C1 ('MetaCons "CommandComputeNF" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :+: (C1 ('MetaCons "CommandPostulate" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (VarIdent' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclUsedVars' a)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Param' a]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: C1 ('MetaCons "CommandAssume" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [VarIdent' a]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))))) :+: (C1 ('MetaCons "CommandSection" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (SectionName' a))) :+: (C1 ('MetaCons "CommandSectionEnd" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (SectionName' a))) :+: C1 ('MetaCons "CommandDefine" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (VarIdent' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclUsedVars' a)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Param' a]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))))))) |
data DeclUsedVars' a Source #
DeclUsedVars a [VarIdent' a] |
Instances
Foldable DeclUsedVars' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => DeclUsedVars' m -> m # foldMap :: Monoid m => (a -> m) -> DeclUsedVars' a -> m # foldMap' :: Monoid m => (a -> m) -> DeclUsedVars' a -> m # foldr :: (a -> b -> b) -> b -> DeclUsedVars' a -> b # foldr' :: (a -> b -> b) -> b -> DeclUsedVars' a -> b # foldl :: (b -> a -> b) -> b -> DeclUsedVars' a -> b # foldl' :: (b -> a -> b) -> b -> DeclUsedVars' a -> b # foldr1 :: (a -> a -> a) -> DeclUsedVars' a -> a # foldl1 :: (a -> a -> a) -> DeclUsedVars' a -> a # toList :: DeclUsedVars' a -> [a] # null :: DeclUsedVars' a -> Bool # length :: DeclUsedVars' a -> Int # elem :: Eq a => a -> DeclUsedVars' a -> Bool # maximum :: Ord a => DeclUsedVars' a -> a # minimum :: Ord a => DeclUsedVars' a -> a # sum :: Num a => DeclUsedVars' a -> a # product :: Num a => DeclUsedVars' a -> a # | |||||
Traversable DeclUsedVars' Source # | |||||
Defined in Language.Rzk.Syntax.Abs traverse :: Applicative f => (a -> f b) -> DeclUsedVars' a -> f (DeclUsedVars' b) # sequenceA :: Applicative f => DeclUsedVars' (f a) -> f (DeclUsedVars' a) # mapM :: Monad m => (a -> m b) -> DeclUsedVars' a -> m (DeclUsedVars' b) # sequence :: Monad m => DeclUsedVars' (m a) -> m (DeclUsedVars' a) # | |||||
Functor DeclUsedVars' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fmap :: (a -> b) -> DeclUsedVars' a -> DeclUsedVars' b # (<$) :: a -> DeclUsedVars' b -> DeclUsedVars' a # | |||||
HasPosition DeclUsedVars Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Data a => Data (DeclUsedVars' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DeclUsedVars' a -> c (DeclUsedVars' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DeclUsedVars' a) # toConstr :: DeclUsedVars' a -> Constr # dataTypeOf :: DeclUsedVars' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (DeclUsedVars' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DeclUsedVars' a)) # gmapT :: (forall b. Data b => b -> b) -> DeclUsedVars' a -> DeclUsedVars' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DeclUsedVars' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DeclUsedVars' a -> r # gmapQ :: (forall d. Data d => d -> u) -> DeclUsedVars' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> DeclUsedVars' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> DeclUsedVars' a -> m (DeclUsedVars' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DeclUsedVars' a -> m (DeclUsedVars' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DeclUsedVars' a -> m (DeclUsedVars' a) # | |||||
Generic (DeclUsedVars' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
from :: DeclUsedVars' a -> Rep (DeclUsedVars' a) x # to :: Rep (DeclUsedVars' a) x -> DeclUsedVars' a # | |||||
Read a => Read (DeclUsedVars' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs readsPrec :: Int -> ReadS (DeclUsedVars' a) # readList :: ReadS [DeclUsedVars' a] # readPrec :: ReadPrec (DeclUsedVars' a) # readListPrec :: ReadPrec [DeclUsedVars' a] # | |||||
Show a => Show (DeclUsedVars' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs showsPrec :: Int -> DeclUsedVars' a -> ShowS # show :: DeclUsedVars' a -> String # showList :: [DeclUsedVars' a] -> ShowS # | |||||
Eq a => Eq (DeclUsedVars' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs (==) :: DeclUsedVars' a -> DeclUsedVars' a -> Bool # (/=) :: DeclUsedVars' a -> DeclUsedVars' a -> Bool # | |||||
Ord a => Ord (DeclUsedVars' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs compare :: DeclUsedVars' a -> DeclUsedVars' a -> Ordering # (<) :: DeclUsedVars' a -> DeclUsedVars' a -> Bool # (<=) :: DeclUsedVars' a -> DeclUsedVars' a -> Bool # (>) :: DeclUsedVars' a -> DeclUsedVars' a -> Bool # (>=) :: DeclUsedVars' a -> DeclUsedVars' a -> Bool # max :: DeclUsedVars' a -> DeclUsedVars' a -> DeclUsedVars' a # min :: DeclUsedVars' a -> DeclUsedVars' a -> DeclUsedVars' a # | |||||
Print (DeclUsedVars' a) Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
type Rep (DeclUsedVars' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (DeclUsedVars' a) = D1 ('MetaData "DeclUsedVars'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) (C1 ('MetaCons "DeclUsedVars" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [VarIdent' a]))) |
type SectionName = SectionName' BNFC'Position Source #
data SectionName' a Source #
NoSectionName a | |
SomeSectionName a (VarIdent' a) |
Instances
Foldable SectionName' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => SectionName' m -> m # foldMap :: Monoid m => (a -> m) -> SectionName' a -> m # foldMap' :: Monoid m => (a -> m) -> SectionName' a -> m # foldr :: (a -> b -> b) -> b -> SectionName' a -> b # foldr' :: (a -> b -> b) -> b -> SectionName' a -> b # foldl :: (b -> a -> b) -> b -> SectionName' a -> b # foldl' :: (b -> a -> b) -> b -> SectionName' a -> b # foldr1 :: (a -> a -> a) -> SectionName' a -> a # foldl1 :: (a -> a -> a) -> SectionName' a -> a # toList :: SectionName' a -> [a] # null :: SectionName' a -> Bool # length :: SectionName' a -> Int # elem :: Eq a => a -> SectionName' a -> Bool # maximum :: Ord a => SectionName' a -> a # minimum :: Ord a => SectionName' a -> a # sum :: Num a => SectionName' a -> a # product :: Num a => SectionName' a -> a # | |||||
Traversable SectionName' Source # | |||||
Defined in Language.Rzk.Syntax.Abs traverse :: Applicative f => (a -> f b) -> SectionName' a -> f (SectionName' b) # sequenceA :: Applicative f => SectionName' (f a) -> f (SectionName' a) # mapM :: Monad m => (a -> m b) -> SectionName' a -> m (SectionName' b) # sequence :: Monad m => SectionName' (m a) -> m (SectionName' a) # | |||||
Functor SectionName' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fmap :: (a -> b) -> SectionName' a -> SectionName' b # (<$) :: a -> SectionName' b -> SectionName' a # | |||||
HasPosition SectionName Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Data a => Data (SectionName' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SectionName' a -> c (SectionName' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SectionName' a) # toConstr :: SectionName' a -> Constr # dataTypeOf :: SectionName' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SectionName' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SectionName' a)) # gmapT :: (forall b. Data b => b -> b) -> SectionName' a -> SectionName' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SectionName' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SectionName' a -> r # gmapQ :: (forall d. Data d => d -> u) -> SectionName' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> SectionName' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> SectionName' a -> m (SectionName' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SectionName' a -> m (SectionName' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SectionName' a -> m (SectionName' a) # | |||||
Generic (SectionName' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
from :: SectionName' a -> Rep (SectionName' a) x # to :: Rep (SectionName' a) x -> SectionName' a # | |||||
Read a => Read (SectionName' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs readsPrec :: Int -> ReadS (SectionName' a) # readList :: ReadS [SectionName' a] # readPrec :: ReadPrec (SectionName' a) # readListPrec :: ReadPrec [SectionName' a] # | |||||
Show a => Show (SectionName' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs showsPrec :: Int -> SectionName' a -> ShowS # show :: SectionName' a -> String # showList :: [SectionName' a] -> ShowS # | |||||
Eq a => Eq (SectionName' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs (==) :: SectionName' a -> SectionName' a -> Bool # (/=) :: SectionName' a -> SectionName' a -> Bool # | |||||
Ord a => Ord (SectionName' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs compare :: SectionName' a -> SectionName' a -> Ordering # (<) :: SectionName' a -> SectionName' a -> Bool # (<=) :: SectionName' a -> SectionName' a -> Bool # (>) :: SectionName' a -> SectionName' a -> Bool # (>=) :: SectionName' a -> SectionName' a -> Bool # max :: SectionName' a -> SectionName' a -> SectionName' a # min :: SectionName' a -> SectionName' a -> SectionName' a # | |||||
Print (SectionName' a) Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
type Rep (SectionName' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (SectionName' a) = D1 ('MetaData "SectionName'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) (C1 ('MetaCons "NoSectionName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "SomeSectionName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (VarIdent' a)))) |
type Pattern = Pattern' BNFC'Position Source #
PatternUnit a | |
PatternVar a (VarIdent' a) | |
PatternPair a (Pattern' a) (Pattern' a) | |
PatternTuple a (Pattern' a) (Pattern' a) [Pattern' a] |
Instances
Foldable Pattern' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => Pattern' m -> m # foldMap :: Monoid m => (a -> m) -> Pattern' a -> m # foldMap' :: Monoid m => (a -> m) -> Pattern' a -> m # foldr :: (a -> b -> b) -> b -> Pattern' a -> b # foldr' :: (a -> b -> b) -> b -> Pattern' a -> b # foldl :: (b -> a -> b) -> b -> Pattern' a -> b # foldl' :: (b -> a -> b) -> b -> Pattern' a -> b # foldr1 :: (a -> a -> a) -> Pattern' a -> a # foldl1 :: (a -> a -> a) -> Pattern' a -> a # elem :: Eq a => a -> Pattern' a -> Bool # maximum :: Ord a => Pattern' a -> a # minimum :: Ord a => Pattern' a -> a # | |||||
Traversable Pattern' Source # | |||||
Functor Pattern' Source # | |||||
HasPosition Pattern Source # | |||||
Defined in Language.Rzk.Syntax.Abs hasPosition :: Pattern -> BNFC'Position Source # | |||||
Data a => Data (Pattern' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Pattern' a -> c (Pattern' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Pattern' a) # toConstr :: Pattern' a -> Constr # dataTypeOf :: Pattern' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Pattern' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Pattern' a)) # gmapT :: (forall b. Data b => b -> b) -> Pattern' a -> Pattern' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pattern' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pattern' a -> r # gmapQ :: (forall d. Data d => d -> u) -> Pattern' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Pattern' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pattern' a -> m (Pattern' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pattern' a -> m (Pattern' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pattern' a -> m (Pattern' a) # | |||||
Generic (Pattern' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
| |||||
Read a => Read (Pattern' a) Source # | |||||
Show a => Show (Pattern' a) Source # | |||||
Eq a => Eq (Pattern' a) Source # | |||||
Ord a => Ord (Pattern' a) Source # | |||||
Print (Pattern' a) Source # | |||||
Print [Pattern' a] Source # | |||||
type Rep (Pattern' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (Pattern' a) = D1 ('MetaData "Pattern'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) ((C1 ('MetaCons "PatternUnit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "PatternVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (VarIdent' a)))) :+: (C1 ('MetaCons "PatternPair" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a)))) :+: C1 ('MetaCons "PatternTuple" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pattern' a]))))) |
type Param = Param' BNFC'Position Source #
ParamPattern a (Pattern' a) | |
ParamPatternType a [Pattern' a] (Term' a) | |
ParamPatternShape a [Pattern' a] (Term' a) (Term' a) | |
ParamPatternShapeDeprecated a (Pattern' a) (Term' a) (Term' a) |
Instances
Foldable Param' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => Param' m -> m # foldMap :: Monoid m => (a -> m) -> Param' a -> m # foldMap' :: Monoid m => (a -> m) -> Param' a -> m # foldr :: (a -> b -> b) -> b -> Param' a -> b # foldr' :: (a -> b -> b) -> b -> Param' a -> b # foldl :: (b -> a -> b) -> b -> Param' a -> b # foldl' :: (b -> a -> b) -> b -> Param' a -> b # foldr1 :: (a -> a -> a) -> Param' a -> a # foldl1 :: (a -> a -> a) -> Param' a -> a # elem :: Eq a => a -> Param' a -> Bool # maximum :: Ord a => Param' a -> a # minimum :: Ord a => Param' a -> a # | |||||
Traversable Param' Source # | |||||
Functor Param' Source # | |||||
HasPosition Param Source # | |||||
Defined in Language.Rzk.Syntax.Abs hasPosition :: Param -> BNFC'Position Source # | |||||
Data a => Data (Param' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Param' a -> c (Param' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Param' a) # toConstr :: Param' a -> Constr # dataTypeOf :: Param' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Param' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Param' a)) # gmapT :: (forall b. Data b => b -> b) -> Param' a -> Param' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Param' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Param' a -> r # gmapQ :: (forall d. Data d => d -> u) -> Param' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Param' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Param' a -> m (Param' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Param' a -> m (Param' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Param' a -> m (Param' a) # | |||||
Generic (Param' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
| |||||
Read a => Read (Param' a) Source # | |||||
Show a => Show (Param' a) Source # | |||||
Eq a => Eq (Param' a) Source # | |||||
Ord a => Ord (Param' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Print (Param' a) Source # | |||||
Print [Param' a] Source # | |||||
type Rep (Param' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (Param' a) = D1 ('MetaData "Param'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) ((C1 ('MetaCons "ParamPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a))) :+: C1 ('MetaCons "ParamPatternType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pattern' a]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: (C1 ('MetaCons "ParamPatternShape" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pattern' a])) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "ParamPatternShapeDeprecated" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))))) |
type ParamDecl = ParamDecl' BNFC'Position Source #
data ParamDecl' a Source #
ParamType a (Term' a) | |
ParamTermType a (Term' a) (Term' a) | |
ParamTermShape a (Term' a) (Term' a) (Term' a) | |
ParamTermTypeDeprecated a (Pattern' a) (Term' a) | |
ParamVarShapeDeprecated a (Pattern' a) (Term' a) (Term' a) |
Instances
Foldable ParamDecl' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => ParamDecl' m -> m # foldMap :: Monoid m => (a -> m) -> ParamDecl' a -> m # foldMap' :: Monoid m => (a -> m) -> ParamDecl' a -> m # foldr :: (a -> b -> b) -> b -> ParamDecl' a -> b # foldr' :: (a -> b -> b) -> b -> ParamDecl' a -> b # foldl :: (b -> a -> b) -> b -> ParamDecl' a -> b # foldl' :: (b -> a -> b) -> b -> ParamDecl' a -> b # foldr1 :: (a -> a -> a) -> ParamDecl' a -> a # foldl1 :: (a -> a -> a) -> ParamDecl' a -> a # toList :: ParamDecl' a -> [a] # null :: ParamDecl' a -> Bool # length :: ParamDecl' a -> Int # elem :: Eq a => a -> ParamDecl' a -> Bool # maximum :: Ord a => ParamDecl' a -> a # minimum :: Ord a => ParamDecl' a -> a # sum :: Num a => ParamDecl' a -> a # product :: Num a => ParamDecl' a -> a # | |||||
Traversable ParamDecl' Source # | |||||
Defined in Language.Rzk.Syntax.Abs traverse :: Applicative f => (a -> f b) -> ParamDecl' a -> f (ParamDecl' b) # sequenceA :: Applicative f => ParamDecl' (f a) -> f (ParamDecl' a) # mapM :: Monad m => (a -> m b) -> ParamDecl' a -> m (ParamDecl' b) # sequence :: Monad m => ParamDecl' (m a) -> m (ParamDecl' a) # | |||||
Functor ParamDecl' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fmap :: (a -> b) -> ParamDecl' a -> ParamDecl' b # (<$) :: a -> ParamDecl' b -> ParamDecl' a # | |||||
HasPosition ParamDecl Source # | |||||
Defined in Language.Rzk.Syntax.Abs hasPosition :: ParamDecl -> BNFC'Position Source # | |||||
Data a => Data (ParamDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ParamDecl' a -> c (ParamDecl' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ParamDecl' a) # toConstr :: ParamDecl' a -> Constr # dataTypeOf :: ParamDecl' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ParamDecl' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ParamDecl' a)) # gmapT :: (forall b. Data b => b -> b) -> ParamDecl' a -> ParamDecl' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ParamDecl' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ParamDecl' a -> r # gmapQ :: (forall d. Data d => d -> u) -> ParamDecl' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ParamDecl' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ParamDecl' a -> m (ParamDecl' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ParamDecl' a -> m (ParamDecl' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ParamDecl' a -> m (ParamDecl' a) # | |||||
Generic (ParamDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
from :: ParamDecl' a -> Rep (ParamDecl' a) x # to :: Rep (ParamDecl' a) x -> ParamDecl' a # | |||||
Read a => Read (ParamDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs readsPrec :: Int -> ReadS (ParamDecl' a) # readList :: ReadS [ParamDecl' a] # readPrec :: ReadPrec (ParamDecl' a) # readListPrec :: ReadPrec [ParamDecl' a] # | |||||
Show a => Show (ParamDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs showsPrec :: Int -> ParamDecl' a -> ShowS # show :: ParamDecl' a -> String # showList :: [ParamDecl' a] -> ShowS # | |||||
Eq a => Eq (ParamDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs (==) :: ParamDecl' a -> ParamDecl' a -> Bool # (/=) :: ParamDecl' a -> ParamDecl' a -> Bool # | |||||
Ord a => Ord (ParamDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs compare :: ParamDecl' a -> ParamDecl' a -> Ordering # (<) :: ParamDecl' a -> ParamDecl' a -> Bool # (<=) :: ParamDecl' a -> ParamDecl' a -> Bool # (>) :: ParamDecl' a -> ParamDecl' a -> Bool # (>=) :: ParamDecl' a -> ParamDecl' a -> Bool # max :: ParamDecl' a -> ParamDecl' a -> ParamDecl' a # min :: ParamDecl' a -> ParamDecl' a -> ParamDecl' a # | |||||
Print (ParamDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
type Rep (ParamDecl' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (ParamDecl' a) = D1 ('MetaData "ParamDecl'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) ((C1 ('MetaCons "ParamType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :+: C1 ('MetaCons "ParamTermType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: (C1 ('MetaCons "ParamTermShape" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: (C1 ('MetaCons "ParamTermTypeDeprecated" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "ParamVarShapeDeprecated" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))))) |
type SigmaParam = SigmaParam' BNFC'Position Source #
data SigmaParam' a Source #
SigmaParam a (Pattern' a) (Term' a) |
Instances
Foldable SigmaParam' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => SigmaParam' m -> m # foldMap :: Monoid m => (a -> m) -> SigmaParam' a -> m # foldMap' :: Monoid m => (a -> m) -> SigmaParam' a -> m # foldr :: (a -> b -> b) -> b -> SigmaParam' a -> b # foldr' :: (a -> b -> b) -> b -> SigmaParam' a -> b # foldl :: (b -> a -> b) -> b -> SigmaParam' a -> b # foldl' :: (b -> a -> b) -> b -> SigmaParam' a -> b # foldr1 :: (a -> a -> a) -> SigmaParam' a -> a # foldl1 :: (a -> a -> a) -> SigmaParam' a -> a # toList :: SigmaParam' a -> [a] # null :: SigmaParam' a -> Bool # length :: SigmaParam' a -> Int # elem :: Eq a => a -> SigmaParam' a -> Bool # maximum :: Ord a => SigmaParam' a -> a # minimum :: Ord a => SigmaParam' a -> a # sum :: Num a => SigmaParam' a -> a # product :: Num a => SigmaParam' a -> a # | |||||
Traversable SigmaParam' Source # | |||||
Defined in Language.Rzk.Syntax.Abs traverse :: Applicative f => (a -> f b) -> SigmaParam' a -> f (SigmaParam' b) # sequenceA :: Applicative f => SigmaParam' (f a) -> f (SigmaParam' a) # mapM :: Monad m => (a -> m b) -> SigmaParam' a -> m (SigmaParam' b) # sequence :: Monad m => SigmaParam' (m a) -> m (SigmaParam' a) # | |||||
Functor SigmaParam' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fmap :: (a -> b) -> SigmaParam' a -> SigmaParam' b # (<$) :: a -> SigmaParam' b -> SigmaParam' a # | |||||
HasPosition SigmaParam Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Data a => Data (SigmaParam' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SigmaParam' a -> c (SigmaParam' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SigmaParam' a) # toConstr :: SigmaParam' a -> Constr # dataTypeOf :: SigmaParam' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SigmaParam' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SigmaParam' a)) # gmapT :: (forall b. Data b => b -> b) -> SigmaParam' a -> SigmaParam' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SigmaParam' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SigmaParam' a -> r # gmapQ :: (forall d. Data d => d -> u) -> SigmaParam' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> SigmaParam' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> SigmaParam' a -> m (SigmaParam' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SigmaParam' a -> m (SigmaParam' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SigmaParam' a -> m (SigmaParam' a) # | |||||
Generic (SigmaParam' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
from :: SigmaParam' a -> Rep (SigmaParam' a) x # to :: Rep (SigmaParam' a) x -> SigmaParam' a # | |||||
Read a => Read (SigmaParam' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs readsPrec :: Int -> ReadS (SigmaParam' a) # readList :: ReadS [SigmaParam' a] # readPrec :: ReadPrec (SigmaParam' a) # readListPrec :: ReadPrec [SigmaParam' a] # | |||||
Show a => Show (SigmaParam' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs showsPrec :: Int -> SigmaParam' a -> ShowS # show :: SigmaParam' a -> String # showList :: [SigmaParam' a] -> ShowS # | |||||
Eq a => Eq (SigmaParam' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs (==) :: SigmaParam' a -> SigmaParam' a -> Bool # (/=) :: SigmaParam' a -> SigmaParam' a -> Bool # | |||||
Ord a => Ord (SigmaParam' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs compare :: SigmaParam' a -> SigmaParam' a -> Ordering # (<) :: SigmaParam' a -> SigmaParam' a -> Bool # (<=) :: SigmaParam' a -> SigmaParam' a -> Bool # (>) :: SigmaParam' a -> SigmaParam' a -> Bool # (>=) :: SigmaParam' a -> SigmaParam' a -> Bool # max :: SigmaParam' a -> SigmaParam' a -> SigmaParam' a # min :: SigmaParam' a -> SigmaParam' a -> SigmaParam' a # | |||||
Print (SigmaParam' a) Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
Print [SigmaParam' a] Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
type Rep (SigmaParam' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (SigmaParam' a) = D1 ('MetaData "SigmaParam'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) (C1 ('MetaCons "SigmaParam" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) |
type Restriction = Restriction' BNFC'Position Source #
data Restriction' a Source #
Restriction a (Term' a) (Term' a) | |
ASCII_Restriction a (Term' a) (Term' a) |
Instances
Foldable Restriction' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => Restriction' m -> m # foldMap :: Monoid m => (a -> m) -> Restriction' a -> m # foldMap' :: Monoid m => (a -> m) -> Restriction' a -> m # foldr :: (a -> b -> b) -> b -> Restriction' a -> b # foldr' :: (a -> b -> b) -> b -> Restriction' a -> b # foldl :: (b -> a -> b) -> b -> Restriction' a -> b # foldl' :: (b -> a -> b) -> b -> Restriction' a -> b # foldr1 :: (a -> a -> a) -> Restriction' a -> a # foldl1 :: (a -> a -> a) -> Restriction' a -> a # toList :: Restriction' a -> [a] # null :: Restriction' a -> Bool # length :: Restriction' a -> Int # elem :: Eq a => a -> Restriction' a -> Bool # maximum :: Ord a => Restriction' a -> a # minimum :: Ord a => Restriction' a -> a # sum :: Num a => Restriction' a -> a # product :: Num a => Restriction' a -> a # | |||||
Traversable Restriction' Source # | |||||
Defined in Language.Rzk.Syntax.Abs traverse :: Applicative f => (a -> f b) -> Restriction' a -> f (Restriction' b) # sequenceA :: Applicative f => Restriction' (f a) -> f (Restriction' a) # mapM :: Monad m => (a -> m b) -> Restriction' a -> m (Restriction' b) # sequence :: Monad m => Restriction' (m a) -> m (Restriction' a) # | |||||
Functor Restriction' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fmap :: (a -> b) -> Restriction' a -> Restriction' b # (<$) :: a -> Restriction' b -> Restriction' a # | |||||
HasPosition Restriction Source # | |||||
Defined in Language.Rzk.Syntax.Abs | |||||
Data a => Data (Restriction' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Restriction' a -> c (Restriction' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Restriction' a) # toConstr :: Restriction' a -> Constr # dataTypeOf :: Restriction' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Restriction' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Restriction' a)) # gmapT :: (forall b. Data b => b -> b) -> Restriction' a -> Restriction' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Restriction' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Restriction' a -> r # gmapQ :: (forall d. Data d => d -> u) -> Restriction' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Restriction' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Restriction' a -> m (Restriction' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Restriction' a -> m (Restriction' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Restriction' a -> m (Restriction' a) # | |||||
Generic (Restriction' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
from :: Restriction' a -> Rep (Restriction' a) x # to :: Rep (Restriction' a) x -> Restriction' a # | |||||
Read a => Read (Restriction' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs readsPrec :: Int -> ReadS (Restriction' a) # readList :: ReadS [Restriction' a] # readPrec :: ReadPrec (Restriction' a) # readListPrec :: ReadPrec [Restriction' a] # | |||||
Show a => Show (Restriction' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs showsPrec :: Int -> Restriction' a -> ShowS # show :: Restriction' a -> String # showList :: [Restriction' a] -> ShowS # | |||||
Eq a => Eq (Restriction' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs (==) :: Restriction' a -> Restriction' a -> Bool # (/=) :: Restriction' a -> Restriction' a -> Bool # | |||||
Ord a => Ord (Restriction' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs compare :: Restriction' a -> Restriction' a -> Ordering # (<) :: Restriction' a -> Restriction' a -> Bool # (<=) :: Restriction' a -> Restriction' a -> Bool # (>) :: Restriction' a -> Restriction' a -> Bool # (>=) :: Restriction' a -> Restriction' a -> Bool # max :: Restriction' a -> Restriction' a -> Restriction' a # min :: Restriction' a -> Restriction' a -> Restriction' a # | |||||
Print (Restriction' a) Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
Print [Restriction' a] Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
type Rep (Restriction' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (Restriction' a) = D1 ('MetaData "Restriction'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) (C1 ('MetaCons "Restriction" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "ASCII_Restriction" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) |
type Term = Term' BNFC'Position Source #
Universe a | |
UniverseCube a | |
UniverseTope a | |
CubeUnit a | |
CubeUnitStar a | |
Cube2 a | |
Cube2_0 a | |
Cube2_1 a | |
CubeProduct a (Term' a) (Term' a) | |
TopeTop a | |
TopeBottom a | |
TopeEQ a (Term' a) (Term' a) | |
TopeLEQ a (Term' a) (Term' a) | |
TopeAnd a (Term' a) (Term' a) | |
TopeOr a (Term' a) (Term' a) | |
RecBottom a | |
RecOr a [Restriction' a] | |
RecOrDeprecated a (Term' a) (Term' a) (Term' a) (Term' a) | |
TypeFun a (ParamDecl' a) (Term' a) | |
TypeSigma a (Pattern' a) (Term' a) (Term' a) | |
TypeSigmaTuple a (SigmaParam' a) [SigmaParam' a] (Term' a) | |
TypeUnit a | |
TypeId a (Term' a) (Term' a) (Term' a) | |
TypeIdSimple a (Term' a) (Term' a) | |
TypeRestricted a (Term' a) [Restriction' a] | |
TypeExtensionDeprecated a (ParamDecl' a) (Term' a) | |
App a (Term' a) (Term' a) | |
Lambda a [Param' a] (Term' a) | |
Pair a (Term' a) (Term' a) | |
Tuple a (Term' a) (Term' a) [Term' a] | |
First a (Term' a) | |
Second a (Term' a) | |
Unit a | |
Refl a | |
ReflTerm a (Term' a) | |
ReflTermType a (Term' a) (Term' a) | |
IdJ a (Term' a) (Term' a) (Term' a) (Term' a) (Term' a) (Term' a) | |
Hole a (HoleIdent' a) | |
Var a (VarIdent' a) | |
TypeAsc a (Term' a) (Term' a) | |
ASCII_CubeUnitStar a | |
ASCII_Cube2_0 a | |
ASCII_Cube2_1 a | |
ASCII_TopeTop a | |
ASCII_TopeBottom a | |
ASCII_TopeEQ a (Term' a) (Term' a) | |
ASCII_TopeLEQ a (Term' a) (Term' a) | |
ASCII_TopeAnd a (Term' a) (Term' a) | |
ASCII_TopeOr a (Term' a) (Term' a) | |
ASCII_TypeFun a (ParamDecl' a) (Term' a) | |
ASCII_TypeSigma a (Pattern' a) (Term' a) (Term' a) | |
ASCII_TypeSigmaTuple a (SigmaParam' a) [SigmaParam' a] (Term' a) | |
ASCII_Lambda a [Param' a] (Term' a) | |
ASCII_TypeExtensionDeprecated a (ParamDecl' a) (Term' a) | |
ASCII_First a (Term' a) | |
ASCII_Second a (Term' a) |
Instances
Foldable Term' Source # | |||||
Defined in Language.Rzk.Syntax.Abs fold :: Monoid m => Term' m -> m # foldMap :: Monoid m => (a -> m) -> Term' a -> m # foldMap' :: Monoid m => (a -> m) -> Term' a -> m # foldr :: (a -> b -> b) -> b -> Term' a -> b # foldr' :: (a -> b -> b) -> b -> Term' a -> b # foldl :: (b -> a -> b) -> b -> Term' a -> b # foldl' :: (b -> a -> b) -> b -> Term' a -> b # foldr1 :: (a -> a -> a) -> Term' a -> a # foldl1 :: (a -> a -> a) -> Term' a -> a # elem :: Eq a => a -> Term' a -> Bool # maximum :: Ord a => Term' a -> a # minimum :: Ord a => Term' a -> a # | |||||
Traversable Term' Source # | |||||
Functor Term' Source # | |||||
HasPosition Term Source # | |||||
Defined in Language.Rzk.Syntax.Abs hasPosition :: Term -> BNFC'Position Source # | |||||
Data a => Data (Term' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Term' a -> c (Term' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Term' a) # toConstr :: Term' a -> Constr # dataTypeOf :: Term' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Term' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Term' a)) # gmapT :: (forall b. Data b => b -> b) -> Term' a -> Term' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Term' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Term' a -> r # gmapQ :: (forall d. Data d => d -> u) -> Term' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Term' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Term' a -> m (Term' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Term' a -> m (Term' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Term' a -> m (Term' a) # | |||||
Generic (Term' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs
| |||||
Read a => Read (Term' a) Source # | |||||
Show a => Show (Term' a) Source # | |||||
Eq a => Eq (Term' a) Source # | |||||
Ord a => Ord (Term' a) Source # | |||||
Print (Term' a) Source # | |||||
Print [Term' a] Source # | |||||
type Rep (Term' a) Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep (Term' a) = D1 ('MetaData "Term'" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'False) (((((C1 ('MetaCons "Universe" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: (C1 ('MetaCons "UniverseCube" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "UniverseTope" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))) :+: ((C1 ('MetaCons "CubeUnit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "CubeUnitStar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))) :+: (C1 ('MetaCons "Cube2" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Cube2_0" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))))) :+: ((C1 ('MetaCons "Cube2_1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: (C1 ('MetaCons "CubeProduct" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "TopeTop" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))) :+: ((C1 ('MetaCons "TopeBottom" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "TopeEQ" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: (C1 ('MetaCons "TopeLEQ" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "TopeAnd" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))))))) :+: (((C1 ('MetaCons "TopeOr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: (C1 ('MetaCons "RecBottom" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "RecOr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Restriction' a])))) :+: ((C1 ('MetaCons "RecOrDeprecated" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: C1 ('MetaCons "TypeFun" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParamDecl' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: (C1 ('MetaCons "TypeSigma" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "TypeSigmaTuple" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (SigmaParam' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [SigmaParam' a]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))))) :+: ((C1 ('MetaCons "TypeUnit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: (C1 ('MetaCons "TypeId" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "TypeIdSimple" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))))) :+: ((C1 ('MetaCons "TypeRestricted" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Restriction' a]))) :+: C1 ('MetaCons "TypeExtensionDeprecated" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParamDecl' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: (C1 ('MetaCons "App" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "Lambda" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Param' a]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))))))) :+: ((((C1 ('MetaCons "Pair" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: (C1 ('MetaCons "Tuple" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Term' a]))) :+: C1 ('MetaCons "First" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: ((C1 ('MetaCons "Second" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :+: C1 ('MetaCons "Unit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))) :+: (C1 ('MetaCons "Refl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "ReflTerm" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))))) :+: ((C1 ('MetaCons "ReflTermType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: (C1 ('MetaCons "IdJ" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :*: ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: C1 ('MetaCons "Hole" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HoleIdent' a))))) :+: ((C1 ('MetaCons "Var" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (VarIdent' a))) :+: C1 ('MetaCons "TypeAsc" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: (C1 ('MetaCons "ASCII_CubeUnitStar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "ASCII_Cube2_0" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))))) :+: (((C1 ('MetaCons "ASCII_Cube2_1" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: (C1 ('MetaCons "ASCII_TopeTop" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "ASCII_TopeBottom" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))) :+: ((C1 ('MetaCons "ASCII_TopeEQ" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "ASCII_TopeLEQ" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: (C1 ('MetaCons "ASCII_TopeAnd" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "ASCII_TopeOr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))))) :+: ((C1 ('MetaCons "ASCII_TypeFun" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParamDecl' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: (C1 ('MetaCons "ASCII_TypeSigma" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pattern' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "ASCII_TypeSigmaTuple" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (SigmaParam' a))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [SigmaParam' a]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))))) :+: ((C1 ('MetaCons "ASCII_Lambda" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Param' a]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a)))) :+: C1 ('MetaCons "ASCII_TypeExtensionDeprecated" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ParamDecl' a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))) :+: (C1 ('MetaCons "ASCII_First" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))) :+: C1 ('MetaCons "ASCII_Second" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Term' a))))))))) |
commandPostulateNoParams :: a -> VarIdent' a -> DeclUsedVars' a -> Term' a -> Command' a Source #
commandDefineNoParams :: a -> VarIdent' a -> DeclUsedVars' a -> Term' a -> Term' a -> Command' a Source #
commandDef :: a -> VarIdent' a -> DeclUsedVars' a -> [Param' a] -> Term' a -> Term' a -> Command' a Source #
commandDefNoParams :: a -> VarIdent' a -> DeclUsedVars' a -> Term' a -> Term' a -> Command' a Source #
noDeclUsedVars :: a -> DeclUsedVars' a Source #
paramVarShapeDeprecated :: a -> Pattern' a -> Term' a -> Term' a -> ParamDecl' a Source #
unicode_TypeSigmaTupleAlt :: a -> SigmaParam' a -> [SigmaParam' a] -> Term' a -> Term' a Source #
newtype VarIdentToken Source #
Instances
Data VarIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> VarIdentToken -> c VarIdentToken # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c VarIdentToken # toConstr :: VarIdentToken -> Constr # dataTypeOf :: VarIdentToken -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c VarIdentToken) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c VarIdentToken) # gmapT :: (forall b. Data b => b -> b) -> VarIdentToken -> VarIdentToken # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> VarIdentToken -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> VarIdentToken -> r # gmapQ :: (forall d. Data d => d -> u) -> VarIdentToken -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> VarIdentToken -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> VarIdentToken -> m VarIdentToken # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> VarIdentToken -> m VarIdentToken # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> VarIdentToken -> m VarIdentToken # | |||||
IsString VarIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs fromString :: String -> VarIdentToken # | |||||
Generic VarIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs
from :: VarIdentToken -> Rep VarIdentToken x # to :: Rep VarIdentToken x -> VarIdentToken # | |||||
Read VarIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs readsPrec :: Int -> ReadS VarIdentToken # readList :: ReadS [VarIdentToken] # | |||||
Show VarIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs showsPrec :: Int -> VarIdentToken -> ShowS # show :: VarIdentToken -> String # showList :: [VarIdentToken] -> ShowS # | |||||
Eq VarIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs (==) :: VarIdentToken -> VarIdentToken -> Bool # (/=) :: VarIdentToken -> VarIdentToken -> Bool # | |||||
Ord VarIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs compare :: VarIdentToken -> VarIdentToken -> Ordering # (<) :: VarIdentToken -> VarIdentToken -> Bool # (<=) :: VarIdentToken -> VarIdentToken -> Bool # (>) :: VarIdentToken -> VarIdentToken -> Bool # (>=) :: VarIdentToken -> VarIdentToken -> Bool # max :: VarIdentToken -> VarIdentToken -> VarIdentToken # min :: VarIdentToken -> VarIdentToken -> VarIdentToken # | |||||
Print VarIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
type Rep VarIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep VarIdentToken = D1 ('MetaData "VarIdentToken" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'True) (C1 ('MetaCons "VarIdentToken" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) |
newtype HoleIdentToken Source #
Instances
Data HoleIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HoleIdentToken -> c HoleIdentToken # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HoleIdentToken # toConstr :: HoleIdentToken -> Constr # dataTypeOf :: HoleIdentToken -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HoleIdentToken) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HoleIdentToken) # gmapT :: (forall b. Data b => b -> b) -> HoleIdentToken -> HoleIdentToken # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HoleIdentToken -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HoleIdentToken -> r # gmapQ :: (forall d. Data d => d -> u) -> HoleIdentToken -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HoleIdentToken -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HoleIdentToken -> m HoleIdentToken # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HoleIdentToken -> m HoleIdentToken # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HoleIdentToken -> m HoleIdentToken # | |||||
IsString HoleIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs fromString :: String -> HoleIdentToken # | |||||
Generic HoleIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs
from :: HoleIdentToken -> Rep HoleIdentToken x # to :: Rep HoleIdentToken x -> HoleIdentToken # | |||||
Read HoleIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs readsPrec :: Int -> ReadS HoleIdentToken # readList :: ReadS [HoleIdentToken] # | |||||
Show HoleIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs showsPrec :: Int -> HoleIdentToken -> ShowS # show :: HoleIdentToken -> String # showList :: [HoleIdentToken] -> ShowS # | |||||
Eq HoleIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs (==) :: HoleIdentToken -> HoleIdentToken -> Bool # (/=) :: HoleIdentToken -> HoleIdentToken -> Bool # | |||||
Ord HoleIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs compare :: HoleIdentToken -> HoleIdentToken -> Ordering # (<) :: HoleIdentToken -> HoleIdentToken -> Bool # (<=) :: HoleIdentToken -> HoleIdentToken -> Bool # (>) :: HoleIdentToken -> HoleIdentToken -> Bool # (>=) :: HoleIdentToken -> HoleIdentToken -> Bool # max :: HoleIdentToken -> HoleIdentToken -> HoleIdentToken # min :: HoleIdentToken -> HoleIdentToken -> HoleIdentToken # | |||||
Print HoleIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Print | |||||
type Rep HoleIdentToken Source # | |||||
Defined in Language.Rzk.Syntax.Abs type Rep HoleIdentToken = D1 ('MetaData "HoleIdentToken" "Language.Rzk.Syntax.Abs" "rzk-0.7.5-2k0cYpS02nKCw40wUv8U5n" 'True) (C1 ('MetaCons "HoleIdentToken" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) |
pattern BNFC'NoPosition :: BNFC'Position Source #
pattern BNFC'Position :: Int -> Int -> BNFC'Position Source #
class HasPosition a where Source #
Get the start position of something.
hasPosition :: a -> BNFC'Position Source #
Instances
HasPosition Command Source # | |
Defined in Language.Rzk.Syntax.Abs hasPosition :: Command -> BNFC'Position Source # | |
HasPosition DeclUsedVars Source # | |
Defined in Language.Rzk.Syntax.Abs | |
HasPosition HoleIdent Source # | |
Defined in Language.Rzk.Syntax.Abs hasPosition :: HoleIdent -> BNFC'Position Source # | |
HasPosition Language Source # | |
Defined in Language.Rzk.Syntax.Abs hasPosition :: Language -> BNFC'Position Source # | |
HasPosition LanguageDecl Source # | |
Defined in Language.Rzk.Syntax.Abs | |
HasPosition Module Source # | |
Defined in Language.Rzk.Syntax.Abs hasPosition :: Module -> BNFC'Position Source # | |
HasPosition Param Source # | |
Defined in Language.Rzk.Syntax.Abs hasPosition :: Param -> BNFC'Position Source # | |
HasPosition ParamDecl Source # | |
Defined in Language.Rzk.Syntax.Abs hasPosition :: ParamDecl -> BNFC'Position Source # | |
HasPosition Pattern Source # | |
Defined in Language.Rzk.Syntax.Abs hasPosition :: Pattern -> BNFC'Position Source # | |
HasPosition Restriction Source # | |
Defined in Language.Rzk.Syntax.Abs | |
HasPosition SectionName Source # | |
Defined in Language.Rzk.Syntax.Abs | |
HasPosition SigmaParam Source # | |
Defined in Language.Rzk.Syntax.Abs | |
HasPosition Term Source # | |
Defined in Language.Rzk.Syntax.Abs hasPosition :: Term -> BNFC'Position Source # | |
HasPosition VarIdent Source # | |
Defined in Language.Rzk.Syntax.Abs hasPosition :: VarIdent -> BNFC'Position Source # |