Search results

identity :: forall a t. Category a => a t t
P purescript-prelude M Control.Category
identity :: forall c a. HasIdentity c => ObjectOf c a => c a a
P purescript-subcategory M Control.Subcategory.HasIdentity
introduce :: forall v s c. HasIntroduce c s => ObjectOf c v => c s v
P purescript-subcategory M Control.Subcategory.HasIntroduce
reflect :: forall v p c. Reflexive c p => ObjectOf c v => p v v
P purescript-subcategory M Control.Subcategory.Relation.Reflexive
terminate :: forall v u c. HasTerminate c u => ObjectOf c v => c v u
P purescript-subcategory M Control.Subcategory.HasTerminate
idiot :: forall a t. Category a => a t t

I combinator - identity bird

SKK

Λ a . a → a

λ x . x

P purescript-birds M Aviary.Birds
negate :: forall k s. RingCat k s => k s s
P purescript-dual-numbers M Data.Number.Dual
poly :: forall p a b. Profunctor p => Unital Function Unit Void Unit p => p a b
P purescript-monoidal M Data.Bifunctor.Monoidal.Specialized
poly :: forall b a p. Unital Function Unit Void Unit p => p a b
P purescript-profunctor-extra M Data.Profunctor.Monoidal
ppure :: forall p a. Profunctor p => Unital Function Unit Unit Unit p => Strong p => p a a
P purescript-monoidal M Data.Bifunctor.Monoidal.Specialized
ppure :: forall a p. Unital Function Unit Unit Unit p => Strong p => p a a
P purescript-profunctor-extra M Data.Profunctor.Monoidal
recip :: forall k s. DivisionRingCat k s => k s s
P purescript-dual-numbers M Data.Number.Dual
terminal :: forall t i p a. Cartesian t i p => p a i
P purescript-monoidal M Control.Category.Tensor
bottom :: forall a. Bounded a => a
P purescript-prelude M Data.Bounded
ff :: forall a. HeytingAlgebra a => a
P purescript-prelude M Data.HeytingAlgebra
genericBottom :: forall a rep. Generic a rep => GenericBottom rep => a

A Generic implementation of the bottom member from the Bounded type class.

P purescript-prelude M Data.Bounded.Generic
genericBottom' :: forall a. GenericBottom a => a
P purescript-prelude M Data.Bounded.Generic
genericFF :: forall a rep. Generic a rep => GenericHeytingAlgebra rep => a

A Generic implementation of the ff member from the HeytingAlgebra type class.

P purescript-prelude M Data.HeytingAlgebra.Generic
genericFF' :: forall a. GenericHeytingAlgebra a => a
P purescript-prelude M Data.HeytingAlgebra.Generic
genericMempty :: forall a rep. Generic a rep => GenericMonoid rep => a

A Generic implementation of the mempty member from the Monoid type class.

P purescript-prelude M Data.Monoid.Generic
genericMempty' :: forall a. GenericMonoid a => a
P purescript-prelude M Data.Monoid.Generic
genericOne :: forall a rep. Generic a rep => GenericSemiring rep => a

A Generic implementation of the one member from the Semiring type class.

P purescript-prelude M Data.Semiring.Generic
genericOne' :: forall a. GenericSemiring a => a
P purescript-prelude M Data.Semiring.Generic
genericTop :: forall a rep. Generic a rep => GenericTop rep => a

A Generic implementation of the top member from the Bounded type class.

P purescript-prelude M Data.Bounded.Generic
genericTop' :: forall a. GenericTop a => a
P purescript-prelude M Data.Bounded.Generic
genericTT :: forall a rep. Generic a rep => GenericHeytingAlgebra rep => a

A Generic implementation of the tt member from the HeytingAlgebra type class.

P purescript-prelude M Data.HeytingAlgebra.Generic
genericTT' :: forall a. GenericHeytingAlgebra a => a
P purescript-prelude M Data.HeytingAlgebra.Generic
genericZero :: forall a rep. Generic a rep => GenericSemiring rep => a

A Generic implementation of the zero member from the Semiring type class.

P purescript-prelude M Data.Semiring.Generic
genericZero' :: forall a. GenericSemiring a => a
P purescript-prelude M Data.Semiring.Generic
mempty :: forall m. Monoid m => m
P purescript-prelude M Data.Monoid
one :: forall a. Semiring a => a
P purescript-prelude M Data.Semiring
top :: forall a. Bounded a => a
P purescript-prelude M Data.Bounded
tt :: forall a. HeytingAlgebra a => a
P purescript-prelude M Data.HeytingAlgebra
zero :: forall a. Semiring a => a
P purescript-prelude M Data.Semiring
empty :: forall f a. Plus f => f a
P purescript-control M Control.Plus
crash :: forall a. Partial => a

A partial function which crashes on any input with a default message.

P purescript-partial M Partial
none :: forall f a. Unfoldable f => f a

The container with no elements - unfolded with zero iterations. For example:

none == ([] :: Array Unit)
P purescript-unfoldable M Data.Unfoldable
genBoundedEnum :: forall m a. MonadGen m => BoundedEnum a => m a

Create a random generator for a finite enumeration.

P purescript-enums M Data.Enum.Gen
conquer :: forall f a. Divisible f => f a
P purescript-contravariant M Data.Divisible
ask :: forall r m. MonadAsk r m => m r
P purescript-transformers M Control.Monad.Reader.Class
get :: forall m s. MonadState s m => m s

Get the current state.

P purescript-transformers M Control.Monad.State.Class
never :: forall e f m a. MonadBracket e f m => m a
P purescript-fork M Control.Monad.Fork.Class
nil :: forall f a. Alignable f => f a
P purescript-these M Data.Align
undefined :: forall a. a
P purescript-typelevel M Data.Typelevel.Undefined
all :: forall a. All a => a
P purescript-css M CSS.Common
auto :: forall a. Auto a => a
P purescript-css M CSS.Common
baseline :: forall a. Baseline a => a
P purescript-css M CSS.Common
bottom :: forall a. Bottom a => a
P purescript-css M CSS.Common
center :: forall a. Center a => a
P purescript-css M CSS.Common
flexEnd :: forall a. FlexEnd a => a
P purescript-css M CSS.Flexbox