Language.Hakaru.Parser.AST

Documentation

data Name

Constructors

Name !Nat !Text

Instances

Eq Name

Methods

(==) :: Name -> Name -> Bool

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

Ord Name

Methods

compare :: Name -> Name -> Ordering

(<) :: Name -> Name -> Bool

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

(>) :: Name -> Name -> Bool

(>=) :: Name -> Name -> Bool

max :: Name -> Name -> Name

min :: Name -> Name -> Name

Read Name

Methods

readsPrec :: Int -> ReadS Name

readList :: ReadS [Name]

readPrec :: ReadPrec Name

readListPrec :: ReadPrec [Name]

Show Name

Methods

showsPrec :: Int -> Name -> ShowS

show :: Name -> String

showList :: [Name] -> ShowS

nameID :: Name -> Nat

hintID :: Name -> Text

type Name' = Text

data Branch' a

Constructors

Branch' (Pattern' Name') (AST' a)

Branch'' (Pattern' Name) (AST' a)

Instances

Eq a => Eq (Branch' a)

Methods

(==) :: Branch' a -> Branch' a -> Bool

(/=) :: Branch' a -> Branch' a -> Bool

Show a => Show (Branch' a)

Methods

showsPrec :: Int -> Branch' a -> ShowS

show :: Branch' a -> String

showList :: [Branch' a] -> ShowS

data Pattern' a

Constructors

PVar' a

PWild'

PData' (PDatum a)

Instances

Eq a => Eq (Pattern' a)

Methods

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

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

Show a => Show (Pattern' a)

Methods

showsPrec :: Int -> Pattern' a -> ShowS

show :: Pattern' a -> String

showList :: [Pattern' a] -> ShowS

data PDatum a

Constructors

DV Name' [Pattern' a]

Instances

Eq a => Eq (PDatum a)

Methods

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

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

Show a => Show (PDatum a)

Methods

showsPrec :: Int -> PDatum a -> ShowS

show :: PDatum a -> String

showList :: [PDatum a] -> ShowS

data SourceSpan

Constructors

SourceSpan !SourcePos !SourcePos

Instances

Eq SourceSpan

Methods

(==) :: SourceSpan -> SourceSpan -> Bool

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

Show SourceSpan

Methods

showsPrec :: Int -> SourceSpan -> ShowS

show :: SourceSpan -> String

showList :: [SourceSpan] -> ShowS

numberLine :: Text -> Int -> Text

printSourceSpan :: SourceSpan -> Vector Text -> Text

data Literal'

Constructors

Nat Integer

Int Integer

Prob Rational

Real Rational

Instances

Eq Literal'

Methods

(==) :: Literal' -> Literal' -> Bool

(/=) :: Literal' -> Literal' -> Bool

Show Literal'

Methods

showsPrec :: Int -> Literal' -> ShowS

show :: Literal' -> String

showList :: [Literal'] -> ShowS

data NaryOp

Constructors

And

Or

Xor

Iff

Min

Max

Sum

Prod

Instances

Eq NaryOp

Methods

(==) :: NaryOp -> NaryOp -> Bool

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

Show NaryOp

Methods

showsPrec :: Int -> NaryOp -> ShowS

show :: NaryOp -> String

showList :: [NaryOp] -> ShowS

data ArrayOp

Constructors

Index_

Size

Reduce

data TypeAST'

Constructors

TypeVar Name'

TypeApp Name' [TypeAST']

TypeFun TypeAST' TypeAST'

Instances

Eq TypeAST'

Methods

(==) :: TypeAST' -> TypeAST' -> Bool

(/=) :: TypeAST' -> TypeAST' -> Bool

Show TypeAST'

Methods

showsPrec :: Int -> TypeAST' -> ShowS

show :: TypeAST' -> String

showList :: [TypeAST'] -> ShowS

data AST' a

Constructors

Var a

Lam a TypeAST' (AST' a)

App (AST' a) (AST' a)

Let a (AST' a) (AST' a)

If (AST' a) (AST' a) (AST' a)

Ann (AST' a) TypeAST'

Infinity'

ULiteral Literal'

NaryOp NaryOp [AST' a]

Unit

Empty

Pair (AST' a) (AST' a)

Array a (AST' a) (AST' a)

Index (AST' a) (AST' a)

Case (AST' a) [Branch' a]

Dirac (AST' a)

Bind a (AST' a) (AST' a)

Plate a (AST' a) (AST' a)

Chain a (AST' a) (AST' a) (AST' a)

Integrate a (AST' a) (AST' a) (AST' a)

Summate a (AST' a) (AST' a) (AST' a)

Product a (AST' a) (AST' a) (AST' a)

Expect a (AST' a) (AST' a)

Observe (AST' a) (AST' a)

Msum [AST' a]

Data a [TypeAST']

WithMeta (AST' a) SourceSpan

Instances

Eq a => Eq (AST' a)

Methods

(==) :: AST' a -> AST' a -> Bool

(/=) :: AST' a -> AST' a -> Bool

Show a => Show (AST' a)

Methods

showsPrec :: Int -> AST' a -> ShowS

show :: AST' a -> String

showList :: [AST' a] -> ShowS

data Import a

Constructors

Import a

Instances

Eq a => Eq (Import a)

Methods

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

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

Show a => Show (Import a)

Methods

showsPrec :: Int -> Import a -> ShowS

show :: Import a -> String

showList :: [Import a] -> ShowS

data ASTWithImport' a

Constructors

ASTWithImport' [Import a] (AST' a)

Instances

Eq a => Eq (ASTWithImport' a)

Methods

(==) :: ASTWithImport' a -> ASTWithImport' a -> Bool

(/=) :: ASTWithImport' a -> ASTWithImport' a -> Bool

Show a => Show (ASTWithImport' a)

Methods

showsPrec :: Int -> ASTWithImport' a -> ShowS

show :: ASTWithImport' a -> String

showList :: [ASTWithImport' a] -> ShowS

val :: Literal' -> Some1 Literal

data PrimOp

Constructors

Not

Impl

Diff

Nand

Nor

Pi

Sin

Cos

Tan

Asin

Acos

Atan

Sinh

Cosh

Tanh

Asinh

Acosh

Atanh

RealPow

NatPow

Exp

Log

Infinity

GammaFunc

BetaFunc

Equal

Less

Negate

Recip

Abs

Signum

NatRoot

Erf

Instances

Eq PrimOp

Methods

(==) :: PrimOp -> PrimOp -> Bool

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

Show PrimOp

Methods

showsPrec :: Int -> PrimOp -> ShowS

show :: PrimOp -> String

showList :: [PrimOp] -> ShowS

data SomeOp op where

Constructors

SomeOp :: (typs ~ UnLCs args, args ~ LCs typs) => !(op typs a) -> SomeOp op

data SSing

Constructors

SSing !(Sing a)

data Branch_ abt

Constructors

Branch_ Pattern (abt '[] U)

fmapBranch :: (f '[] U -> g '[] U) -> Branch_ f -> Branch_ g

foldBranch :: (abt '[] U -> m) -> Branch_ abt -> m

data Pattern

Constructors

PWild

PVar Name

PDatum Text PCode

data PFun

Constructors

PKonst Pattern

PIdent Pattern

data PStruct

Constructors

PEt PFun PStruct infixr 7

PDone

data PCode

Constructors

PInr PCode

PInl PStruct

data DFun abt

Constructors

Konst (abt '[] U)

Ident (abt '[] U)

data DStruct abt

Constructors

Et (DFun abt) (DStruct abt) infixr 7

Done

data DCode abt

Constructors

Inr (DCode abt)

Inl (DStruct abt)

data Datum abt

Constructors

Datum Text (DCode abt)

fmapDatum :: (f '[] U -> g '[] U) -> Datum f -> Datum g

foldDatum :: Monoid m => (abt '[] U -> m) -> Datum abt -> m

data Untyped

The kind containing exactly one type.

Constructors

U

Instances

Read Untyped

Methods

readsPrec :: Int -> ReadS Untyped

readList :: ReadS [Untyped]

readPrec :: ReadPrec Untyped

readListPrec :: ReadPrec [Untyped]

Show Untyped

Methods

showsPrec :: Int -> Untyped -> ShowS

show :: Untyped -> String

showList :: [Untyped] -> ShowS

SingI Untyped U

Methods

sing :: Sing U a

Foldable21 Untyped Untyped [Untyped] Term

Methods

fold21 :: Monoid m => f (Lift2 k2 k1 m) j -> m

foldMap21 :: Monoid m => (forall h i. a h i -> m) -> f a j -> m

Functor21 Untyped Untyped [Untyped] Term

Methods

fmap21 :: (forall h i. a h i -> b h i) -> f a j -> f b j

JmEq1 Untyped (Sing Untyped)

Methods

jmEq1 :: a i -> a j -> Maybe (TypeEq (Sing Untyped) i j)

Eq1 Untyped (Sing Untyped)

Methods

eq1 :: a i -> a i -> Bool

Show1 Untyped (Sing Untyped)

Methods

showsPrec1 :: Int -> a i -> ShowS

show1 :: a i -> String

Eq (Sing Untyped a)

Methods

(==) :: Sing Untyped a -> Sing Untyped a -> Bool

(/=) :: Sing Untyped a -> Sing Untyped a -> Bool

Show (Sing Untyped a)

Methods

showsPrec :: Int -> Sing Untyped a -> ShowS

show :: Sing Untyped a -> String

showList :: [Sing Untyped a] -> ShowS

data Sing Untyped

data Sing Untyped where

• SU :: Sing Untyped U

nameToVar :: Name -> Variable U

data Term :: ([Untyped] -> Untyped -> *) -> Untyped -> * where

Constructors

Lam_ :: SSing -> abt '[U] U -> Term abt U

App_ :: abt '[] U -> abt '[] U -> Term abt U

Let_ :: abt '[] U -> abt '[U] U -> Term abt U

Ann_ :: SSing -> abt '[] U -> Term abt U

CoerceTo_ :: Some2 Coercion -> abt '[] U -> Term abt U

UnsafeTo_ :: Some2 Coercion -> abt '[] U -> Term abt U

PrimOp_ :: PrimOp -> [abt '[] U] -> Term abt U

ArrayOp_ :: ArrayOp -> [abt '[] U] -> Term abt U

MeasureOp_ :: SomeOp MeasureOp -> [abt '[] U] -> Term abt U

NaryOp_ :: NaryOp -> [abt '[] U] -> Term abt U

Literal_ :: Some1 Literal -> Term abt U

Empty_ :: Term abt U

Pair_ :: abt '[] U -> abt '[] U -> Term abt U

Array_ :: abt '[] U -> abt '[U] U -> Term abt U

Datum_ :: Datum abt -> Term abt U

Case_ :: abt '[] U -> [Branch_ abt] -> Term abt U

Dirac_ :: abt '[] U -> Term abt U

MBind_ :: abt '[] U -> abt '[U] U -> Term abt U

Plate_ :: abt '[] U -> abt '[U] U -> Term abt U

Chain_ :: abt '[] U -> abt '[] U -> abt '[U] U -> Term abt U

Integrate_ :: abt '[] U -> abt '[] U -> abt '[U] U -> Term abt U

Summate_ :: abt '[] U -> abt '[] U -> abt '[U] U -> Term abt U

Product_ :: abt '[] U -> abt '[] U -> abt '[U] U -> Term abt U

Expect_ :: abt '[] U -> abt '[U] U -> Term abt U

Observe_ :: abt '[] U -> abt '[] U -> Term abt U

Superpose_ :: NonEmpty (abt '[] U, abt '[] U) -> Term abt U

Reject_ :: Term abt U

Instances

Foldable21 Untyped Untyped [Untyped] Term

Methods

fold21 :: Monoid m => f (Lift2 k2 k1 m) j -> m

foldMap21 :: Monoid m => (forall h i. a h i -> m) -> f a j -> m

Functor21 Untyped Untyped [Untyped] Term

Methods

fmap21 :: (forall h i. a h i -> b h i) -> f a j -> f b j

type AST = MetaABT SourceSpan Term '[] U

type MetaTerm = Term (MetaABT SourceSpan Term) U

type Branch = Branch_ (MetaABT SourceSpan Term)

type DFun_ = DFun (MetaABT SourceSpan Term)

type DStruct_ = DStruct (MetaABT SourceSpan Term)

type DCode_ = DCode (MetaABT SourceSpan Term)