std.semigroup
Implementation of the Applicative
type
Types
#[implicit]
type Semigroup a = { append : a -> a -> a }
Semigroup a
represents an associative operation on a
.
This means the following laws must hold:
forall x . append x (append y z) == append (append x y) z
Values
Note
- Known as
(<>)
ormappend
in Haskell