Alternatives and similar repositories for Symbolic-math-HaTeX

Users that are interested in Symbolic-math-HaTeX are comparing it to the libraries listed below

• tonyday567 / numhask
  A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.
  ☆70Updated 3 months ago
• jaspervdj / psqueues
  Priority Search Queues in three different flavors for Haskell
  ☆67Updated 2 months ago
• mokus0 / monad-loops
  Some useful control operators for looping
  ☆47Updated 5 years ago
• qfpl / sv
  Comma (and other) separated values
  ☆78Updated last year
• sellout / yaya
  Yet another yet another recursion scheme library in Haskell.
  ☆89Updated 3 months ago
• matt-noonan / gdp
  Ghosts of Departed Proofs
  ☆61Updated 4 years ago
• gelisam / category-syntax
  do-notation for Category and "Arrow without arr"
  ☆63Updated 8 years ago
• tweag / distributed-closure
  Serializable closures for distributed programming.
  ☆65Updated last year
• maoe / viewprof
  Text-based interactive GHC .prof viewer
  ☆48Updated 2 years ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated 2 months ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• lehins / scheduler
  A work stealing scheduler
  ☆74Updated 9 months ago
• Lysxia / generic-random
  Generic random generators
  ☆81Updated 2 years ago
• haskell-numerics / random-fu
  A suite of Haskell libraries for representing, manipulating, and sampling random variables
  ☆43Updated 2 years ago
• obsidiansystems / dependent-map
  Dependently-typed finite maps (partial dependent products)
  ☆66Updated last week
• LeventErkok / sbvPlugin
  Formally prove properties of Haskell programs using SBV/SMT.
  ☆45Updated 7 months ago
• composewell / streaming-benchmarks
  Benchmarks to compare Haskell streaming library performance
  ☆107Updated last month
• sellout / dada
  A total recursion scheme library for Dhall
  ☆66Updated last month
• vmchale / permutations
  Provides a type-safe way of working with permutations in Idris
  ☆37Updated 4 years ago
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆82Updated last month
• SamuelSchlesinger / gaia
  An experiment in functional interface design
  ☆24Updated 9 years ago
• ekmett / zippers
  Zippers based on lenses and traversals
  ☆41Updated 2 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆47Updated 3 years ago
• well-typed / full-text-search
  An in-memory full text search engine library. It lets you run full-text queries on a collection of your documents.
  ☆49Updated 9 months ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆125Updated last year
• GaloisInc / parameterized-utils
  A set of utilities for using indexed types including containers, equality, and comparison.
  ☆60Updated 3 weeks ago
• Lysxia / first-class-families
  First-class type families
  ☆89Updated 2 weeks ago
• chrisdone-archive / labels
  Declare and access tuple fields with labels
  ☆59Updated 6 years ago
• achirkin / easytensor
  Many-dimensional type-safe numeric ops
  ☆46Updated 3 years ago
• sheaf / acts
  Haskell library for semigroup actions and torsors
  ☆64Updated 8 months ago