Safe Haskell | None |
---|---|
Language | Haskell2010 |
FRP.Yampa.LTLFuture
Description
Linear Temporal Logics based on SFs.
This module contains a definition of LTL with Next on top of Signal Functions.
LTL predicates are parameterized over an input. A basic proposition is a Signal Function that produces a boolean function.
Synopsis
- data TPred a where
- evalT :: TPred a -> SignalSampleStream a -> Bool
Documentation
Type representing future-time linear temporal logic predicates with until and next.
Constructors
Prop :: SF a Bool -> TPred a | |
And :: TPred a -> TPred a -> TPred a | |
Or :: TPred a -> TPred a -> TPred a | |
Not :: TPred a -> TPred a | |
Implies :: TPred a -> TPred a -> TPred a | |
Always :: TPred a -> TPred a | |
Eventually :: TPred a -> TPred a | |
Next :: TPred a -> TPred a | |
Until :: TPred a -> TPred a -> TPred a |