Feldspar.Primitive.Representation

Primitive Feldspar expressions

Types

type Length = Word32

type Index = Word32

data PrimTypeRep a where

Representation of primitive supported types

Constructors

BoolT :: PrimTypeRep Bool

Int8T :: PrimTypeRep Int8

Int16T :: PrimTypeRep Int16

Int32T :: PrimTypeRep Int32

Int64T :: PrimTypeRep Int64

Word8T :: PrimTypeRep Word8

Word16T :: PrimTypeRep Word16

Word32T :: PrimTypeRep Word32

Word64T :: PrimTypeRep Word64

FloatT :: PrimTypeRep Float

DoubleT :: PrimTypeRep Double

ComplexFloatT :: PrimTypeRep (Complex Float)

ComplexDoubleT :: PrimTypeRep (Complex Double)

Instances

Show (PrimTypeRep a)

Methods

showsPrec :: Int -> PrimTypeRep a -> ShowS

show :: PrimTypeRep a -> String

showList :: [PrimTypeRep a] -> ShowS

data IntTypeRep a where

Constructors

Int8Type :: IntTypeRep Int8

Int16Type :: IntTypeRep Int16

Int32Type :: IntTypeRep Int32

Int64Type :: IntTypeRep Int64

Instances

Show (IntTypeRep a)

Methods

showsPrec :: Int -> IntTypeRep a -> ShowS

show :: IntTypeRep a -> String

showList :: [IntTypeRep a] -> ShowS

data WordTypeRep a where

Constructors

Word8Type :: WordTypeRep Word8

Word16Type :: WordTypeRep Word16

Word32Type :: WordTypeRep Word32

Word64Type :: WordTypeRep Word64

Instances

Show (WordTypeRep a)

Methods

showsPrec :: Int -> WordTypeRep a -> ShowS

show :: WordTypeRep a -> String

showList :: [WordTypeRep a] -> ShowS

data IntWordTypeRep a where

Constructors

IntType :: IntTypeRep a -> IntWordTypeRep a

WordType :: WordTypeRep a -> IntWordTypeRep a

Instances

Show (IntWordTypeRep a)

Methods

showsPrec :: Int -> IntWordTypeRep a -> ShowS

show :: IntWordTypeRep a -> String

showList :: [IntWordTypeRep a] -> ShowS

data FloatingTypeRep a where

Constructors

FloatType :: FloatingTypeRep Float

DoubleType :: FloatingTypeRep Double

Instances

Show (FloatingTypeRep a)

Methods

showsPrec :: Int -> FloatingTypeRep a -> ShowS

show :: FloatingTypeRep a -> String

showList :: [FloatingTypeRep a] -> ShowS

data ComplexTypeRep a where

Constructors

ComplexFloatType :: ComplexTypeRep (Complex Float)

ComplexDoubleType :: ComplexTypeRep (Complex Double)

Instances

Show (ComplexTypeRep a)

Methods

showsPrec :: Int -> ComplexTypeRep a -> ShowS

show :: ComplexTypeRep a -> String

showList :: [ComplexTypeRep a] -> ShowS

data PrimTypeView a where

A different view of PrimTypeRep that allows matching on similar types

Constructors

PrimTypeBool :: PrimTypeView Bool

PrimTypeIntWord :: IntWordTypeRep a -> PrimTypeView a

PrimTypeFloating :: FloatingTypeRep a -> PrimTypeView a

PrimTypeComplex :: ComplexTypeRep a -> PrimTypeView a

Instances

Show (PrimTypeView a)

Methods

showsPrec :: Int -> PrimTypeView a -> ShowS

show :: PrimTypeView a -> String

showList :: [PrimTypeView a] -> ShowS

viewPrimTypeRep :: PrimTypeRep a -> PrimTypeView a

unviewPrimTypeRep :: PrimTypeView a -> PrimTypeRep a

primTypeIntWidth :: PrimTypeRep a -> Maybe Int

class (Eq a, Show a, Typeable a) => PrimType' a where

Primitive supported types

Minimal complete definition

primTypeRep

Methods

primTypeRep :: PrimTypeRep a

Reify a primitive type

Instances

PrimType' Bool

Methods

primTypeRep :: PrimTypeRep Bool

PrimType' Double

Methods

primTypeRep :: PrimTypeRep Double

PrimType' Float

Methods

primTypeRep :: PrimTypeRep Float

PrimType' Int8

Methods

primTypeRep :: PrimTypeRep Int8

PrimType' Int16

Methods

primTypeRep :: PrimTypeRep Int16

PrimType' Int32

Methods

primTypeRep :: PrimTypeRep Int32

PrimType' Int64

Methods

primTypeRep :: PrimTypeRep Int64

PrimType' Word8

Methods

primTypeRep :: PrimTypeRep Word8

PrimType' Word16

Methods

primTypeRep :: PrimTypeRep Word16

PrimType' Word32

Methods

primTypeRep :: PrimTypeRep Word32

PrimType' Word64

Methods

primTypeRep :: PrimTypeRep Word64

PrimType' (Complex Double)

Methods

primTypeRep :: PrimTypeRep (Complex Double)

PrimType' (Complex Float)

Methods

primTypeRep :: PrimTypeRep (Complex Float)

InterpBi (* -> Constraint, *) * (AssertCMD (* -> *) (* -> Constraint)) IO (Param1 (* -> Constraint) PrimType')

Methods

interpBi :: Param1 (* -> Constraint) PrimType' ((IO -> *, (IO -> *, AssertCMD (* -> *) (* -> Constraint))) m ((IO -> *, AssertCMD (* -> *) (* -> Constraint)) m fs)) a -> m a

Syntactic (Struct PrimType' Data a)

Associated Types

type Domain (Struct PrimType' Data a) :: * -> *

type Internal (Struct PrimType' Data a) :: *

Methods

desugar :: Struct PrimType' Data a -> ASTF (Domain (Struct PrimType' Data a)) (Internal (Struct PrimType' Data a))

sugar :: ASTF (Domain (Struct PrimType' Data a)) (Internal (Struct PrimType' Data a)) -> Struct PrimType' Data a

type Internal (Struct PrimType' Data a)

type Internal (Struct PrimType' Data a) = a

type Domain (Struct PrimType' Data a)

type Domain (Struct PrimType' Data a) = FeldDomain

primTypeOf :: PrimType' a => a -> PrimTypeRep a

Convenience function; like primTypeRep but with an extra argument to constrain the type parameter. The extra argument is ignored.

primTypeEq :: PrimTypeRep a -> PrimTypeRep b -> Maybe (Dict (a ~ b))

Check whether two type representations are equal

witPrimType :: PrimTypeRep a -> Dict (PrimType' a)

Reflect a PrimTypeRep to a PrimType' constraint

Expressions

data Primitive sig where

Primitive operations

Constructors

FreeVar :: PrimType' a => String -> Primitive (Full a)

Lit :: (Eq a, Show a) => a -> Primitive (Full a)

Add :: (Num a, PrimType' a) => Primitive (a :-> (a :-> Full a))

Sub :: (Num a, PrimType' a) => Primitive (a :-> (a :-> Full a))

Mul :: (Num a, PrimType' a) => Primitive (a :-> (a :-> Full a))

Neg :: (Num a, PrimType' a) => Primitive (a :-> Full a)

Abs :: (Num a, PrimType' a) => Primitive (a :-> Full a)

Sign :: (Num a, PrimType' a) => Primitive (a :-> Full a)

Quot :: (Integral a, PrimType' a) => Primitive (a :-> (a :-> Full a))

Rem :: (Integral a, PrimType' a) => Primitive (a :-> (a :-> Full a))

Div :: (Integral a, PrimType' a) => Primitive (a :-> (a :-> Full a))

Mod :: (Integral a, PrimType' a) => Primitive (a :-> (a :-> Full a))

FDiv :: (Fractional a, PrimType' a) => Primitive (a :-> (a :-> Full a))

Pi :: (Floating a, PrimType' a) => Primitive (Full a)

Exp :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Log :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Sqrt :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Pow :: (Floating a, PrimType' a) => Primitive (a :-> (a :-> Full a))

Sin :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Cos :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Tan :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Asin :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Acos :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Atan :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Sinh :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Cosh :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Tanh :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Asinh :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Acosh :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Atanh :: (Floating a, PrimType' a) => Primitive (a :-> Full a)

Complex :: (Num a, PrimType' a, PrimType' (Complex a)) => Primitive (a :-> (a :-> Full (Complex a)))

Polar :: (Floating a, PrimType' a, PrimType' (Complex a)) => Primitive (a :-> (a :-> Full (Complex a)))

Real :: (PrimType' a, PrimType' (Complex a)) => Primitive (Complex a :-> Full a)

Imag :: (PrimType' a, PrimType' (Complex a)) => Primitive (Complex a :-> Full a)

Magnitude :: (RealFloat a, PrimType' a, PrimType' (Complex a)) => Primitive (Complex a :-> Full a)

Phase :: (RealFloat a, PrimType' a, PrimType' (Complex a)) => Primitive (Complex a :-> Full a)

Conjugate :: (Num a, PrimType' (Complex a)) => Primitive (Complex a :-> Full (Complex a))

I2N :: (Integral a, Num b, PrimType' a, PrimType' b) => Primitive (a :-> Full b)

I2B :: (Integral a, PrimType' a) => Primitive (a :-> Full Bool)

B2I :: (Integral a, PrimType' a) => Primitive (Bool :-> Full a)

Round :: (RealFrac a, Num b, PrimType' a, PrimType' b) => Primitive (a :-> Full b)

Not :: Primitive (Bool :-> Full Bool)

And :: Primitive (Bool :-> (Bool :-> Full Bool))

Or :: Primitive (Bool :-> (Bool :-> Full Bool))

Eq :: (Eq a, PrimType' a) => Primitive (a :-> (a :-> Full Bool))

NEq :: (Eq a, PrimType' a) => Primitive (a :-> (a :-> Full Bool))

Lt :: (Ord a, PrimType' a) => Primitive (a :-> (a :-> Full Bool))

Gt :: (Ord a, PrimType' a) => Primitive (a :-> (a :-> Full Bool))

Le :: (Ord a, PrimType' a) => Primitive (a :-> (a :-> Full Bool))

Ge :: (Ord a, PrimType' a) => Primitive (a :-> (a :-> Full Bool))

BitAnd :: (Bits a, PrimType' a) => Primitive (a :-> (a :-> Full a))

BitOr :: (Bits a, PrimType' a) => Primitive (a :-> (a :-> Full a))

BitXor :: (Bits a, PrimType' a) => Primitive (a :-> (a :-> Full a))

BitCompl :: (Bits a, PrimType' a) => Primitive (a :-> Full a)

ShiftL :: (Bits a, PrimType' a, Integral b, PrimType' b) => Primitive (a :-> (b :-> Full a))

ShiftR :: (Bits a, PrimType' a, Integral b, PrimType' b) => Primitive (a :-> (b :-> Full a))

ArrIx :: PrimType' a => IArr Index a -> Primitive (Index :-> Full a)

Cond :: Primitive (Bool :-> (a :-> (a :-> Full a)))

Instances

Eval Primitive

Methods

evalSym :: Primitive sig -> Denotation sig

Equality Primitive

Methods

equal :: Primitive a -> Primitive b -> Bool

hash :: Primitive a -> Hash

Render Primitive

Methods

renderSym :: Primitive sig -> String

renderArgs :: [String] -> Primitive sig -> String

StringTree Primitive

Methods

stringTreeSym :: [Tree String] -> Primitive a -> Tree String

Symbol Primitive

Methods

symSig :: Primitive sig -> SigRep sig

EvalEnv Primitive env

Assumes no occurrences of FreeVar and concrete representation of arrays

Methods

compileSym :: proxy env -> Primitive sig -> DenotationM (Reader env) sig

Show (Primitive a)

Methods

showsPrec :: Int -> Primitive a -> ShowS

show :: Primitive a -> String

showList :: [Primitive a] -> ShowS

type PrimDomain = Primitive :&: PrimTypeRep

newtype Prim a

Primitive expressions

Constructors

Prim

Fields

• unPrim :: ASTF PrimDomain a

Instances

FreeExp Prim

Associated Types

type FreePred (Prim :: * -> *) :: * -> Constraint

Methods

constExp :: FreePred Prim a => a -> Prim a

varExp :: FreePred Prim a => VarId -> Prim a

EvalExp Prim

Methods

evalExp :: Prim a -> a

(Num a, PrimType' a) => Num (Prim a)

Methods

(+) :: Prim a -> Prim a -> Prim a

(-) :: Prim a -> Prim a -> Prim a

(*) :: Prim a -> Prim a -> Prim a

negate :: Prim a -> Prim a

abs :: Prim a -> Prim a

signum :: Prim a -> Prim a

fromInteger :: Integer -> Prim a

Syntactic (Prim a)

Associated Types

type Domain (Prim a) :: * -> *

type Internal (Prim a) :: *

Methods

desugar :: Prim a -> ASTF (Domain (Prim a)) (Internal (Prim a))

sugar :: ASTF (Domain (Prim a)) (Internal (Prim a)) -> Prim a

type FreePred Prim

type FreePred Prim = PrimType'

type Internal (Prim a)

type Internal (Prim a) = a

type Domain (Prim a)

type Domain (Prim a) = PrimDomain

evalPrim :: Prim a -> a

Evaluate a closed expression

sugarSymPrim :: (Signature sig, fi ~ SmartFun dom sig, sig ~ SmartSig fi, dom ~ SmartSym fi, dom ~ PrimDomain, SyntacticN f fi, sub :<: Primitive, PrimType' (DenResult sig)) => sub sig -> f

Interface