Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
type FunctorAssumptions f = (Representable f, Traversable f, NFData (Rep f), Binary (Rep f), Ord (Rep f)) Source #
type StepFunctionAssumptions a f ctx = (Symbolic ctx, BaseField ctx ~ a, FieldElement ctx ~ f) Source #
type StepFunction a i p = forall f ctx. StepFunctionAssumptions a f ctx => i f -> p f -> i f Source #