Safe Haskell | None |
---|

`AUTHOR`

- Dr. Alistair Ward
`DESCRIPTION`

- Describes a
*monic polynomial; <http:**en.wikipedia.org*wiki/Monic_polynomial#Classifications>; ie. in which the*coefficient*of the*leading term*is one.

- data MonicPolynomial c e
- mkMonicPolynomial :: (Eq c, Num c, Ord e, Show c, Show e) => Polynomial c e -> MonicPolynomial c e

# Types

## Data-types,

data MonicPolynomial c e Source

A type of `Polynomial`

, in which the *leading term* is required to have a *coefficient* of one.

(Eq c, Eq e) => Eq (MonicPolynomial c e) | |

(Show c, Show e) => Show (MonicPolynomial c e) | |

(Eq c, Num c, Num e, Ord e, Show c, Show e) => Ring (MonicPolynomial c e) | |

(Ring (MonicPolynomial c e), Eq c, Num c, Num e, Ord e, Show c, Show e) => QuotientRing (MonicPolynomial c e) |

# Functions

## Constructors

mkMonicPolynomial :: (Eq c, Num c, Ord e, Show c, Show e) => Polynomial c e -> MonicPolynomial c eSource

Smart constructor. Constructs an arbitrary *monic polynomial*.