The F# Journal just published an article:
"This series of articles look at the design and implementation of a simple library that allows polynomials to be represented and manipulated using arithmetic operators. Various internal representations are examined including their performance. Interestingly, impure internal representations prove to have competitive performance even though they do not support incremental operations. The implications of this observation for purely functional data structures are discussed..."