


Description 
The user interface of the core language


Synopsis 

data Ord a => Range a = Range {}   data a :> b = a :> b   class Set a where    type Length = Int   type Unsigned32 = Word32   type Signed32 = Int32   type Unsigned16 = Word16   type Signed16 = Int16   type Unsigned8 = Word8   type Signed8 = Int8   class Typeable a => Storable a   data Data a   dataSize :: Data a > Size a   class Typeable (Internal a) => Computable a where    eval :: Computable a => a > Internal a   value :: Storable a => a > Data a   array :: Storable a => Size a > a > Data a   arrayLen :: Storable a => Data Length > [a] > Data [a]   unit :: Data ()   true :: Data Bool   false :: Data Bool   size :: forall a. Storable a => Data [a] > [Range Length]   cap :: (Storable a, Size a ~ Range b, Ord b) => Range b > Data a > Data a   function :: (Storable a, Storable b) => String > (Size a > Size b) > (a > b) > Data a > Data b   function2 :: (Storable a, Storable b, Storable c) => String > (Size a > Size b > Size c) > (a > b > c) > Data a > Data b > Data c   function3 :: (Storable a, Storable b, Storable c, Storable d) => String > (Size a > Size b > Size c > Size d) > (a > b > c > d) > Data a > Data b > Data c > Data d   function4 :: (Storable a, Storable b, Storable c, Storable d, Storable e) => String > (Size a > Size b > Size c > Size d > Size e) > (a > b > c > d > e) > Data a > Data b > Data c > Data d > Data e   getIx :: Storable a => Data [a] > Data Int > Data a   setIx :: Storable a => Data [a] > Data Int > Data a > Data [a]   class RandomAccess a where    noInline :: (Computable a, Computable b) => String > (a > b) > a > b   ifThenElse :: (Computable a, Computable b) => Data Bool > (a > b) > (a > b) > a > b   while :: Computable state => (state > Data Bool) > (state > state) > state > state   parallel :: Storable a => Data Length > (Data Int > Data a) > Data [a]   class Program a   showCore :: forall a. Program a => a > String   showCoreWithSize :: forall a. Program a => a > String   printCore :: Program a => a > IO ()   printCoreWithSize :: Program a => a > IO ()   module Feldspar.Core.Functions   trace :: Storable a => Int > Data a > Data a 


Documentation 


Constructors   Instances  



Heterogeneous list
 Constructors   Instances  



 Methods    Instances  Set ()  Ord a => Set (Range a)  (Set a, Set b) => Set (a, b)  (Set a, Set b) => Set (:> a b)  (Set a, Set b, Set c) => Set (a, b, c)  (Set a, Set b, Set c, Set d) => Set (a, b, c, d) 


















Storable types (zero or higherlevel arrays of primitive data).
  Instances  



A wrapper around Expr to allow observable sharing (see
Feldspar.Core.Ref) and for memoizing size information.
 Instances  





Computable types. A computable value completely represents a core program,
in such a way that internalize . externalize preserves semantics, but
not necessarily syntax.
The terminology used in this class comes from thinking of the Data type as
the "internal" core language and the Feldspar.Core API as the
"external" core language.
  Associated Types   Data (Internal a) is the internal representation of the type a.


  Methods    Instances  Storable a => Computable (Data a)  Storable a => Computable (Vector (Data a))  Storable a => Computable (Vector (Vector (Data a)))  (Computable a, Computable b) => Computable (a, b)  (Computable a, Computable b, Computable c) => Computable (a, b, c)  (Computable a, Computable b, Computable c, Computable d) => Computable (a, b, c, d) 




The semantics of any Computable type



A program that computes a constant value



Like value but with an extra Size argument that can be used to increase
the size beyond the given data.
Example 1:
array (10 :> 20 :> universal) [] :: Data [[Int]]
gives an uninitialized 10x20 array of Int elements.
Example 2:
array (10 :> 20 :> universal) [[1,2,3]] :: Data [[Int]]
gives a 10x20 array whose first row is initialized to [1,2,3].











Returns the size of each level of a multidimensional array, starting with
the outermost level.





Constructs a oneargument primitive function.
function fun szf f:
 fun is the name of the function.
 szf computes the output size from the input size.
 f gives the evaluation semantics.



A twoargument primitive function



A threeargument primitive function



A fourargument primitive function



Look up an index in an array (see also !)



setIx arr i a:
Replaces the value at index i in the array arr with the value a.


class RandomAccess a where  Source 

 Associated Types   The type of elements in a random access structure


  Methods   Index lookup in a random access structure

  Instances  



Constructs a nonprimitive, noninlined function.
The normal way to make a nonprimitive function is to use an ordinary Haskell
function, for example:
myFunc x = x * 4 + 5
However, such functions are inevitably inlined into the program expression
when applied. noInline can be thought of as a way to protect a function
against inlining (but later transformations may choose to inline anyway).
Ideally, it should be posssible to reuse such a function several times, but
at the moment this does not work. Every application of a noInline function
results in a new copy of the function in the core program.



ifThenElse cond thenFunc elseFunc:
Selects between the two functions thenFunc and elseFunc depending on
whether the condition cond is true or false.



Whileloop
while cont body :: state > state:
 state is the type of the state.
 cont determines whether or not to continue based on the current state.
 body computes the next state from the current state.
 The result is a function from initial state to final state.



Parallel array
parallel l ixf:
 l is the length of the resulting array (outermost level).
 ifx is a function that maps each index in the range [0 .. l1] to its
element.
Since there are no dependencies between the elements, the compiler is free to
compute the elements in any order, or even in parallel.



Types that represent core language programs
  Instances  Computable a => Program a  (Computable a, Computable b, Computable c, Computable d, Computable e) => Program (a > b > c > d > e)  (Computable a, Computable b, Computable c, Computable d) => Program (a > b > c > d)  (Computable a, Computable b, Computable c) => Program (a > b > c)  (Computable a, Computable b) => Program (a > b)  (Computable a, Computable b) => Program (a, b)  (Computable a, Computable b, Computable c) => Program (a, b, c)  (Computable a, Computable b, Computable c, Computable d) => Program (a, b, c, d) 




Shows the core code generated by the program.



Shows the core code with size information as comments.



printCore = putStrLn . showCore 


printCoreWithSize = putStrLn . showCoreWithSize 

module Feldspar.Core.Functions 



Produced by Haddock version 2.6.1 