## nimber

## monte-carlo

Our great sponsors

- Onboard AI - Learn any GitHub repo in 59 seconds
- InfluxDB - Collect and Analyze Billions of Data Points in Real Time
- SaaSHub - Software Alternatives and Reviews

nimber | monte-carlo | |
---|---|---|

0 | 0 | |

2 | 39 | |

- | - | |

0.0 | 0.0 | |

over 4 years ago | over 4 years ago | |

Haskell | Haskell | |

BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |

**mentions**indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.

**Stars**- the number of stars that a project has on GitHub.

**Growth**- month over month growth in stars.

**Activity**is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.

For example, an activity of

**9.0**indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

## nimber

**reviews of nimber**. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning nimber yet.

Tracking mentions began in Dec 2020.

## monte-carlo

**reviews of monte-carlo**. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning monte-carlo yet.

Tracking mentions began in Dec 2020.

## What are some alternatives?

**hmatrix**
- Linear algebra and numerical computation

**linear**
- Low-dimensional linear algebra primitives for Haskell.

**algebra**
- constructive abstract algebra

**hblas**
- haskell bindings for blas and lapack

**diagrams-solve**
- Miscellaneous solver code for diagrams (low-degree polynomials, tridiagonal matrices)

**nats**
- Haskell 98 Natural Numbers

**hTensor**
- Multidimensional arrays and simple tensor computations

**vector**
- An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework .

**hgeometry**
- HGeometry is a library for computing with geometric objects in Haskell. It defines basic geometric types and primitives, and it implements some geometric data structures and algorithms. The main two focusses are: (1) Strong type safety, and (2) implementations of geometric algorithms and data structures that have good asymptotic running time guarantees.

**fast-math**
- Play fast and loose with IEEE-754 rewrite RULES

**linear-accelerate**
- Instances to mix linear with accelerate

**math-functions**
- Special mathematical functions