Alternatives and similar repositories for sort-traversable

Users that are interested in sort-traversable are comparing it to the libraries listed below

• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated 5 months ago
• ekmett / unboxed
  experimenting with unlifted classes via backpack
  ☆37Updated 3 years ago
• int-index / union
  Extensible type-safe unions for Haskell
  ☆34Updated 10 months ago
• Lysxia / first-class-families
  First-class type families
  ☆90Updated 3 months ago
• dorchard / type-level-sets
  Type-level sets for Haskell (with value-level counterparts and various operations)
  ☆66Updated 3 months ago
• jonascarpay / convoluted
  Dependently typed convolutional neural networks
  ☆35Updated 8 years ago
• bgamari / monoidal-containers
  Maps using values' monoidal structure during merging
  ☆42Updated last week
• bgamari / ghc-dump
  A GHC plugin and library for analysing GHC Core
  ☆54Updated last year
• gelisam / n-ary-functor
  A single typeclass for Functor, Bifunctor, Trifunctor, etc.
  ☆41Updated 2 years ago
• soenkehahn / generics-eot
  A library for generic programming that aims to be easy to understand
  ☆26Updated last month
• robrix / semilattices
  join and meet semilattices, lower and upper bounds.
  ☆48Updated 4 months ago
• aaronlevin / free-vl
  van Laarhoven Free Monad with Extensible Effects
  ☆24Updated 9 years ago
• klapaucius / vector-hashtables
  ☆38Updated 3 weeks ago
• isovector / algebra-checkers
  checkers for algebra driven design
  ☆34Updated 3 years ago
• well-typed / recover-rtti
  Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).
  ☆35Updated 3 weeks ago
• Lysxia / generic-data
  Generic data types in Haskell, utilities for GHC.Generics
  ☆45Updated last month
• obsidiansystems / dependent-sum
  Dependent sums and supporting typeclasses for comparing and displaying them
  ☆56Updated 2 years ago
• yav / dump-core
  ☆45Updated 4 years ago
• rampion / tree-traversals
  Functions and newtype wrappers for traversing Trees
  ☆30Updated last year
• Icelandjack / deriving-via
  Deriving via
  ☆33Updated 7 years ago
• ChrisPenner / catalyst
  There are many category theory implementations, but this one is mine
  ☆16Updated last year
• adamConnerSax / knit-haskell
  Use Pandoc to write simple reports within haskell code. Inspired by R-markdown.
  ☆29Updated 4 months ago
• GaloisInc / parameterized-utils
  A set of utilities for using indexed types including containers, equality, and comparison.
  ☆60Updated this week
• serokell / o-clock
  Type-safe time units in Haskell
  ☆50Updated last year
• glguy / generic-traverse
  Demonstration for how to build "traverse" using GHC.Generics efficiently
  ☆22Updated 7 years ago
• isovector / type-sets
  type level sets
  ☆67Updated 6 years ago
• clash-lang / ghc-typelits-knownnat
  Derive KnownNat constraints from other KnownNat constraints
  ☆14Updated 3 weeks ago
• fumieval / oath
  Composable Concurrent Computation Done Right
  ☆30Updated 3 years ago
• int-index / ether
  Monad Transformers and Classes
  ☆76Updated 6 years ago
• kcsongor / symbols
  Symbol manipulation
  ☆37Updated 2 years ago