Popularity
8.2
Stable
Activity
2.1
Declining
45
4
5
Monthly Downloads: 106
Programming language: Haskell
License: BSD 3-clause "New" or "Revised" License
Tags:
Math
Latest version: v0.6.0.3
equational-reasoning alternatives and similar packages
Based on the "Math" category.
Alternatively, view equational-reasoning alternatives based on common mentions on social networks and blogs.
-
-
subhask
Type safe interface for working in subcategories of Hask -
vector
An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework . -
linear
Low-dimensional linear algebra primitives for Haskell. -
statistics
A fast, high quality library for computing with statistics in Haskell. -
what4
Symbolic formula representation and solver interaction library -
HerbiePlugin
GHC plugin that improves Haskell code's numerical stability -
-
dimensional
Dimensional library variant built on Data Kinds, Closed Type Families, TypeNats (GHC 7.8+). -
computational-algebra
General-Purpose Computer Algebra System as an EDSL in Haskell -
hermit
Haskell Equational Reasoning Model-to-Implementation Tunnel -
mwc-random
A very fast Haskell library for generating high quality pseudo-random numbers. -
matrix
A Haskell native implementation of matrices and their operations. -
-
numhask
A haskell numeric prelude, providing a clean structure for numbers and operations that combine them. -
vector-space
Vector & affine spaces, linear maps, and derivatives -
bayes-stack
Framework for Gibbs sampling of probabilistic models -
cf
"Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct) -
poly
Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent) -
-
optimization
Some numerical optimization methods implemented in Haskell -
-
monte-carlo
A Monte Carlo monad and transformer for Haskell. -
safe-decimal
Safe and very efficient arithmetic operations on fixed decimal point numbers -
sbvPlugin
Formally prove properties of Haskell programs using SBV/SMT. -
bed-and-breakfast
Matrix operations in 100% pure Haskell -
simple-smt
A simple way to interact with an SMT solver process. -
eigen
Haskel binding for Eigen library. Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. -
polynomial
Haskell library for manipulating and evaluating polynomials -
lambda-calculator
An introduction to the Lambda Calculus -
hTensor
Multidimensional arrays and simple tensor computations -
diagrams-solve
Miscellaneous solver code for diagrams (low-degree polynomials, tridiagonal matrices) -
vector-th-unbox
Deriver for unboxed vectors using Template Haskell -
vector-binary-instances
Instances for the Haskell Binary class, for the types defined in the popular vector package. -
manifold-random
Coordinate-free hypersurfaces as Haskell types
Scout APM: A developer's best friend. Try free for 14-days
Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.
Promo
scoutapm.com
* 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 equational-reasoning or a related project?
|
Run Linux Software Faster and Safer than Linux with Unikernels
sponsored
github.com/nanovms
|
Popular Comparisons
-
equational-reasoningvscontinued-fractions
-
equational-reasoningvsnimber
-
hmatrixvshmatrix-repa
-
hmatrixvshTensor
-
Xorshift128Plusvsmonoid-subclasses
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
Agda-style Equational Reasoning in Haskell by Data Kinds
What is this?
This library provides means to prove equations in Haskell. You can prove equations in Agda's EqReasoning like style.
See blow for an example:
plusZeroL :: SNat m -> Zero :+: m :=: m
plusZeroL SZero = Refl
plusZeroL (SSucc m) =
start (SZero %+ (SSucc m))
=== SSucc (SZero %+ m) `because` plusSuccR SZero m
=== SSucc m `because` succCongEq (plusZeroL m)
It also provides some utility functions to use an induction.
For more detail, please read source codes!
TODOs
- Automatic generation for induction schema for any inductive types.