csa alternatives and similar packages
Based on the "Algebra" category.
Alternatively, view csa alternatives based on common mentions on social networks and blogs.
-
cl3
Haskell Library implementing standard functions for the Algebra of Physical Space Cl(3,0) -
partial-semigroup
A partial binary associative operator (appendMaybe :: a → a → Maybe a) -
multi-instance
Multiple typeclass instances, selected by explicit application of a phantom type parameter -
interval-algebra
A Haskell implementation of Allen's interval algebra -
groups-generic
Derive Group instances using generics (Haskell library) -
cl3-linear-interface
An interface to/from the Cl3 and Linear libraries -
cl3-hmatrix-interface
An interface to/from the Cl3 and HMatrix libraries -
linear-tests
tests for Matrix.Linear Haskell library. Includes Arbitrary instances and property tests
Collect and Analyze Billions of Data Points in Real Time
Do you think we are missing an alternative of csa or a related project?
Popular Comparisons
README
Connection-set algebra (CSA) library
A library for constructing connection matrices between two collections of elements. Inspired by Mikael Djurfeldt's article from 2012 (Neuroinformatics).
Introduction
Connection-set algebra is a powerful algebra for describing connections between two elements. This library provides a syntax tree for modeling the set operations, as well as a means to transform the operations into adjacency matrices.
Installation
This is a library and not an executable.
Clone the repository, enter it and run stack build
(requires stack).
Connection-set algebra (CSA)
Say that you have two nodes that connect to each other. In a adjacency matrix this can be described as a full connection like so:
1 2
+ ———
1 | 1 1
2 | 1 1
In CSA this is simply an AllToAll
connection.
Similarly a OneToOne
connection describes the following adjacency matrix:
1 2
+ ———
1 | 1 0
2 | 0 1
And here is the algebra part: If we say AllToAll - OneToOne
we get:
1 2
+ ———
1 | 0 1
2 | 1 0
Contact
Jens Egholm [email protected]