[Haskell-cafe] Sample rate inference

Henning Thielemann iakd0 at clusterf.urz.uni-halle.de
Thu Nov 11 09:46:58 EST 2004

On Thu, 11 Nov 2004, Andreas Bauer wrote:

> On Thu, Nov 11, 2004 at 10:49:13AM +0100, Henning Thielemann wrote:
> >  The computation sample rate should be propagated through the network as
> > follows:
> >   If in a component of equal sample rate some processors have the same
> > fixed sample rate, all uncertain processors must adapt that. 
> >   If some processors have different fixed sample rates this is an error. 
> >   If no processor has a fixed sample rate, the user must provide one
> > manually.
> >  To me this looks very similar to type inference.
> To me, it looks like "clock inference".  Just making sure: have you
> had a look at (yet another) functional language namely Lustre?

Sounds as if they want to synchronize event-driven processes, right? In my
case the signals are equidistantly sampled continuous functions. Agreeing
on a sample rate must be done before starting the processes. 

More information about the Haskell-Cafe mailing list