Arithmetic on Continued Fractions

Gosper developed algorithms for adding, subtracting, multiplying, or dividing two CFs, and for solving quadratics with CF coefficients, getting a CF as the result. A straightforward implementation of these algorithms can lead to infinite loops; here, we present modified versions of those algorithms that avoid all difficulties with infinite loops. We have implemented these algorithms in Haskell.