involutive-semigroups VS acts

Compare involutive-semigroups vs acts and see what are their differences.

involutive-semigroups

Semigroups with involution. (by nosewings)

acts

Haskell library for semigroup actions and torsors (by sheaf)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
involutive-semigroups acts
- -
0 56
- -
0.0 2.9
over 3 years ago 2 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License BSD 3-clause "New" or "Revised" License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

involutive-semigroups

Posts with mentions or reviews of involutive-semigroups. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning involutive-semigroups yet.
Tracking mentions began in Dec 2020.

acts

Posts with mentions or reviews of acts. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning acts yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing involutive-semigroups and acts you can also consider the following projects:

interval-algebra - A Haskell implementation of Allen's interval algebra

multi-instance - Multiple typeclass instances, selected by explicit application of a phantom type parameter

group-theory - The theory of groups

tropical-geometry - Haskell Library for Tropical Geometry

partial-semigroup - A partial binary associative operator (appendMaybe :: a → a → Maybe a)

algebraic-graphs - Algebraic graphs

semilattices - join and meet semilattices, lower and upper bounds.

sparse-tensor - typesafe implementation of tensor algebra in Haskell

linear-tests - tests for Matrix.Linear Haskell library. Includes Arbitrary instances and property tests