Alternatives and similar repositories for nlambda

Users that are interested in nlambda are comparing it to the libraries listed below

• treeowl / sort-traversable
  Sort any Traversable container
  ☆41Updated 3 years ago
• haskell-numerics / random-fu
  A suite of Haskell libraries for representing, manipulating, and sampling random variables
  ☆43Updated last year
• bolt12 / tymfgg-pearl
  Type Your Matrices For Great Good
  ☆29Updated 4 years ago
• mvr / cf
  "Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct)
  ☆40Updated 9 years ago
• mikeizbicki / ifcxt
  constraint level if statements
  ☆116Updated 7 years ago
• leftaroundabout / constrained-categories
  Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds
  ☆22Updated 2 years ago
• Lysxia / first-class-families
  First-class type families
  ☆88Updated last month
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 4 years ago
• gelisam / category-syntax
  do-notation for Category and "Arrow without arr"
  ☆63Updated 8 years ago
• ekmett / unboxed
  experimenting with unlifted classes via backpack
  ☆36Updated 2 years ago
• VictorCMiraldo / generics-mrsop
  ☆21Updated 3 years ago
• sjoerdvisscher / data-category
  Library of categories, with categorical constructions on them
  ☆56Updated last year
• dorchard / type-level-sets
  Type-level sets for Haskell (with value-level counterparts and various operations)
  ☆66Updated last year
• emilypi / smash
  Smash products, Wedge products, and other Pointed stuff
  ☆34Updated 3 years ago
• sellout / caterwaul
  Wailing into the primordial ooze of category theory
  ☆55Updated last month
• ekmett / folds
  Folds and sequence algebras
  ☆18Updated 2 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated 11 months ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated last year
• rampion / tree-traversals
  Functions and newtype wrappers for traversing Trees
  ☆30Updated 10 months ago
• aaronlevin / free-vl
  van Laarhoven Free Monad with Extensible Effects
  ☆23Updated 9 years ago
• stephenpascoe / hs-arrow
  Haskell bindings to Apache Arrow
  ☆12Updated 6 years ago
• ericfinster / higher-alg
  An approach to higher algebra in type theory
  ☆23Updated 5 years ago
• morphismtech / distributors
  Distributors - Unifying Parsers, Printers & Grammars
  ☆25Updated this week
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 years ago
• Magalame / fastest-matrices
  Benchmark of the main linear algebra libraries in Haskell
  ☆24Updated 5 years ago
• dalaing / cofun
  Cofun with Cofree Comonads
  ☆32Updated 9 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆90Updated 6 years ago
• isovector / algebra-checkers
  checkers for algebra driven design
  ☆34Updated 2 years ago
• matt-noonan / justified-containers
  Standard containers, with keys that carry type-level proofs of their own presence.
  ☆81Updated 5 years ago
• danidiaz / really-small-backpack-example
  A really small example of the Backpack module system for Haskell
  ☆54Updated 6 months ago