Hoogle Search

Within LTS Haskell 24.50 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. (<+>) :: forall (is1 :: [Type]) (os1 :: [Type]) (is2 :: [Type]) (os2 :: [Type]) . Registry is1 os1 -> Registry is2 os2 -> Registry (is1 :++ is2) (os1 :++ os2)

   registry	Data.Registry.Registry

   Append 2 registries together

2. type family (x :: [k]) :++ (y :: [k]) :: [k]

   registry	Data.Registry.Solver

   Extracted from the typelevel-sets project and adapted for the Registry datatype This union deduplicates elements only if they appear in contiguously What we really want is typelevel sets but they are too slow for now https://github.com/dorchard/type-level-sets/issues/17

3. ( #+ ) :: MetaTerm -> MetaTerm -> MetaTerm

   rest-rewrite	DSL

   No documentation available.

4. (.+) :: RuntimeTerm -> RuntimeTerm -> RuntimeTerm

   rest-rewrite	DSL

   No documentation available.

5. type family (l :: Row k) .+ (r :: Row k) :: Row k

   row-types	Data.Row

   Type level Row append

6. (.+) :: forall (l :: Row Type) (r :: Row Type) . FreeForall l => Rec l -> Rec r -> Rec (l .+ r)

   row-types	Data.Row

   Record disjoint union (commutative)

7. pattern (:+) :: Disjoint l r => Rec l -> Rec r -> Rec (l .+ r)

   row-types	Data.Row

   A pattern version of record union, for use in pattern matching.

8. type family (l :: Row k) .+ (r :: Row k) :: Row k

   row-types	Data.Row.Internal

   Type level Row append

9. type family (l :: Row k) .+ (r :: Row k) :: Row k

   row-types	Data.Row.Records

   Type level Row append

10. (.+) :: forall (l :: Row Type) (r :: Row Type) . FreeForall l => Rec l -> Rec r -> Rec (l .+ r)

    row-types	Data.Row.Records

    Record disjoint union (commutative)

Page 59 of many | Previous | Next