dfaa1e7 · type-level-sets

src/Data/Type/Set.hs+3−3

@@ -1,7 +1,7 @@

1{-# LANGUAGE GADTs, DataKinds, KindSignatures, TypeOperators, TypeFamilies,

2 MultiParamTypeClasses, FlexibleInstances, PolyKinds,

3 FlexibleContexts, UndecidableInstances, ConstraintKinds,

4− ScopedTypeVariables #-}

4+ ScopedTypeVariables, TypeInType #-}

5

6module Data.Type.Set (Set(..), Union, Unionable, union, quicksort, append,

7 Sort, Sortable, (:++), Split(..), Cmp, Filter, Flag(..),

@@ -16,7 +16,7 @@ import Data.Type.Equality

16data Proxy (p :: k) = Proxy

17

18-- Value-level 'Set' representation, essentially a list

19−data Set (n :: [k]) :: * where

19+data Set (n :: [k]) where

20 {--| Construct an empty set -}

21 Empty :: Set '[]

22 {--| Extend a set with an element -}

@@ -233,4 +233,4 @@ type family MemberP a s :: Bool where

233 MemberP a (a ': s) = True

234 MemberP a (b ': s) = MemberP a s

235

236−type NonMember a s = MemberP a s ~ False

236+type NonMember a s = MemberP a s ~ False

stack.yaml+1−1

@@ -1,7 +1,7 @@

1# For more information, see: https://github.com/commercialhaskell/stack/wiki/stack.yaml

2

3# Specifies the GHC version and set of packages available (e.g., lts-3.5, nightly-2015-09-21, ghc-7.10.2)

4−resolver: lts-11.5

4+resolver: lts-12.7

5

6# Local packages, usually specified by relative directory name

7packages:

type-level-sets.cabal+1−1

@@ -1,5 +1,5 @@

1name: type-level-sets

2−version: 0.8.8.0

2+version: 0.8.9.0

3synopsis: Type-level sets and finite maps (with value-level counterparts)

4description:

5 This package provides type-level sets (no duplicates, sorted to provide a normal form) via 'Set' and type-level