adjunctions VS I1M

Compare adjunctions vs I1M and see what are their differences.

I1M

Código Haskell usado en el curso de I1M (Informática de 1º de Matemática) (by jaalonso)
Our great sponsors
  • Scout APM - Less time debugging, more time building
  • SonarQube - Static code analysis for 29 languages.
  • SaaSHub - Software Alternatives and Reviews
adjunctions I1M
0 0
38 4
- -
2.7 0.0
about 2 months ago about 1 year ago
Haskell HTML
BSD 3-clause "New" or "Revised" License GNU General Public License v2.0 only
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.

adjunctions

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

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

I1M

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

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

What are some alternatives?

When comparing adjunctions and I1M you can also consider the following projects:

miso - :ramen: A tasty Haskell front-end framework

fgl - A Functional Graph Library for Haskell

containers - Assorted concrete container types

graphite - Haskell graphs and networks library

parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

distributive - Dual Traversable

bookkeeper

graph-wrapper - A wrapper around the standard Data.Graph with a less awkward interface

haggle - An efficient graph library for Haskell

perfect-hash-generator - Perfect minimal hashing implementation in native Haskell

psqueues - Priority Search Queues in three different flavors for Haskell