name:                 lfst
version:              1.0.2
synopsis:             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 Goguen, Joseph A. "L-fuzzy sets." Journal of mathematical analysis and applications 18.1 (1967). 
license:              GPL-3
license-file:         LICENSE
homepage:             https://github.com/ci-fst/lfst
author:               Marco Di Pietro, Claudio Greco, Corrado Mencar, Alessandro Suglia
maintainer:           Marco Di Pietro, Claudio Greco, Corrado Mencar, Alessandro Suglia
bug-reports:          http://github.com/ci-fst/lfst.git/issues
category:             Math          
build-type:           Simple
cabal-version:        >=1.10
tested-with:          GHC==7.10.3
                      
source-repository head
  type: git
  location: git://github.com/ci-fst/lfst.git

library
  exposed-modules:  Algebra.LFST.FuzzySet,
                    Algebra.LFST.Membership
  build-depends:    base >= 4.7 && < 5,
                    containers >= 0.5,
                    lattices >= 1.5,
                    doctest >= 0.10
  default-language: Haskell2010

test-suite doctests
  type:          exitcode-stdio-1.0
  ghc-options:   -threaded
  hs-source-dirs: test
  main-is:       DocTests.hs
  build-depends: base >= 4.7 && < 5,
                 doctest >= 0.10,
                 QuickCheck >= 2.8.2
  default-language:     Haskell2010