cl3 VS involutive-semigroups

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

cl3

Haskell Library implementing standard functions for the Algebra of Physical Space Cl(3,0) (by waivio)

involutive-semigroups

Semigroups with involution. (by nosewings)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
cl3 involutive-semigroups
- -
57 0
- -
0.0 0.0
about 2 years ago over 3 years 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.

cl3

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

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

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.

What are some alternatives?

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

group-theory - The theory of groups

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

cl3-hmatrix-interface - An interface to/from the Cl3 and HMatrix libraries

acts - Haskell library for semigroup actions and torsors

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

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

csa - Connection-set algebra library

algebraic-graphs - Algebraic graphs

sparse-tensor - typesafe implementation of tensor algebra in Haskell