cf alternatives and similar packages
Based on the "Math" category.
Alternatively, view cf alternatives based on common mentions on social networks and blogs.

vector
An efficient implementation of Intindexed arrays (both mutable and immutable), with a powerful loop optimisation framework . 
statistics
A fast, high quality library for computing with statistics in Haskell. 
computationalalgebra
GeneralPurpose Computer Algebra System as an EDSL in Haskell 
mwcrandom
A very fast Haskell library for generating high quality pseudorandom numbers. 
dimensional
Dimensional library variant built on Data Kinds, Closed Type Families, TypeNats (GHC 7.8+). 
numhask
A haskell numeric prelude, providing a clean structure for numbers and operations that combine them. 
poly
Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent) 
safedecimal
Safe and very efficient arithmetic operations on fixed decimal point numbers 
eigen
Haskel binding for Eigen library. Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. 
monoidsubclasses
Subclasses of Monoid with a solid theoretical foundation and practical purposes 
diagramssolve
Miscellaneous solver code for diagrams (lowdegree polynomials, tridiagonal matrices)
Scout APM: A developer's best friend. Try free for 14days
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of cf or a related project?
README
CF
This package implements Gosper's algorithm for arithmetic on (often
infinite) continued fractions. This allows us to do arbitrary
precision calculations without deciding in advance how much precision
we need. Following Vuillemin, our continued fractions may contain zero
and negative terms, so that the functions in Floating
can be
supported.
The type CF
has instances for the following typeclasses.
Eq
Ord
Num
Fractional
RealFrac
Floating
(currently missingasin
,acos
,atan
)
Because equality of real numbers is not computable, we consider two
numbers ==
if they are closer than epsilon = 1 % 10^10
. For the
same reason, floor
and its cousins may give an incorrect result when
the argument is within epsilon
of an integer.
References
 Gosper, Ralph W. "Continued fraction arithmetic." HAKMEM Item 101B, MIT Artificial Intelligence Memo 239 (1972). APA
 Vuillemin, Jean E. "Exact real computer arithmetic with continued fractions." Computers, IEEE Transactions on 39.8 (1990): 10871105.
 Lester, David R. "Vuillemin’s exact real arithmetic." Functional Programming, Glasgow 1991. Springer London, 1992. 225238. APA