Functional Hack
Introduction
1.
Hack subset
2.
Naming conventions
3.
Effects
4.
Errors
5.
Steps preprocessor
6.
API
6.1.
Awkward
6.2.
Eq
6.3.
Eqs
6.4.
F
6.5.
IO
6.6.
Iso
6.7.
Monoid
6.8.
Monoids
6.9.
Option
6.10.
Semigroup
6.11.
Semigroups
6.12.
Supplies
6.13.
Supply
6.14.
Uninhabited
Powered by
GitBook
Functional Hack
Interface
FH\Semigroup<T>
Laws
Associativity
a
p
p
e
n
d
(
a
p
p
e
n
d
(
$
a
,
$
b
)
)
=
a
p
p
e
n
d
(
$
a
,
a
p
p
e
n
d
(
$
b
,
$
c
)
)
\mathtt{append(append(\$a, \$b))} = \mathtt{append(\$a, append(\$b, \$c))}
a
p
p
e
n
d
(
a
p
p
e
n
d
(
$
a
,
$
b
)
)
=
a
p
p
e
n
d
(
$
a
,
a
p
p
e
n
d
(
$
b
,
$
c
)
)
Instance methods
append(T $a, T $b): T
Associative binary operation.