adjunctions alternatives and similar packages

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

• hevm

  10.0 2.4 adjunctions VS hevm

  Dapp, Seth, Hevm, and more
  

• miso

  10.0 9.7 adjunctions VS miso

  :ramen: A tasty Haskell web framework
  

SaaSHub - Software Alternatives and Reviews

SaaSHub helps you find the best software and product alternatives

Promo www.saashub.com



• Agda

  10.0 9.7 adjunctions VS Agda

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

• containers

  9.8 8.1 adjunctions VS containers

  Assorted concrete container types
  

• vinyl

  9.7 0.0 adjunctions VS vinyl

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

• singletons

  9.7 6.4 adjunctions VS singletons

  Fake dependent types in Haskell using singletons
  

• fgl

  9.6 4.4 adjunctions VS fgl

  A Functional Graph Library for Haskell
  

• cubical

  9.4 0.0 adjunctions VS cubical

  Implementation of Univalence in Cubical Sets
  

• repa-convert

  9.4 6.3 adjunctions VS repa-convert

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-eval

  9.4 6.3 adjunctions VS repa-eval

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-array

  9.4 6.3 adjunctions VS repa-array

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-scalar

  9.4 6.3 adjunctions VS repa-scalar

  High performance, regular, shape polymorphic parallel arrays.
  

• parameterized-utils

  9.1 7.3 adjunctions VS parameterized-utils

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

• psqueues

  9.0 4.5 adjunctions VS psqueues

  Priority Search Queues in three different flavors for Haskell
  

• ethereum-client-haskell

  8.9 0.0 adjunctions VS ethereum-client-haskell

  A Haskell version of an Ethereum client
  

• hoq

  8.9 0.0 adjunctions VS hoq

  A language based on homotopy type theory with an interval
  

• type-level-sets

  8.9 6.2 adjunctions VS type-level-sets

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

• distributive

  8.8 4.2 adjunctions VS distributive

  Dual Traversable
  

• bookkeeper

  8.7 0.0 adjunctions VS bookkeeper

  Anonymous records and overloaded labels
  

• clafer

  8.6 2.4 adjunctions VS clafer

  Clafer is a lightweight modeling language
  

• justified-containers

  8.6 0.0 adjunctions VS justified-containers

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

• ixset-typed

  8.6 3.9 adjunctions VS ixset-typed

  More strongly typed variant of the ixset Haskell package
  

• EdisonAPI

  8.5 6.6 adjunctions VS EdisonAPI

  Edison: A Library of Efficient Data Structures
  

• bytestring-trie

  8.2 5.1 adjunctions VS bytestring-trie

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

• slist

  8.1 1.9 adjunctions VS slist

  ♾️ Sized list
  

• heaps

  8.0 4.3 adjunctions VS heaps

  Asymptotically optimal Brodal/Okasaki heaps
  

• void

  8.0 4.5 adjunctions VS void

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

• haggle

  8.0 2.0 adjunctions VS haggle

  An efficient graph library for Haskell
  

• bitset

  7.9 0.0 adjunctions VS bitset

  A compact functional set data structure
  

• hamtmap

  7.9 0.0 adjunctions VS hamtmap

  DISCONTINUED. A purely functional and persistent hash map

• knit

  7.9 2.2 adjunctions VS knit

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

• nonempty-containers

  7.7 6.0 adjunctions VS nonempty-containers

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

• multiset

  7.7 0.0 adjunctions VS multiset

  multiset haskell package
  

• helf

  7.5 2.8 adjunctions VS helf

  Haskell implementation of the Edinburgh Logical Framework
  

• graphite

  7.4 0.0 adjunctions VS graphite

  Haskell graphs and networks library
  

• data-r-tree

  7.4 4.3 adjunctions VS data-r-tree

  Haskell implementatio of R-Trees
  

• algebra-checkers

  7.4 0.0 adjunctions VS algebra-checkers

  checkers for algebra driven design
  

• ixset

  7.2 0.0 adjunctions VS ixset

  A Set type which supports multiple indexes
  

• rawr

  7.1 0.0 adjunctions VS rawr

  Anonymous extensible records and variant types
  

• map-exts

  7.1 0.0 adjunctions VS map-exts

  DISCONTINUED. Extensions to Data.Map
  

• ethereum-analyzer

  6.9 6.9 adjunctions VS ethereum-analyzer

  An Ethereum contract analyzer.
  

• eliminators

  6.8 4.6 adjunctions VS eliminators

  Dependently typed elimination functions using singletons
  

• claferIG

  6.8 3.9 adjunctions VS claferIG

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

• supermonad

  6.7 0.0 adjunctions VS supermonad

  A plugin for GHC to support super monads.
  

• map-syntax

  6.7 0.0 adjunctions VS map-syntax

  Syntax sugar and explicit semantics for statically defined maps
  

• TypeCompose

  6.6 0.0 adjunctions VS TypeCompose

  Type composition classes & instances & misc
  

• mtl-c

  6.5 0.0 adjunctions VS mtl-c

  Monad transformers in CPS
  

• data-clist

  6.5 3.9 adjunctions VS data-clist

  A purely functional ring data structure for Haskell.
  

• igraph

  6.4 0.0 adjunctions VS igraph

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

• selections

  6.2 0.0 adjunctions VS selections

  Haskell Package for operating with selections over an underlying functor
  

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

Popular Comparisons

• adjunctions
  vs
  graphite
• adjunctions
  vs
  appendmap
• adjunctions
  vs
  repa-scalar
• adjunctions
  vs
  array-memoize
• adjunctions
  vs
  psqueues