FRP.Dunai.LTLFuture

Temporal Logics based on SFs

data TPred m a where

Type representing future-time linear temporal logic with until and next.

Constructors

Prop :: MSF m a Bool -> TPred m a

And :: TPred m a -> TPred m a -> TPred m a

Or :: TPred m a -> TPred m a -> TPred m a

Not :: TPred m a -> TPred m a

Implies :: TPred m a -> TPred m a -> TPred m a

Always :: TPred m a -> TPred m a

Eventually :: TPred m a -> TPred m a

Next :: TPred m a -> TPred m a

Until :: TPred m a -> TPred m a -> TPred m a

tPredMap :: Monad m => (MSF m a Bool -> m (MSF m a Bool)) -> TPred m a -> m (TPred m a)

Apply a transformation to the leaves (to the SFs)

Temporal Evaluation

evalT :: Monad m => TPred (ReaderT DTime m) a -> SignalSampleStream a -> m Bool

Evaluates a temporal predicate at time T=0 against a sample stream.

Returns True if the temporal proposition is currently true.

tauApp :: forall m a. Monad m => TPred (ReaderT DTime m) a -> (DTime, a) -> m (TPred (ReaderT DTime m) a)

myHead :: [a] -> a