Popularity

3.4

Growing

Activity

3.7

Stars 4

Watchers 3

Forks 0

Last Commit 9 months ago

Monthly Downloads: 9

Programming language: HTML

License: GNU General Public License v2.0 only

Tags: Data Structures Education Library

Latest version: v0.0.2

I1M alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view I1M alternatives based on common mentions on social networks and blogs.

hevm

10.0 2.4 I1M VS hevm

Dapp, Seth, Hevm, and more
Agda

10.0 9.9 I1M VS Agda

Agda is a dependently typed programming language / interactive theorem prover.

InfluxDB – Built for High-Performance Time Series Workloads

InfluxDB 3 OSS is now GA. Transform, enrich, and act on time series data directly in the database. Automate critical tasks and eliminate the need to move data externally. Download now.

Promo www.influxdata.com

miso

10.0 9.7 I1M VS miso

:ramen: A tasty Haskell front-end framework
containers

9.8 8.7 I1M VS containers

Assorted concrete container types
singletons

9.7 7.0 I1M VS singletons

Fake dependent types in Haskell using singletons
vinyl

9.7 0.0 I1M VS vinyl

Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.
fgl

9.6 4.7 I1M VS fgl

A Functional Graph Library for Haskell
cubical

9.4 0.0 I1M VS cubical

Implementation of Univalence in Cubical Sets
repa-array

9.4 6.3 I1M VS repa-array

High performance, regular, shape polymorphic parallel arrays.
repa-scalar

9.4 6.3 I1M VS repa-scalar

High performance, regular, shape polymorphic parallel arrays.
repa-eval

9.4 6.3 I1M VS repa-eval

High performance, regular, shape polymorphic parallel arrays.
repa-convert

9.4 6.3 I1M VS repa-convert

High performance, regular, shape polymorphic parallel arrays.
parameterized-utils

9.2 8.3 I1M VS parameterized-utils

A set of utilities for using indexed types including containers, equality, and comparison.
adjunctions

9.0 5.0 I1M VS adjunctions

Simple adjunctions
hoq

9.0 0.0 I1M VS hoq

A language based on homotopy type theory with an interval
psqueues

9.0 5.4 I1M VS psqueues

Priority Search Queues in three different flavors for Haskell
ethereum-client-haskell

8.9 0.0 I1M VS ethereum-client-haskell

A Haskell version of an Ethereum client
distributive

8.9 2.7 I1M VS distributive

Dual Traversable
type-level-sets

8.8 0.0 I1M VS type-level-sets

Type-level sets for Haskell (with value-level counterparts and various operations)
bookkeeper

8.7 0.0 I1M VS bookkeeper

Anonymous records and overloaded labels
justified-containers

8.6 0.0 I1M VS justified-containers

Standard containers, with keys that carry type-level proofs of their own presence.
clafer

8.6 2.4 I1M VS clafer

Clafer is a lightweight modeling language
EdisonAPI

8.4 4.6 I1M VS EdisonAPI

Edison: A Library of Efficient Data Structures
ixset-typed

8.4 0.0 I1M VS ixset-typed

More strongly typed variant of the ixset Haskell package
bytestring-trie

8.2 5.1 I1M VS bytestring-trie

An efficient finite map from (byte)strings to values.
slist

8.1 2.3 I1M VS slist

♾️ Sized list
heaps

8.0 4.3 I1M VS heaps

Asymptotically optimal Brodal/Okasaki heaps
void

8.0 0.0 I1M VS void

Provides Data.Void, which is in base since ghc 7.8 or so
haggle

8.0 1.4 I1M VS haggle

An efficient graph library for Haskell
hamtmap

7.9 0.0 I1M VS hamtmap

DISCONTINUED. A purely functional and persistent hash map
knit

7.9 2.2 I1M VS knit

Ties the knot on data structures that reference each other by unique keys
nonempty-containers

7.8 6.0 I1M VS nonempty-containers

Efficient non-empty variants of containers data types, with full API
bitset

7.6 0.0 I1M VS bitset

A compact functional set data structure
multiset

7.6 0.0 I1M VS multiset

multiset haskell package
graphite

7.5 0.0 I1M VS graphite

Haskell graphs and networks library
helf

7.5 2.8 I1M VS helf

Haskell implementation of the Edinburgh Logical Framework
algebra-checkers

7.4 0.0 I1M VS algebra-checkers

checkers for algebra driven design
rawr

7.1 0.0 I1M VS rawr

Anonymous extensible records and variant types
eliminators

7.1 4.6 I1M VS eliminators

Dependently typed elimination functions using singletons
data-r-tree

7.1 4.3 I1M VS data-r-tree

Haskell implementatio of R-Trees
map-exts

7.1 0.0 I1M VS map-exts

Extensions to Data.Map
ixset

6.7 0.0 I1M VS ixset

A Set type which supports multiple indexes
ethereum-analyzer

6.7 6.9 I1M VS ethereum-analyzer

An Ethereum contract analyzer.
claferIG

6.7 3.9 I1M VS claferIG

Support for reasoning on Clafer models by instantiation and counter example generation.
map-syntax

6.7 0.0 I1M VS map-syntax

Syntax sugar and explicit semantics for statically defined maps
TypeCompose

6.6 0.0 I1M VS TypeCompose

Type composition classes & instances & misc
supermonad

6.5 0.0 I1M VS supermonad

A plugin for GHC to support super monads.
mtl-c

6.5 0.0 I1M VS mtl-c

Monad transformers in CPS
selections

6.5 0.0 I1M VS selections

Haskell Package for operating with selections over an underlying functor
igraph

6.4 0.0 I1M VS igraph

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

Do you think we are missing an alternative of I1M or a related project?

Add another 'Data Structures' Package

Popular Comparisons

README

En este repositorio se encuentra el código en Haskell de las librerías desarrolladas y usadas en el curso de Informática de 1º del Grado en Matemáticas de la Universidad de Sevilla.

La documentación se puede consultar aquí.

Las librerías incluidas son: