fadno-braids alternatives and similar packages
Based on the "Algebra" category.
Alternatively, view fadno-braids alternatives based on common mentions on social networks and blogs.
subhask9.8 0.0 fadno-braids VS subhaskType safe interface for working in subcategories of Hask
linear9.7 0.0 fadno-braids VS linearLow-dimensional linear algebra primitives for Haskell.
algebra9.2 0.0 fadno-braids VS algebraconstructive abstract algebra
semigroups9.1 0.0 fadno-braids VS semigroupsHaskell 98 semigroups
monoid-subclassesSubclasses of Monoid with a solid theoretical foundation and practical purposes
eigen7.9 0.0 L2 fadno-braids VS eigenHaskel binding for Eigen library. Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms.
linear-accelerateInstances to mix linear with accelerate
nats7.1 0.0 fadno-braids VS natsHaskell 98 Natural Numbers
agum5.0 0.0 fadno-braids VS agumUnification and Matching in an Abelian Group
clif4.8 0.0 fadno-braids VS clifA Clifford algebra number type for Haskell
clipper4.6 0.0 L1 fadno-braids VS clipperHaskell bindings for clipper
cayley-dickson4.6 0.0 fadno-braids VS cayley-dicksonCayley-Dickson constructions
finite-field4.2 0.0 fadno-braids VS finite-fieldFinite Fields
algebraic3.7 0.0 fadno-braids VS algebraicGeneral linear algebra structures for Haskell.
sign3.3 0.0 fadno-braids VS signArithmetic over signs and sets of signs
magma2.8 0.0 fadno-braids VS magmamagma algebraic library
simplex-basic2.8 0.0 fadno-braids VS simplex-basicA trivial implementation of the simplex algorithm.
linear-algebra-cblasHaskell BLAS bindings
metamorphic2.5 0.0 fadno-braids VS metamorphicmetamorphisms (aka playing with: (fold, (.), unfold)
Access the most powerful time series database as a service
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of fadno-braids or a related project?
fando-braids: Braid representations in Haskell
Braids represented as Haskell types with support for generation and transformations.
Braid b a is a typeclass over the braid rep itself and its value type. Since a goal of this library is to use braids for non-mathematical purposes (ie music composition), a Braid can be indexed over any
Integral type, to support braids representing pitch values in a register for instance.
All braids are represented using Artin generators as
Polarity defining the "power" of a generator as
Generator indexes differ from the literature in that they are generally 0-indexed whereas Artin generators are 1-indexed. However, again these braids can represent other ranges of numbers as branch indexes.
Artin creates canonical, "one-at-a-time", generator braids.
MultiGen creates "compressed", "many-at-a-time" braids.
DimBraid is for creating "padded" braids, since generators cannot express the absence of a cross.
bandGen creates Birman/Ko/Lee-style band generators. In addition, stylized braid builders like
terraceBraid are offered.
In addition to operations like
merge etc, the type
Move represents Reidemeister-type isotopy moves.
makeTree unfolds a potentially-infinite tree representing all possible applications of a move.
drawStrands allow drawings of braids, admitting extra functions for colorizing etc.