Alternatives and similar repositories for Symbolic-math-HaTeX

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

• mokus0 / monad-loops
  Some useful control operators for looping
  ☆47Updated 5 years ago
• gelisam / category-syntax
  do-notation for Category and "Arrow without arr"
  ☆62Updated 8 years ago
• qfpl / sv
  Comma (and other) separated values
  ☆78Updated 2 years ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated 3 months ago
• ekmett / zippers
  Zippers based on lenses and traversals
  ☆41Updated 2 years ago
• GaloisInc / parameterized-utils
  A set of utilities for using indexed types including containers, equality, and comparison.
  ☆60Updated last week
• obsidiansystems / dependent-map
  Dependently-typed finite maps (partial dependent products)
  ☆66Updated last month
• sellout / yaya
  Yet another yet another recursion scheme library in Haskell.
  ☆89Updated 2 weeks ago
• ekmett / distributive
  Dual Traversable
  ☆41Updated 2 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆127Updated last year
• stepcut / plugins
  Dynamic linking and runtime evaluation of Haskell, and C, including dependency chasing and package resolution.
  ☆53Updated 2 years ago
• tonyday567 / numhask
  A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.
  ☆71Updated last week
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 6 years ago
• Lysxia / first-class-families
  First-class type families
  ☆90Updated last month
• tweag / distributed-closure
  Serializable closures for distributed programming.
  ☆65Updated 2 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆83Updated 2 months ago
• patrickt / fastsum
  A fast open-union type, suitable for 100+ contained alternatives.
  ☆99Updated last year
• 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 10 months ago
• sellout / dada
  A total recursion scheme library for Dhall
  ☆66Updated last week
• Lysxia / generic-random
  Generic random generators
  ☆81Updated 2 years ago
• Gabriella439 / HasCal
  Haskell embedding of PlusCal
  ☆62Updated 3 years ago
• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆164Updated 4 months ago
• mstksg / mutable
  Automatic piecewise-mutable references for your types
  ☆42Updated 5 years ago
• grin-compiler / idris-grin
  GRIN backend for Idris
  ☆50Updated 5 years ago
• matt-noonan / gdp
  Ghosts of Departed Proofs
  ☆62Updated 5 years ago
• hedgehogqa / haskell-hedgehog-classes
  Hedgehog will eat your typeclass bugs
  ☆56Updated 6 months ago
• ocharles / what-it-do
  Automatically trace all (showable) binds in do expressions
  ☆84Updated 7 years ago
• lehins / scheduler
  A work stealing scheduler
  ☆79Updated 10 months ago