lfst: L-Fuzzy Set Theory implementation in Haskell

[ gpl, library, math---------- ] [ Propose Tags ]

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 Goguen, Joseph A. "L-fuzzy sets." Journal of mathematical analysis and applications 18.1 (1967).


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 1.0.0, 1.0.1, 1.0.2
Dependencies base (>=4.7 && <5), containers (>=0.5), doctest (>=0.10), lattices (>=1.5) [details]
License GPL-3.0-only
Author Marco Di Pietro, Claudio Greco, Corrado Mencar, Alessandro Suglia
Maintainer Marco Di Pietro, Claudio Greco, Corrado Mencar, Alessandro Suglia
Category Math
Home page https://github.com/ci-fst/lfst
Bug tracker http://github.com/ci-fst/lfst.git/issues
Source repo head: git clone git://github.com/ci-fst/lfst.git
Uploaded by claudiogreco at 2016-03-12T12:00:22Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1791 total (8 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2016-03-12 [all 1 reports]