Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. module Data.Parameterized.Pair

   This module defines a 2-tuple where both elements are parameterized over the same existentially quantified parameter.

2. data Pair (a :: k -> Type) (b :: k -> Type)

   parameterized-utils	Data.Parameterized.Pair

   Like a 2-tuple, but with an existentially quantified parameter that both of the elements share.

3. module Data.Parameterized.Peano

   This defines a type Peano and PeanoRepr for representing a type-level natural at runtime. These type-level numbers are defined inductively instead of using GHC.TypeLits. As a result, type-level computation defined recursively over these numbers works more smoothly. (For example, see the type-level function Repeat below.) Note: as in NatRepr, in UNSAFE mode, the runtime representation of these type-level natural numbers is Word64.

4. data Peano

   parameterized-utils	Data.Parameterized.Peano

   Unary representation for natural numbers

5. data PeanoRepr (n :: Peano)

   parameterized-utils	Data.Parameterized.Peano

   The run time value, stored as an Word64 As these are unary numbers, we don't worry about overflow.

6. data PeanoView (n :: Peano)

   parameterized-utils	Data.Parameterized.Peano

   When we have optimized the runtime representation, we need to have a "view" that decomposes the representation into the standard form.

7. type family Plus (a :: Peano) (b :: Peano) :: Peano

   parameterized-utils	Data.Parameterized.Peano

   Addition

8. class PolyEq u v

   parameterized-utils	Data.Parameterized.TH.GADT

   A polymorphic equality operator that generalizes TestEquality.

9. data PairS f s

   parameterized-utils	Data.Parameterized.Utils.BinTree

   A Strict pair

10. PairS :: f -> s -> PairS f s

    parameterized-utils	Data.Parameterized.Utils.BinTree

    No documentation available.

Page 464 of many | Previous | Next