Laws for instances of Commutative.

Includes the following law:

a <> b == b <> a

Note that the following superclass laws are not included:

• semigroupLaws

Laws for instances of Reductive.

Includes the following laws:

a </> b == stripPrefix b a

a </> b == stripSuffix b a

maybe a (b <>) (a </> b) == a

maybe a (<> b) (a </> b) == a

Note that the following superclass laws are not included:

• commutativeLaws
• leftReductiveLaws
• rightReductiveLaws

Laws for instances of LeftReductive.

Includes the following laws:

a `isPrefixOf` (a <> b)

isPrefixOf a b == isJust (stripPrefix a b)

maybe b (a <>) (stripPrefix a b) == b

Note that the following superclass laws are not included:

• semigroupLaws

Laws for instances of RightReductive.

Includes the following laws:

b `isSuffixOf` (a <> b)

isSuffixOf a b == isJust (stripSuffix a b)

maybe b (<> a) (stripSuffix a b) == b

Note that the following superclass laws are not included:

• semigroupLaws

Laws for instances of Cancellative.

Includes the following laws:

(a <> b) </> a == Just b

(a <> b) </> b == Just a

Note that the following superclass laws are not included:

• leftCancellativeLaws
• rightCancellativeLaws
• reductiveLaws

Laws for instances of LeftCancellative.

Includes the following law:

stripPrefix a (a <> b) == Just b

Note that the following superclass laws are not included:

• leftReductiveLaws

Laws for instances of RightCancellative.

Includes the following law:

stripSuffix b (a <> b) == Just a

Note that the following superclass laws are not included:

• rightReductiveLaws