multi-instance alternatives and similar packages

Based on the "Algebra" category.
Alternatively, view multi-instance alternatives based on common mentions on social networks and blogs.

algebraic-graphs

9.9 5.6 multi-instance VS algebraic-graphs

Algebraic graphs
group-theory

8.5 6.6 multi-instance VS group-theory

The theory of groups

Run Linux Software Faster and Safer than Linux with Unikernels

Promo github.com/nanovms

cl3

8.3 0.0 multi-instance VS cl3

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

8.1 0.0 multi-instance VS semilattices

join and meet semilattices, lower and upper bounds.
acts

8.1 1.1 multi-instance VS acts

Haskell library for semigroup actions and torsors
partial-semigroup

6.4 0.0 multi-instance VS partial-semigroup

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

5.3 0.0 multi-instance VS sparse-tensor

typesafe implementation of tensor algebra in Haskell
tropical-geometry

4.4 0.0 multi-instance VS tropical-geometry

Haskell Library for Tropical Geometry
groups-generic

3.5 0.0 multi-instance VS groups-generic

Derive Group instances using generics (Haskell library)
csa

2.6 0.0 multi-instance VS csa

Connection-set algebra library
interval-algebra

2.6 0.0 multi-instance VS interval-algebra

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

1.7 0.0 multi-instance VS linear-tests

tests for Matrix.Linear Haskell library. Includes Arbitrary instances and property tests
cl3-hmatrix-interface

1.1 0.0 multi-instance VS cl3-hmatrix-interface

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

1.1 0.0 multi-instance VS cl3-linear-interface

An interface to/from the Cl3 and Linear libraries
involutive-semigroups

1.0 0.0 multi-instance VS involutive-semigroups

Semigroups with involution.

Do you think we are missing an alternative of multi-instance or a related project?

Add another 'Algebra' Package

README

multi-instance

Alternative versions of common typeclasses, augmented with a phantom type parameter x. The purpose of this is to deal with the case where a type has more than one candidate instance for the original, unaugmented class.

Example: Integer sum and product

The canonical example of this predicament is selecting the monoid instance for a type which forms a ring (and thus has at least two strong candidates for selection as the monoid), such as Integer. This therefore gives rise to the Sum and Product newtype wrappers, corresponding to the additive and multiplicative monoids respectively.

The traditional fold-based summation of a list of integers looks like this:

>>> import Data.Foldable (fold)
>>> import Data.Monoid (Sum (..))
>>> getSum (fold [Sum 2, Sum 3, Sum 5]) :: Integer
10

By replacing fold with multi'fold, whose constraint is MultiMonoid rather than Data.Monoid.Monoid, we can write the same thing without the newtype wrapper:

>>> :set -XFlexibleContexts -XTypeApplications
>>> multi'fold @Addition [2, 3, 5] :: Integer
10

multi-instance

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

multi-instance alternatives and similar packages

README

multi-instance

Example: Integer sum and product