[<<][meta][>>][..]
Fri Feb 26 10:07:29 CET 2010

Lucid and Streams in Haskell

Basic idea: what I want to do is:
  - stream processing
  - nested (truncated) stream processing
  - add local function optimizations (i.e. lookup tables)

Maybe it's best to implement most of those in plain Haskell and see
how they can be tranformed to state-space models and iterative loops?
I don't have enough intuition about what is already possible with the
available tools.

From [2]:

fby :: [a] -> [a] -> [a]
x `fby` y = head x : y 

Anyways.  Given a rational function 1 / 1 + z how can this be
translated to a stream?  Essentially, how do you represent a
difference equation?  That seems to be the problem to solve.


[1] http://www.haskell.org/haskellwiki/Lucid
[2] http://www.haskell.org/sitewiki/images/2/21/Lucid.lhs



[Reply][About]
[<<][meta][>>][..]