Safe Haskell | Safe |
---|---|

Language | Haskell2010 |

Free modules implemented as sorted lists of `(base,coeff)`

pairs.
The functions `coeff`

, `maxTerm`

, `split`

, `unsafeJoin`

are slow
in this implementation.

# Documentation

module Math.FreeModule.Class

Functor (FreeMod b) Source # | |

(Eq b, Eq c) => Eq (FreeMod b c) Source # | |

(Ord b, Ord c) => Ord (FreeMod b c) Source # | |

(Show b, Show c) => Show (FreeMod b c) Source # | |

(Ord b, Eq c, Num c) => FreeModule (FreeMod b c) Source # | |

(Pretty b, Ord b) => Pretty (FreeMod b Rational) Source # | |

(Pretty b, Ord b) => Pretty (FreeMod b Integer) Source # | |

(Pretty b, Ord b) => Pretty (FreeMod b Zp) Source # | |

type Base (FreeMod b c) Source # | |

type Coeff (FreeMod b c) Source # | |