lfst alternatives and similar packages
Based on the "Math" category.
Alternatively, view lfst alternatives based on common mentions on social networks and blogs.
-
-
vector
An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework . -
statistics
A fast, high quality library for computing with statistics in Haskell. -
-
HerbiePlugin
GHC plugin that improves Haskell code's numerical stability -
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. -
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 -
-
-
mwc-random
A very fast Haskell library for generating high quality pseudo-random numbers. -
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) -
cf
"Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct) -
-
optimization
Some numerical optimization methods implemented in Haskell -
equational-reasoning
Agda-style equational reasoning in Haskell -
safe-decimal
Safe and very efficient arithmetic operations on fixed decimal point numbers -
monoid-subclasses
Subclasses of Monoid with a solid theoretical foundation and practical purposes -
eigen
Haskel binding for Eigen library. Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. -
modular-arithmetic
A useful type for working with integers modulo some constant.
Collect and Analyze Billions of Data Points in Real Time
* 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 lfst or a related project?
|
Learn any GitHub repo in 59 seconds
sponsored
getonboard.dev
|
Popular Comparisons
-
hmatrixvshmatrix-repa
-
hmatrixvshTensor
-
Xorshift128Plusvsmonoid-subclasses
-
arrayfirevseigen
-
magmavssubhask
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
lfst - L-Fuzzy Set Theory implementation in Haskell
Description
If X is a collection of objects denoted generically by x, then a fuzzy set F(A) in X is a set of ordered pairs. Each of them consists of an element x and a membership function which maps x to the membership space M. The current implementation is inspired by the work of J.A. Goguen L-Fuzzy Sets [1].
Setup
This library could be easily compiled using cabal issuing the command cabal build in the root directory.
Usage
Using this library you can easily apply the Extension Principle [2] in the following way:
let fuzzy_set = fromList [(-1, Godel 0.5), (0, Godel 0.8), (1, Godel 1.0), (2, Godel 0.4)]
fmap (^2) fuzzy_set
> FuzzySet {(0, Godel 0.8), (1, Godel 1.0), (4, Godel 0.4)}
Authors
All the following authors have equally contributed to this project (listed in alphabetical order by surname):
References
[1]: Goguen, Joseph A. "L-fuzzy sets." Journal of mathematical analysis and applications (1967)
[2]: Zadeh, Lotfi A. "Fuzzy sets." Information and control (1965)