homepage: ''
changelog-type: markdown
hash: e77fb58ad0856bba76944c134d683e7d205038aba6b7a30d1df8a9ebbdde1adc
test-bench-deps: {}
maintainer: coltharp@pdx.edu
synopsis: Semigroups with involution.
changelog: |
  # Changelog for involutive-semigroups

  ## 0.1.0.0 -- 2020-07-30

  * Initial release.
basic-deps:
  bytestring: '>=0.10.8.0 && <0.11'
  base: '>=4.12.0.0 && <4.15'
  text: '>=1.2.3.0 && <1.3'
  containers: '>=0.5.7.1 && <0.7'
  vector: '>=0.12.0.1 && <0.13'
all-versions:
- 0.1.0.0
author: Nicholas Coltharp
latest: 0.1.0.0
description-type: markdown
description: |
  A semigroup `S` is said to be *with involution* if it comes equipped with an
  "inverse-like" operation `rev`. Specifically, the following must hold for all `x
  y : S`:
  - `rev (rev x) = x`
  - `rev (x <> y) = rev y <> rev x.`

  `reverse` is the prototypical example. Any group inverse automatically satisfies
  these laws.
license-name: BSD-3-Clause

Update from Hackage at 2020-07-30T06:50:18Z
Update from Hackage at 2020-07-30T06:50:18Z
