| ||||
| ||||
| Description | ||||
| Free modules implemented as sorted lists of (base,coeff) pairs. The functions coeff, maxTerm, split, unsafeJoin are slow in this implementation. | ||||
| Documentation | ||||
| data FreeMod b c | ||||
| ||||
| type ZModule b = FreeMod b Integer | ||||
| type QModule b = FreeMod b Rational | ||||
| Produced by Haddock version 2.4.1 |