Tries for Polynomials
Summary
This post surveys how to represent and compute with polynomials in Haskell, from simple power-series and finite coefficient lists to a trie-based representation. It discusses Horner’s rule for efficient evaluation, multiple variable handling, division via lenses, and the path toward Gröbner bases, with practical code sketches and design trade-offs.