úÎ!UG%      !"#$Safe479_C  simple-ltl "¤, or "true"  simple-ltl "¥, or "false" simple-ltlNegate a formula: ¬ p simple-ltlBoolean conjunction: "' simple-ltlBoolean disjunction: "( simple-ltl¥Given an input element, provide a formula to determine its truth. These can be nested, making it possible to have conditional formulas. Consider the following: *always (accept (n -> next (eq (succ n)))) lOne way to read this would be: "for every input n, always accept n if its next element is the successor". simple-ltlThe opposite in meaning to #, defined simply as 'neg . accept'. simple-ltl?The "next" temporal modality, typically written 'X p' or '%ï p'. simple-ltl9The "until" temporal modality, typically written 'p U q'. simple-ltl Weak until. simple-ltlRelease, the dual of . simple-ltlStrong release. simple-ltlLogical implication: p !’ q simple-ltl?Eventually the formula will hold, typically written F p or %Ç p. simple-ltl;Always the formula must hold, typically written G p or %¡ p. simple-ltl*True if the given Haskell boolean is true. simple-ltl1True if the given predicate on the input is true. simple-ltlAnother name for . simple-ltl"Check for equality with the input. simple-ltl Render a   result as a string.      %       !"#$%'simple-ltl-2.1.0-G46H2arOvlIHdtKcRKO2UcLTLResultReason HitBottomRejected BothFailed LeftFailed RightFailedMachinestepruntopbottomnegandoracceptrejectnextuntil weakUntilrelease strongReleaseimplies eventuallyalwaystruthistesteq showResult$fFunctorMachine $fShowReason$fGenericReason$fNFDataReason$fFunctorReason