Language.Oberon.Abstract

Finally Tagless Abstract Syntax Tree definitions for the programming language Oberon

Language classes

class Wirthy l where

The finally-tagless associated types and methods relevant to all programming languages designed by Niklaus Wirth. Every non-leaf node type has four type variables:

• type variable l represents the language of the constructs built by the methods,
• l' is the language of the child node constructs,
• f' wraps all descendant nodes, except
• f wraps all direct children of the node.

Associated Types

type Module l = (m :: * -> (* -> *) -> (* -> *) -> *) | m -> l

type Declaration l = (d :: * -> (* -> *) -> (* -> *) -> *) | d -> l

type Type l = (t :: * -> (* -> *) -> (* -> *) -> *) | t -> l

type Statement l = (s :: * -> (* -> *) -> (* -> *) -> *) | s -> l

type Expression l = (e :: * -> (* -> *) -> (* -> *) -> *) | e -> l

type Designator l = (d :: * -> (* -> *) -> (* -> *) -> *) | d -> l

type Value l = (v :: * -> (* -> *) -> (* -> *) -> *) | v -> l

type FieldList l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type ProcedureHeading l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type FormalParameters l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type FPSection l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type Block l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type StatementSequence l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type Case l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type CaseLabels l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type ConditionalBranch l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type Element l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

type Import l = x | x -> l

type IdentDef l = x | x -> l

type QualIdent l = x | x -> l

Methods

constantDeclaration :: IdentDef l' -> f (ConstExpression l' l' f' f') -> Declaration l l' f' f

typeDeclaration :: IdentDef l' -> f (Type l' l' f' f') -> Declaration l l' f' f

variableDeclaration :: IdentList l' -> f (Type l' l' f' f') -> Declaration l l' f' f

procedureDeclaration :: f (ProcedureHeading l' l' f' f') -> f (Block l' l' f' f') -> Declaration l l' f' f

formalParameters :: [f (FPSection l' l' f' f')] -> Maybe (ReturnType l') -> FormalParameters l l' f' f

fpSection :: Bool -> [Ident] -> f (Type l' l' f' f') -> FPSection l l' f' f

block :: [f (Declaration l' l' f' f')] -> Maybe (f (StatementSequence l' l' f' f')) -> Block l l' f' f

fieldList :: NonEmpty (IdentDef l') -> f (Type l' l' f' f') -> FieldList l l' f' f

pointerType :: f (Type l' l' f' f') -> Type l l' f' f

procedureType :: Maybe (f (FormalParameters l' l' f' f')) -> Type l l' f' f

typeReference :: QualIdent l' -> Type l l' f' f

assignment :: f (Designator l' l' f' f') -> f (Expression l' l' f' f') -> Statement l l' f' f

caseStatement :: f (Expression l' l' f' f') -> [f (Case l' l' f' f')] -> Maybe (f (StatementSequence l' l' f' f')) -> Statement l l' f' f

emptyStatement :: Statement l l' f' f

exitStatement :: Statement l l' f' f

ifStatement :: NonEmpty (f (ConditionalBranch l' l' f' f')) -> Maybe (f (StatementSequence l' l' f' f')) -> Statement l l' f' f

loopStatement :: f (StatementSequence l' l' f' f') -> Statement l l' f' f

procedureCall :: f (Designator l' l' f' f') -> Maybe [f (Expression l' l' f' f')] -> Statement l l' f' f

repeatStatement :: f (StatementSequence l' l' f' f') -> f (Expression l' l' f' f') -> Statement l l' f' f

returnStatement :: Maybe (f (Expression l' l' f' f')) -> Statement l l' f' f

whileStatement :: f (Expression l' l' f' f') -> f (StatementSequence l' l' f' f') -> Statement l l' f' f

conditionalBranch :: f (Expression l' l' f' f') -> f (StatementSequence l' l' f' f') -> ConditionalBranch l l' f' f

caseAlternative :: NonEmpty (f (CaseLabels l' l' f' f')) -> f (StatementSequence l' l' f' f') -> Case l l' f' f

singleLabel :: f (ConstExpression l' l' f' f') -> CaseLabels l l' f' f

labelRange :: f (ConstExpression l' l' f' f') -> f (ConstExpression l' l' f' f') -> CaseLabels l l' f' f

statementSequence :: [f (Statement l' l' f' f')] -> StatementSequence l l' f' f

add :: f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression l l' f' f

subtract :: f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression l l' f' f

and :: f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression l l' f' f

or :: f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression l l' f' f

divide :: f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression l l' f' f

integerDivide :: f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression l l' f' f

modulo :: f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression l l' f' f

multiply :: f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression l l' f' f

functionCall :: f (Designator l' l' f' f') -> [f (Expression l' l' f' f')] -> Expression l l' f' f

literal :: f (Value l' l' f' f') -> Expression l l' f' f

negative :: f (Expression l' l' f' f') -> Expression l l' f' f

positive :: f (Expression l' l' f' f') -> Expression l l' f' f

not :: f (Expression l' l' f' f') -> Expression l l' f' f

read :: f (Designator l' l' f' f') -> Expression l l' f' f

relation :: RelOp -> f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression l l' f' f

element :: f (Expression l' l' f' f') -> Element l l' f' f

range :: f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Element l l' f' f

integer :: Integer -> Value l l' f' f

nil :: Value l l' f' f

false :: Value l l' f' f

true :: Value l l' f' f

real :: Double -> Value l l' f' f

string :: Text -> Value l l' f' f

charCode :: Int -> Value l l' f' f

builtin :: Text -> Value l l' f' f

variable :: QualIdent l' -> Designator l l' f' f

field :: f (Designator l' l' f' f') -> Ident -> Designator l l' f' f

index :: f (Designator l' l' f' f') -> NonEmpty (f (Expression l' l' f' f')) -> Designator l l' f' f

dereference :: f (Designator l' l' f' f') -> Designator l l' f' f

identDef :: Ident -> IdentDef l

nonQualIdent :: Ident -> QualIdent l

Instances

Wirthy Language

Defined in Language.Oberon.AST

Associated Types

type Module Language = (m :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Declaration Language = (d :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Type Language = (t :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Statement Language = (s :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Expression Language = (e :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Designator Language = (d :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Value Language = (v :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type FieldList Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type ProcedureHeading Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type FormalParameters Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type FPSection Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Block Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type StatementSequence Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Case Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type CaseLabels Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type ConditionalBranch Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Element Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Import Language = (x :: Type)

type IdentDef Language = (x :: Type)

type QualIdent Language = (x :: Type)

Methods

constantDeclaration :: forall l' f (f' :: Type -> Type). IdentDef l' -> f (ConstExpression l' l' f' f') -> Declaration Language l' f' f

typeDeclaration :: forall l' f (f' :: Type -> Type). IdentDef l' -> f (Type l' l' f' f') -> Declaration Language l' f' f

variableDeclaration :: forall l' f (f' :: Type -> Type). IdentList l' -> f (Type l' l' f' f') -> Declaration Language l' f' f

procedureDeclaration :: forall f l' (f' :: Type -> Type). f (ProcedureHeading l' l' f' f') -> f (Block l' l' f' f') -> Declaration Language l' f' f

formalParameters :: forall f l' (f' :: Type -> Type). [f (FPSection l' l' f' f')] -> Maybe (ReturnType l') -> FormalParameters Language l' f' f

fpSection :: forall f l' (f' :: Type -> Type). Bool -> [Ident] -> f (Type l' l' f' f') -> FPSection Language l' f' f

block :: forall f l' (f' :: Type -> Type). [f (Declaration l' l' f' f')] -> Maybe (f (StatementSequence l' l' f' f')) -> Block Language l' f' f

fieldList :: forall l' f (f' :: Type -> Type). NonEmpty (IdentDef l') -> f (Type l' l' f' f') -> FieldList Language l' f' f

pointerType :: forall f l' (f' :: Type -> Type). f (Type l' l' f' f') -> Type Language l' f' f

procedureType :: forall f l' (f' :: Type -> Type). Maybe (f (FormalParameters l' l' f' f')) -> Type Language l' f' f

typeReference :: forall l' (f' :: Type -> Type) (f :: Type -> Type). QualIdent l' -> Type Language l' f' f

assignment :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> f (Expression l' l' f' f') -> Statement Language l' f' f

caseStatement :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> [f (Case l' l' f' f')] -> Maybe (f (StatementSequence l' l' f' f')) -> Statement Language l' f' f

emptyStatement :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Statement Language l' f' f

exitStatement :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Statement Language l' f' f

ifStatement :: forall f l' (f' :: Type -> Type). NonEmpty (f (ConditionalBranch l' l' f' f')) -> Maybe (f (StatementSequence l' l' f' f')) -> Statement Language l' f' f

loopStatement :: forall f l' (f' :: Type -> Type). f (StatementSequence l' l' f' f') -> Statement Language l' f' f

procedureCall :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Maybe [f (Expression l' l' f' f')] -> Statement Language l' f' f

repeatStatement :: forall f l' (f' :: Type -> Type). f (StatementSequence l' l' f' f') -> f (Expression l' l' f' f') -> Statement Language l' f' f

returnStatement :: forall f l' (f' :: Type -> Type). Maybe (f (Expression l' l' f' f')) -> Statement Language l' f' f

whileStatement :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (StatementSequence l' l' f' f') -> Statement Language l' f' f

conditionalBranch :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (StatementSequence l' l' f' f') -> ConditionalBranch Language l' f' f

caseAlternative :: forall f l' (f' :: Type -> Type). NonEmpty (f (CaseLabels l' l' f' f')) -> f (StatementSequence l' l' f' f') -> Case Language l' f' f

singleLabel :: forall f l' (f' :: Type -> Type). f (ConstExpression l' l' f' f') -> CaseLabels Language l' f' f

labelRange :: forall f l' (f' :: Type -> Type). f (ConstExpression l' l' f' f') -> f (ConstExpression l' l' f' f') -> CaseLabels Language l' f' f

statementSequence :: forall f l' (f' :: Type -> Type). [f (Statement l' l' f' f')] -> StatementSequence Language l' f' f

add :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression Language l' f' f

subtract :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression Language l' f' f

and :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression Language l' f' f

or :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression Language l' f' f

divide :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression Language l' f' f

integerDivide :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression Language l' f' f

modulo :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression Language l' f' f

multiply :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression Language l' f' f

functionCall :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> [f (Expression l' l' f' f')] -> Expression Language l' f' f

literal :: forall f l' (f' :: Type -> Type). f (Value l' l' f' f') -> Expression Language l' f' f

negative :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Expression Language l' f' f

positive :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Expression Language l' f' f

not :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Expression Language l' f' f

read :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Expression Language l' f' f

relation :: forall f l' (f' :: Type -> Type). RelOp -> f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression Language l' f' f

element :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Element Language l' f' f

range :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Element Language l' f' f

integer :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Integer -> Value Language l' f' f

nil :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Value Language l' f' f

false :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Value Language l' f' f

true :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Value Language l' f' f

real :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Double -> Value Language l' f' f

string :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Text -> Value Language l' f' f

charCode :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Int -> Value Language l' f' f

builtin :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Text -> Value Language l' f' f

variable :: forall l' (f' :: Type -> Type) (f :: Type -> Type). QualIdent l' -> Designator Language l' f' f

field :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Ident -> Designator Language l' f' f

index :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> NonEmpty (f (Expression l' l' f' f')) -> Designator Language l' f' f

dereference :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Designator Language l' f' f

identDef :: Ident -> IdentDef Language

nonQualIdent :: Ident -> QualIdent Language

Wirthy l => Wirthy (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

Associated Types

type Module (WirthySubsetOf l) = (m :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Declaration (WirthySubsetOf l) = (d :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Type (WirthySubsetOf l) = (t :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Statement (WirthySubsetOf l) = (s :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Expression (WirthySubsetOf l) = (e :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Designator (WirthySubsetOf l) = (d :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Value (WirthySubsetOf l) = (v :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type FieldList (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type ProcedureHeading (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type FormalParameters (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type FPSection (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Block (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type StatementSequence (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Case (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type CaseLabels (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type ConditionalBranch (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Element (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Import (WirthySubsetOf l) = (x :: Type)

type IdentDef (WirthySubsetOf l) = (x :: Type)

type QualIdent (WirthySubsetOf l) = (x :: Type)

Methods

constantDeclaration :: forall l' f (f' :: Type -> Type). IdentDef l' -> f (ConstExpression l' l' f' f') -> Declaration (WirthySubsetOf l) l' f' f

typeDeclaration :: forall l' f (f' :: Type -> Type). IdentDef l' -> f (Type l' l' f' f') -> Declaration (WirthySubsetOf l) l' f' f

variableDeclaration :: forall l' f (f' :: Type -> Type). IdentList l' -> f (Type l' l' f' f') -> Declaration (WirthySubsetOf l) l' f' f

procedureDeclaration :: forall f l' (f' :: Type -> Type). f (ProcedureHeading l' l' f' f') -> f (Block l' l' f' f') -> Declaration (WirthySubsetOf l) l' f' f

formalParameters :: forall f l' (f' :: Type -> Type). [f (FPSection l' l' f' f')] -> Maybe (ReturnType l') -> FormalParameters (WirthySubsetOf l) l' f' f

fpSection :: forall f l' (f' :: Type -> Type). Bool -> [Ident] -> f (Type l' l' f' f') -> FPSection (WirthySubsetOf l) l' f' f

block :: forall f l' (f' :: Type -> Type). [f (Declaration l' l' f' f')] -> Maybe (f (StatementSequence l' l' f' f')) -> Block (WirthySubsetOf l) l' f' f

fieldList :: forall l' f (f' :: Type -> Type). NonEmpty (IdentDef l') -> f (Type l' l' f' f') -> FieldList (WirthySubsetOf l) l' f' f

pointerType :: forall f l' (f' :: Type -> Type). f (Type l' l' f' f') -> Type (WirthySubsetOf l) l' f' f

procedureType :: forall f l' (f' :: Type -> Type). Maybe (f (FormalParameters l' l' f' f')) -> Type (WirthySubsetOf l) l' f' f

typeReference :: forall l' (f' :: Type -> Type) (f :: Type -> Type). QualIdent l' -> Type (WirthySubsetOf l) l' f' f

assignment :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> f (Expression l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

caseStatement :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> [f (Case l' l' f' f')] -> Maybe (f (StatementSequence l' l' f' f')) -> Statement (WirthySubsetOf l) l' f' f

emptyStatement :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Statement (WirthySubsetOf l) l' f' f

exitStatement :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Statement (WirthySubsetOf l) l' f' f

ifStatement :: forall f l' (f' :: Type -> Type). NonEmpty (f (ConditionalBranch l' l' f' f')) -> Maybe (f (StatementSequence l' l' f' f')) -> Statement (WirthySubsetOf l) l' f' f

loopStatement :: forall f l' (f' :: Type -> Type). f (StatementSequence l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

procedureCall :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Maybe [f (Expression l' l' f' f')] -> Statement (WirthySubsetOf l) l' f' f

repeatStatement :: forall f l' (f' :: Type -> Type). f (StatementSequence l' l' f' f') -> f (Expression l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

returnStatement :: forall f l' (f' :: Type -> Type). Maybe (f (Expression l' l' f' f')) -> Statement (WirthySubsetOf l) l' f' f

whileStatement :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (StatementSequence l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

conditionalBranch :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (StatementSequence l' l' f' f') -> ConditionalBranch (WirthySubsetOf l) l' f' f

caseAlternative :: forall f l' (f' :: Type -> Type). NonEmpty (f (CaseLabels l' l' f' f')) -> f (StatementSequence l' l' f' f') -> Case (WirthySubsetOf l) l' f' f

singleLabel :: forall f l' (f' :: Type -> Type). f (ConstExpression l' l' f' f') -> CaseLabels (WirthySubsetOf l) l' f' f

labelRange :: forall f l' (f' :: Type -> Type). f (ConstExpression l' l' f' f') -> f (ConstExpression l' l' f' f') -> CaseLabels (WirthySubsetOf l) l' f' f

statementSequence :: forall f l' (f' :: Type -> Type). [f (Statement l' l' f' f')] -> StatementSequence (WirthySubsetOf l) l' f' f

add :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

subtract :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

and :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

or :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

divide :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

integerDivide :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

modulo :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

multiply :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

functionCall :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> [f (Expression l' l' f' f')] -> Expression (WirthySubsetOf l) l' f' f

literal :: forall f l' (f' :: Type -> Type). f (Value l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

negative :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

positive :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

not :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

read :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

relation :: forall f l' (f' :: Type -> Type). RelOp -> f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

element :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Element (WirthySubsetOf l) l' f' f

range :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Element (WirthySubsetOf l) l' f' f

integer :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Integer -> Value (WirthySubsetOf l) l' f' f

nil :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Value (WirthySubsetOf l) l' f' f

false :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Value (WirthySubsetOf l) l' f' f

true :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Value (WirthySubsetOf l) l' f' f

real :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Double -> Value (WirthySubsetOf l) l' f' f

string :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Text -> Value (WirthySubsetOf l) l' f' f

charCode :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Int -> Value (WirthySubsetOf l) l' f' f

builtin :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Text -> Value (WirthySubsetOf l) l' f' f

variable :: forall l' (f' :: Type -> Type) (f :: Type -> Type). QualIdent l' -> Designator (WirthySubsetOf l) l' f' f

field :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Ident -> Designator (WirthySubsetOf l) l' f' f

index :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> NonEmpty (f (Expression l' l' f' f')) -> Designator (WirthySubsetOf l) l' f' f

dereference :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Designator (WirthySubsetOf l) l' f' f

identDef :: Ident -> IdentDef (WirthySubsetOf l)

nonQualIdent :: Ident -> QualIdent (WirthySubsetOf l)

class Wirthy l => CoWirthy l where

An instance of this type can convert its own constructs to another language that's an instance of TargetClass.

Associated Types

type TargetClass l :: * -> Constraint

type TargetClass l = Wirthy

Methods

coDeclaration :: TargetClass l l' => Declaration l l'' f' f -> Declaration l' l'' f' f

coType :: TargetClass l l' => Type l l'' f' f -> Type l' l'' f' f

coStatement :: TargetClass l l' => Statement l l'' f' f -> Statement l' l'' f' f

coExpression :: TargetClass l l' => Expression l l'' f' f -> Expression l' l'' f' f

coDesignator :: TargetClass l l' => Designator l l'' f' f -> Designator l' l'' f' f

coValue :: TargetClass l l' => Value l l'' f' f -> Value l' l'' f' f

Instances

CoWirthy Language

Defined in Language.Oberon.AST

Associated Types

type TargetClass Language :: Type -> Constraint

Methods

coDeclaration :: forall l' l'' (f' :: Type -> Type) (f :: Type -> Type). TargetClass Language l' => Declaration Language l'' f' f -> Declaration l' l'' f' f

coType :: forall l' l'' (f' :: Type -> Type) (f :: Type -> Type). TargetClass Language l' => Type Language l'' f' f -> Type l' l'' f' f

coStatement :: forall l' l'' (f' :: Type -> Type) (f :: Type -> Type). TargetClass Language l' => Statement Language l'' f' f -> Statement l' l'' f' f

coExpression :: forall l' l'' (f' :: Type -> Type) (f :: Type -> Type). TargetClass Language l' => Expression Language l'' f' f -> Expression l' l'' f' f

coDesignator :: forall l' l'' (f' :: Type -> Type) (f :: Type -> Type). TargetClass Language l' => Designator Language l'' f' f -> Designator l' l'' f' f

coValue :: forall l' l'' (f' :: Type -> Type) (f :: Type -> Type). TargetClass Language l' => Value Language l'' f' f -> Value l' l'' f' f

class Wirthy l => Oberon l where

The finally-tagless associated types and methods relevant to both versions of the Oberon language.

Associated Types

type WithAlternative l = (x :: * -> (* -> *) -> (* -> *) -> *) | x -> l

Methods

moduleUnit :: Ident -> [Import l] -> f (Block l' l' f' f') -> Module l l' f' f

moduleImport :: Maybe Ident -> Ident -> Import l

qualIdent :: Ident -> Ident -> QualIdent l

getQualIdentNames :: QualIdent l -> Maybe (Ident, Ident)

exported :: Ident -> IdentDef l

forwardDeclaration :: IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> Declaration l l' f' f

procedureHeading :: Bool -> IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> ProcedureHeading l l' f' f

arrayType :: [f (ConstExpression l' l' f' f')] -> f (Type l' l' f' f') -> Type l l' f' f

recordType :: Maybe (BaseType l') -> [f (FieldList l' l' f' f')] -> Type l l' f' f

withStatement :: f (WithAlternative l' l' f' f') -> Statement l l' f' f

withAlternative :: QualIdent l' -> QualIdent l' -> f (StatementSequence l' l' f' f') -> WithAlternative l l' f' f

is :: f (Expression l' l' f' f') -> QualIdent l' -> Expression l l' f' f

set :: [f (Element l' l' f' f')] -> Expression l l' f' f

typeGuard :: f (Designator l' l' f' f') -> QualIdent l' -> Designator l l' f' f

Instances

Oberon Language

Defined in Language.Oberon.AST

Associated Types

type WithAlternative Language = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

Methods

moduleUnit :: forall f l' (f' :: Type -> Type). Ident -> [Import Language] -> f (Block l' l' f' f') -> Module Language l' f' f

moduleImport :: Maybe Ident -> Ident -> Import Language

qualIdent :: Ident -> Ident -> QualIdent Language

getQualIdentNames :: QualIdent Language -> Maybe (Ident, Ident)

exported :: Ident -> IdentDef Language

forwardDeclaration :: forall l' f (f' :: Type -> Type). IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> Declaration Language l' f' f

procedureHeading :: forall l' f (f' :: Type -> Type). Bool -> IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> ProcedureHeading Language l' f' f

arrayType :: forall f l' (f' :: Type -> Type). [f (ConstExpression l' l' f' f')] -> f (Type l' l' f' f') -> Type Language l' f' f

recordType :: forall l' f (f' :: Type -> Type). Maybe (BaseType l') -> [f (FieldList l' l' f' f')] -> Type Language l' f' f

withStatement :: forall f l' (f' :: Type -> Type). f (WithAlternative l' l' f' f') -> Statement Language l' f' f

withAlternative :: forall l' f (f' :: Type -> Type). QualIdent l' -> QualIdent l' -> f (StatementSequence l' l' f' f') -> WithAlternative Language l' f' f

is :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> QualIdent l' -> Expression Language l' f' f

set :: forall f l' (f' :: Type -> Type). [f (Element l' l' f' f')] -> Expression Language l' f' f

typeGuard :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> QualIdent l' -> Designator Language l' f' f

Wirthy l => Oberon (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

Associated Types

type WithAlternative (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

Methods

moduleUnit :: forall f l' (f' :: Type -> Type). Ident -> [Import (WirthySubsetOf l)] -> f (Block l' l' f' f') -> Module (WirthySubsetOf l) l' f' f

moduleImport :: Maybe Ident -> Ident -> Import (WirthySubsetOf l)

qualIdent :: Ident -> Ident -> QualIdent (WirthySubsetOf l)

getQualIdentNames :: QualIdent (WirthySubsetOf l) -> Maybe (Ident, Ident)

exported :: Ident -> IdentDef (WirthySubsetOf l)

forwardDeclaration :: forall l' f (f' :: Type -> Type). IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> Declaration (WirthySubsetOf l) l' f' f

procedureHeading :: forall l' f (f' :: Type -> Type). Bool -> IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> ProcedureHeading (WirthySubsetOf l) l' f' f

arrayType :: forall f l' (f' :: Type -> Type). [f (ConstExpression l' l' f' f')] -> f (Type l' l' f' f') -> Type (WirthySubsetOf l) l' f' f

recordType :: forall l' f (f' :: Type -> Type). Maybe (BaseType l') -> [f (FieldList l' l' f' f')] -> Type (WirthySubsetOf l) l' f' f

withStatement :: forall f l' (f' :: Type -> Type). f (WithAlternative l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

withAlternative :: forall l' f (f' :: Type -> Type). QualIdent l' -> QualIdent l' -> f (StatementSequence l' l' f' f') -> WithAlternative (WirthySubsetOf l) l' f' f

is :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> QualIdent l' -> Expression (WirthySubsetOf l) l' f' f

set :: forall f l' (f' :: Type -> Type). [f (Element l' l' f' f')] -> Expression (WirthySubsetOf l) l' f' f

typeGuard :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> QualIdent l' -> Designator (WirthySubsetOf l) l' f' f

class Oberon l => Oberon2 l where

The finally-tagless associated types and methods relevant to the Oberon 2 language.

Methods

readOnly :: Ident -> IdentDef l

typeBoundHeading :: Bool -> Ident -> Ident -> Bool -> IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> ProcedureHeading l l' f' f

forStatement :: Ident -> f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Maybe (f (Expression l' l' f' f')) -> f (StatementSequence l' l' f' f') -> Statement l l' f' f

variantWithStatement :: NonEmpty (f (WithAlternative l' l' f' f')) -> Maybe (f (StatementSequence l' l' f' f')) -> Statement l l' f' f

Instances

Oberon2 Language

Defined in Language.Oberon.AST

Methods

readOnly :: Ident -> IdentDef Language

typeBoundHeading :: forall l' f (f' :: Type -> Type). Bool -> Ident -> Ident -> Bool -> IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> ProcedureHeading Language l' f' f

forStatement :: forall f l' (f' :: Type -> Type). Ident -> f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Maybe (f (Expression l' l' f' f')) -> f (StatementSequence l' l' f' f') -> Statement Language l' f' f

variantWithStatement :: forall f l' (f' :: Type -> Type). NonEmpty (f (WithAlternative l' l' f' f')) -> Maybe (f (StatementSequence l' l' f' f')) -> Statement Language l' f' f

Wirthy l => Oberon2 (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

Methods

readOnly :: Ident -> IdentDef (WirthySubsetOf l)

typeBoundHeading :: forall l' f (f' :: Type -> Type). Bool -> Ident -> Ident -> Bool -> IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> ProcedureHeading (WirthySubsetOf l) l' f' f

forStatement :: forall f l' (f' :: Type -> Type). Ident -> f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Maybe (f (Expression l' l' f' f')) -> f (StatementSequence l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

variantWithStatement :: forall f l' (f' :: Type -> Type). NonEmpty (f (WithAlternative l' l' f' f')) -> Maybe (f (StatementSequence l' l' f' f')) -> Statement (WirthySubsetOf l) l' f' f

class Wirthy l => Nameable l where

Ability to deconstruct named constructs and obtain their Ident.

Methods

getProcedureName :: Nameable l' => ProcedureHeading l l' f' f -> Ident

getIdentDefName :: IdentDef l -> Ident

getNonQualIdentName :: QualIdent l -> Maybe Ident

Instances

Nameable Language

Defined in Language.Oberon.AST

Methods

getProcedureName :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Nameable l' => ProcedureHeading Language l' f' f -> Ident

getIdentDefName :: IdentDef Language -> Ident

getNonQualIdentName :: QualIdent Language -> Maybe Ident

Type synonyms

type Ident = Text

type IdentList l = NonEmpty (IdentDef l)

type BaseType l = QualIdent l

type ReturnType l = QualIdent l

type ConstExpression l = Expression l

Auxiliary data types

data RelOp

Relational operators

Constructors

Equal

Unequal

Less

LessOrEqual

Greater

GreaterOrEqual

In

Instances

Data RelOp

Defined in Language.Oberon.Abstract

Methods

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

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

toConstr :: RelOp -> Constr

dataTypeOf :: RelOp -> DataType

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

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

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

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

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

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

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

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

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

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

Show RelOp

Defined in Language.Oberon.Abstract

Methods

showsPrec :: Int -> RelOp -> ShowS

show :: RelOp -> String

showList :: [RelOp] -> ShowS

Eq RelOp

Defined in Language.Oberon.Abstract

Methods

(==) :: RelOp -> RelOp -> Bool

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

Pretty RelOp

Defined in Language.Oberon.Pretty

Methods

pretty :: RelOp -> Doc ann

prettyList :: [RelOp] -> Doc ann

data WirthySubsetOf l

A language with constructs beyond the base Wirthy class will have constructs that cannot be converted to a | Wirthy target. It can declare its TargetClass to be this transformed language instead, whose language | constructs are all wrapped in Maybe or Maybe3.

Constructors

WirthySubsetOf l

Instances

Wirthy l => Oberon (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

Associated Types

type WithAlternative (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

Methods

moduleUnit :: forall f l' (f' :: Type -> Type). Ident -> [Import (WirthySubsetOf l)] -> f (Block l' l' f' f') -> Module (WirthySubsetOf l) l' f' f

moduleImport :: Maybe Ident -> Ident -> Import (WirthySubsetOf l)

qualIdent :: Ident -> Ident -> QualIdent (WirthySubsetOf l)

getQualIdentNames :: QualIdent (WirthySubsetOf l) -> Maybe (Ident, Ident)

exported :: Ident -> IdentDef (WirthySubsetOf l)

forwardDeclaration :: forall l' f (f' :: Type -> Type). IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> Declaration (WirthySubsetOf l) l' f' f

procedureHeading :: forall l' f (f' :: Type -> Type). Bool -> IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> ProcedureHeading (WirthySubsetOf l) l' f' f

arrayType :: forall f l' (f' :: Type -> Type). [f (ConstExpression l' l' f' f')] -> f (Type l' l' f' f') -> Type (WirthySubsetOf l) l' f' f

recordType :: forall l' f (f' :: Type -> Type). Maybe (BaseType l') -> [f (FieldList l' l' f' f')] -> Type (WirthySubsetOf l) l' f' f

withStatement :: forall f l' (f' :: Type -> Type). f (WithAlternative l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

withAlternative :: forall l' f (f' :: Type -> Type). QualIdent l' -> QualIdent l' -> f (StatementSequence l' l' f' f') -> WithAlternative (WirthySubsetOf l) l' f' f

is :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> QualIdent l' -> Expression (WirthySubsetOf l) l' f' f

set :: forall f l' (f' :: Type -> Type). [f (Element l' l' f' f')] -> Expression (WirthySubsetOf l) l' f' f

typeGuard :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> QualIdent l' -> Designator (WirthySubsetOf l) l' f' f

Wirthy l => Oberon2 (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

Methods

readOnly :: Ident -> IdentDef (WirthySubsetOf l)

typeBoundHeading :: forall l' f (f' :: Type -> Type). Bool -> Ident -> Ident -> Bool -> IdentDef l' -> Maybe (f (FormalParameters l' l' f' f')) -> ProcedureHeading (WirthySubsetOf l) l' f' f

forStatement :: forall f l' (f' :: Type -> Type). Ident -> f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Maybe (f (Expression l' l' f' f')) -> f (StatementSequence l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

variantWithStatement :: forall f l' (f' :: Type -> Type). NonEmpty (f (WithAlternative l' l' f' f')) -> Maybe (f (StatementSequence l' l' f' f')) -> Statement (WirthySubsetOf l) l' f' f

Wirthy l => Wirthy (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

Associated Types

type Module (WirthySubsetOf l) = (m :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Declaration (WirthySubsetOf l) = (d :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Type (WirthySubsetOf l) = (t :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Statement (WirthySubsetOf l) = (s :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Expression (WirthySubsetOf l) = (e :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Designator (WirthySubsetOf l) = (d :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Value (WirthySubsetOf l) = (v :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type FieldList (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type ProcedureHeading (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type FormalParameters (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type FPSection (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Block (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type StatementSequence (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Case (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type CaseLabels (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type ConditionalBranch (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Element (WirthySubsetOf l) = (x :: Type -> (Type -> Type) -> (Type -> Type) -> Type)

type Import (WirthySubsetOf l) = (x :: Type)

type IdentDef (WirthySubsetOf l) = (x :: Type)

type QualIdent (WirthySubsetOf l) = (x :: Type)

Methods

constantDeclaration :: forall l' f (f' :: Type -> Type). IdentDef l' -> f (ConstExpression l' l' f' f') -> Declaration (WirthySubsetOf l) l' f' f

typeDeclaration :: forall l' f (f' :: Type -> Type). IdentDef l' -> f (Type l' l' f' f') -> Declaration (WirthySubsetOf l) l' f' f

variableDeclaration :: forall l' f (f' :: Type -> Type). IdentList l' -> f (Type l' l' f' f') -> Declaration (WirthySubsetOf l) l' f' f

procedureDeclaration :: forall f l' (f' :: Type -> Type). f (ProcedureHeading l' l' f' f') -> f (Block l' l' f' f') -> Declaration (WirthySubsetOf l) l' f' f

formalParameters :: forall f l' (f' :: Type -> Type). [f (FPSection l' l' f' f')] -> Maybe (ReturnType l') -> FormalParameters (WirthySubsetOf l) l' f' f

fpSection :: forall f l' (f' :: Type -> Type). Bool -> [Ident] -> f (Type l' l' f' f') -> FPSection (WirthySubsetOf l) l' f' f

block :: forall f l' (f' :: Type -> Type). [f (Declaration l' l' f' f')] -> Maybe (f (StatementSequence l' l' f' f')) -> Block (WirthySubsetOf l) l' f' f

fieldList :: forall l' f (f' :: Type -> Type). NonEmpty (IdentDef l') -> f (Type l' l' f' f') -> FieldList (WirthySubsetOf l) l' f' f

pointerType :: forall f l' (f' :: Type -> Type). f (Type l' l' f' f') -> Type (WirthySubsetOf l) l' f' f

procedureType :: forall f l' (f' :: Type -> Type). Maybe (f (FormalParameters l' l' f' f')) -> Type (WirthySubsetOf l) l' f' f

typeReference :: forall l' (f' :: Type -> Type) (f :: Type -> Type). QualIdent l' -> Type (WirthySubsetOf l) l' f' f

assignment :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> f (Expression l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

caseStatement :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> [f (Case l' l' f' f')] -> Maybe (f (StatementSequence l' l' f' f')) -> Statement (WirthySubsetOf l) l' f' f

emptyStatement :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Statement (WirthySubsetOf l) l' f' f

exitStatement :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Statement (WirthySubsetOf l) l' f' f

ifStatement :: forall f l' (f' :: Type -> Type). NonEmpty (f (ConditionalBranch l' l' f' f')) -> Maybe (f (StatementSequence l' l' f' f')) -> Statement (WirthySubsetOf l) l' f' f

loopStatement :: forall f l' (f' :: Type -> Type). f (StatementSequence l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

procedureCall :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Maybe [f (Expression l' l' f' f')] -> Statement (WirthySubsetOf l) l' f' f

repeatStatement :: forall f l' (f' :: Type -> Type). f (StatementSequence l' l' f' f') -> f (Expression l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

returnStatement :: forall f l' (f' :: Type -> Type). Maybe (f (Expression l' l' f' f')) -> Statement (WirthySubsetOf l) l' f' f

whileStatement :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (StatementSequence l' l' f' f') -> Statement (WirthySubsetOf l) l' f' f

conditionalBranch :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (StatementSequence l' l' f' f') -> ConditionalBranch (WirthySubsetOf l) l' f' f

caseAlternative :: forall f l' (f' :: Type -> Type). NonEmpty (f (CaseLabels l' l' f' f')) -> f (StatementSequence l' l' f' f') -> Case (WirthySubsetOf l) l' f' f

singleLabel :: forall f l' (f' :: Type -> Type). f (ConstExpression l' l' f' f') -> CaseLabels (WirthySubsetOf l) l' f' f

labelRange :: forall f l' (f' :: Type -> Type). f (ConstExpression l' l' f' f') -> f (ConstExpression l' l' f' f') -> CaseLabels (WirthySubsetOf l) l' f' f

statementSequence :: forall f l' (f' :: Type -> Type). [f (Statement l' l' f' f')] -> StatementSequence (WirthySubsetOf l) l' f' f

add :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

subtract :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

and :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

or :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

divide :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

integerDivide :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

modulo :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

multiply :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

functionCall :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> [f (Expression l' l' f' f')] -> Expression (WirthySubsetOf l) l' f' f

literal :: forall f l' (f' :: Type -> Type). f (Value l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

negative :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

positive :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

not :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

read :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

relation :: forall f l' (f' :: Type -> Type). RelOp -> f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Expression (WirthySubsetOf l) l' f' f

element :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> Element (WirthySubsetOf l) l' f' f

range :: forall f l' (f' :: Type -> Type). f (Expression l' l' f' f') -> f (Expression l' l' f' f') -> Element (WirthySubsetOf l) l' f' f

integer :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Integer -> Value (WirthySubsetOf l) l' f' f

nil :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Value (WirthySubsetOf l) l' f' f

false :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Value (WirthySubsetOf l) l' f' f

true :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Value (WirthySubsetOf l) l' f' f

real :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Double -> Value (WirthySubsetOf l) l' f' f

string :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Text -> Value (WirthySubsetOf l) l' f' f

charCode :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Int -> Value (WirthySubsetOf l) l' f' f

builtin :: forall l' (f' :: Type -> Type) (f :: Type -> Type). Text -> Value (WirthySubsetOf l) l' f' f

variable :: forall l' (f' :: Type -> Type) (f :: Type -> Type). QualIdent l' -> Designator (WirthySubsetOf l) l' f' f

field :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Ident -> Designator (WirthySubsetOf l) l' f' f

index :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> NonEmpty (f (Expression l' l' f' f')) -> Designator (WirthySubsetOf l) l' f' f

dereference :: forall f l' (f' :: Type -> Type). f (Designator l' l' f' f') -> Designator (WirthySubsetOf l) l' f' f

identDef :: Ident -> IdentDef (WirthySubsetOf l)

nonQualIdent :: Ident -> QualIdent (WirthySubsetOf l)

type Block (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Block (WirthySubsetOf l) = Maybe3 (Block l)

type Case (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Case (WirthySubsetOf l) = Maybe3 (Case l)

type CaseLabels (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type CaseLabels (WirthySubsetOf l) = Maybe3 (CaseLabels l)

type ConditionalBranch (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type ConditionalBranch (WirthySubsetOf l) = Maybe3 (ConditionalBranch l)

type Declaration (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Declaration (WirthySubsetOf l) = Maybe3 (Declaration l)

type Designator (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Designator (WirthySubsetOf l) = Maybe3 (Designator l)

type Element (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Element (WirthySubsetOf l) = Maybe3 (Element l)

type Expression (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Expression (WirthySubsetOf l) = Maybe3 (Expression l)

type FPSection (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type FPSection (WirthySubsetOf l) = Maybe3 (FPSection l)

type FieldList (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type FieldList (WirthySubsetOf l) = Maybe3 (FieldList l)

type FormalParameters (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type FormalParameters (WirthySubsetOf l) = Maybe3 (FormalParameters l)

type IdentDef (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type IdentDef (WirthySubsetOf l) = Maybe (IdentDef l)

type Import (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Import (WirthySubsetOf l) = Maybe (Import l)

type Module (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Module (WirthySubsetOf l) = Maybe3 (Module l)

type ProcedureHeading (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type ProcedureHeading (WirthySubsetOf l) = Maybe3 (ProcedureHeading l)

type QualIdent (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type QualIdent (WirthySubsetOf l) = Maybe (QualIdent l)

type Statement (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Statement (WirthySubsetOf l) = Maybe3 (Statement l)

type StatementSequence (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type StatementSequence (WirthySubsetOf l) = Maybe3 (StatementSequence l)

type Type (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Type (WirthySubsetOf l) = Maybe3 (Type l)

type Value (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type Value (WirthySubsetOf l) = Maybe3 (Value l)

type WithAlternative (WirthySubsetOf l)

Defined in Language.Oberon.Abstract

type WithAlternative (WirthySubsetOf l) = Maybe3 (WithAlternative l)

newtype Maybe3 f a b c

A modified Maybe with kind that fits the types associated with Wirthy.

Constructors

Maybe3 (Maybe (f a b c))

Instances

Read (f a b c) => Read (Maybe3 f a b c)

Defined in Language.Oberon.Abstract

Methods

readsPrec :: Int -> ReadS (Maybe3 f a b c)

readList :: ReadS [Maybe3 f a b c]

readPrec :: ReadPrec (Maybe3 f a b c)

readListPrec :: ReadPrec [Maybe3 f a b c]

Show (f a b c) => Show (Maybe3 f a b c)

Defined in Language.Oberon.Abstract

Methods

showsPrec :: Int -> Maybe3 f a b c -> ShowS

show :: Maybe3 f a b c -> String

showList :: [Maybe3 f a b c] -> ShowS

Eq (f a b c) => Eq (Maybe3 f a b c)

Defined in Language.Oberon.Abstract

Methods

(==) :: Maybe3 f a b c -> Maybe3 f a b c -> Bool

(/=) :: Maybe3 f a b c -> Maybe3 f a b c -> Bool

Ord (f a b c) => Ord (Maybe3 f a b c)

Defined in Language.Oberon.Abstract

Methods

compare :: Maybe3 f a b c -> Maybe3 f a b c -> Ordering

(<) :: Maybe3 f a b c -> Maybe3 f a b c -> Bool

(<=) :: Maybe3 f a b c -> Maybe3 f a b c -> Bool

(>) :: Maybe3 f a b c -> Maybe3 f a b c -> Bool

(>=) :: Maybe3 f a b c -> Maybe3 f a b c -> Bool

max :: Maybe3 f a b c -> Maybe3 f a b c -> Maybe3 f a b c

min :: Maybe3 f a b c -> Maybe3 f a b c -> Maybe3 f a b c

Utilities

just3 :: forall {k} {k} {k} {f} {a :: k} {b :: k} {c :: k}. f a b c -> Maybe3 f a b c

Smart Maybe3 constructor corresponding to Just

nothing3 :: forall {k} {k} {k} {f :: k -> k -> k -> Type} {a :: k} {b :: k} {c :: k}. Maybe3 f a b c

Smart Maybe3 constructor corresponding to Nothing

maybe3 :: forall {k} {k} {k} {b} {f} {a :: k} {b :: k} {c :: k}. b -> (f a b c -> b) -> Maybe3 f a b c -> b

Smart Maybe3 destructor corresponding to maybe