Hoogle Search
Within LTS Haskell 24.33 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.IntMap.Strict.Refined Proof that r contains an element of type a.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.IntMap.Strict.Refined The element that is guaranteed to be in r
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.IntSet.Refined Proof that r contains an element of type a.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.IntSet.Refined The element that is guaranteed to be in r
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.Map.Refined Proof that r contains an element of type a.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.Map.Refined The element that is guaranteed to be in r
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.Map.Strict.Refined Proof that r contains an element of type a.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.Map.Strict.Refined The element that is guaranteed to be in r
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.Set.Refined Proof that r contains an element of type a.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.Set.Refined The element that is guaranteed to be in r