Alternatives and similar repositories for profunctor-monad

Users that are interested in profunctor-monad are comparing it to the libraries listed below

• GaloisInc / parameterized-utils
  A set of utilities for using indexed types including containers, equality, and comparison.
  ☆60Updated this week
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated 4 months ago
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 6 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• gallais / potpourri
  Where my everyday research happens
  ☆54Updated 2 months ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 4 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• haskellari / lattices
  Fine-grained lattice primitives for Haskell
  ☆37Updated last month
• gelisam / category-syntax
  do-notation for Category and "Arrow without arr"
  ☆63Updated 8 years ago
• ekmett / distributive
  Dual Traversable
  ☆42Updated 2 years ago
• ekmett / hkd
  higher-kinded data
  ☆30Updated 2 years ago
• goldfirere / effects
  A Haskell translation of Idris's original algebraic effects library
  ☆41Updated 8 years ago
• matt-noonan / gdp
  Ghosts of Departed Proofs
  ☆61Updated 4 years ago
• haskell-perf / graphs
  ☆40Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated last year
• jwiegley / bytestring-fiat
  An implementation of the Haskell ByteString library using the Fiat system from MIT
  ☆34Updated 3 years ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 4 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆124Updated last year
• LightAndLight / parametricity-proofs
  Proofs of the number of inhabitants of polymorphic functions
  ☆23Updated 7 years ago
• esmolanka / sexp-grammar
  Invertible parsing for S-expressions
  ☆34Updated 4 months ago
• ekmett / zippers
  Zippers based on lenses and traversals
  ☆40Updated 2 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago
• camfort / reprinter
  Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring
  ☆27Updated 4 years ago
• jespercockx / agda2scheme
  Compiler backend for generating Scheme code
  ☆26Updated last year
• mrkkrp / facts
  Refined types
  ☆57Updated 6 years ago
• wenkokke / priority-sesh
  Session Types with Priority in Linear Haskell
  ☆27Updated last year
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 7 years ago
• bolt12 / tymfgg-pearl
  Type Your Matrices For Great Good
  ☆29Updated 5 years ago