Manuel Bärenz

Yes, it unfortunately depends on how fast the GHC IO machine is running. Basically, if there is an IO delay that is too big then an action may fail to...

I don't have a good solution for this other than deprecating the `MonadSchedule IO` instance. I'll have to think about this. For the time being, your workaround should be replacing...

I'm afraid this is a known and poorly documented issue in `monad-schedule`. A workaround would be using https://hackage.haskell.org/package/monad-schedule-0.2.0.1/docs/Control-Monad-Schedule-FreeAsync.html. For example: ``` ghci> runFreeAsync $ runScheduleIO $ Data.Automaton.reactimate $ scheduleList (a300...

Hah I was mistaken luckily. There is a rare race condition in `schedulePair` when two clocks are supposed to tick at exactly the same time. I'll publish a fix later.

I had hoped that #343 had fixed this. @DISTEL100 What ghc version are you on? Can you clone the `rhine` repository and run `cabal test all`?

See #377 for an in-depth discussion of the probable underlying issue.

> 1. By `StochasticProcess`, do you mean a ClSF? Yes. > If so, why is it not just `model :: StochasticProcess () a`? The first type argument to `StochasticProcess` is...

> So, to summarize, is the idea that we should use a Moore machine (roughly, but more specifically a resampling buffer) as our filter, since it is naturally asynchronous? That...

> ```haskell > asyncPF :: (MonadDistribution m) => Behavior (PopulationT m) cl a b -> ResamplingBuffer m cl1 cl2 b [(a, Log Double)] > ``` I didn't read the type...

I guess this can be implemented, but what does it mean? I'm a bit puzzled how we construct a `ResamplingBuffer (PopulationT m) cl1 cl2 a b`. It has to condition...