Hoogle Search

Within LTS Haskell 24.55 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. checkStep :: Ord ex => [Rule ex] -> [ex] -> Step ex -> Bool

   swish	Swish.Proof

   A proof step is valid if rule is in list of rules and the antecedents are sufficient to obtain the conclusion and the antecedents are in the list of formulae already proven. Note: this function depends on the ruleName of any rule being unique among all rules. In particular the name of the step rule being in correspondence with the name of one of the indicated valid rules of inference.

2. type RDFProofStep = Step RDFGraph

   swish	Swish.RDF.Proof

   A step in an RDF proof.

3. makeRDFProofStep :: RDFRule -> [RDFFormula] -> RDFFormula -> RDFProofStep

   swish	Swish.RDF.Proof

   Make an RDF graph proof step.

4. _stepdrop :: Time -> Pattern a -> Pattern a

   tidal	Sound.Tidal.Boot

   No documentation available.

5. hasSteps :: Pattern a -> Bool

   tidal	Sound.Tidal.Boot

   No documentation available.

6. keepSteps :: Pattern a -> Pattern b -> Pattern b

   tidal	Sound.Tidal.Boot

   No documentation available.

7. permstep :: RealFrac b => Int -> [a] -> Pattern b -> Pattern a

   tidal	Sound.Tidal.Boot

   No documentation available.

8. setSteps :: Maybe Rational -> Pattern a -> Pattern a

   tidal	Sound.Tidal.Boot

   No documentation available.

9. setStepsFrom :: Pattern b -> Pattern a -> Pattern a

   tidal	Sound.Tidal.Boot

   No documentation available.

10. withSteps :: (Rational -> Rational) -> Pattern a -> Pattern a

    tidal	Sound.Tidal.Boot

    No documentation available.

Page 103 of many | Previous | Next