numeric-prelude-0.1.1: An experimental alternative hierarchy of numeric type classesSource codeContentsIndex
Number.ResidueClass.Maybe
Synopsis
data T a = Cons {
modulus :: !(Maybe a)
representative :: !a
}
(/:) :: C a => a -> a -> T a
matchMaybe :: Maybe a -> Maybe a -> Maybe a
isCompatibleMaybe :: Eq a => Maybe a -> Maybe a -> Bool
isCompatible :: Eq a => T a -> T a -> Bool
lift2 :: Eq a => (a -> a -> a -> a) -> (a -> a -> a) -> T a -> T a -> T a
Documentation
data T a Source

Here we try to provide implementations for zero and one by making the modulus optional. We have to provide non-modulus operations for the cases where both operands have Nothing modulus. This is problematic since operations like '(/)' depend essentially on the modulus.

A working version with disabled zero and one can be found ResidueClass.

Constructors
Cons
modulus :: !(Maybe a)the modulus can be Nothing to denote a generic constant like zero and one which could not be bound to a specific modulus so far
representative :: !a
show/hide Instances
(Eq a, C a, C a) => Eq (T a)
Read a => Read (T a)
Show a => Show (T a)
(Eq a, C a) => C (T a)
(Eq a, C a) => C (T a)
(/:) :: C a => a -> a -> T aSource
r /: m is the residue class containing r with respect to the modulus m
matchMaybe :: Maybe a -> Maybe a -> Maybe aSource
isCompatibleMaybe :: Eq a => Maybe a -> Maybe a -> BoolSource
isCompatible :: Eq a => T a -> T a -> BoolSource
Check if two residue classes share the same modulus
lift2 :: Eq a => (a -> a -> a -> a) -> (a -> a -> a) -> T a -> T a -> T aSource
Produced by Haddock version 2.4.2