Alternatives and similar repositories for py_monad_do:

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

• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆72Updated 2 years ago
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆98Updated 2 years ago
• leftaroundabout / constrained-categories
  Constrained versions of the Haskell standard category-theory-based type classes, using ConstraintKinds
  ☆22Updated last year
• nadia-polikarpova / synquid
  ☆122Updated 2 years ago
• UlfNorell / agda-prelude
  Programming library for Agda
  ☆126Updated 6 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆112Updated 2 weeks ago
• goldfirere / glambda
  The home of the Glamorous Glambda interpreter
  ☆222Updated 2 months ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆96Updated 4 months ago
• sweirich / challenge
  Strongly-typed System F in Haskell
  ☆117Updated 2 years ago
• dagit / happy-plus-alex
  Template for quickly and easily combining happy and alex
  ☆48Updated 9 years ago
• coq-community / corn
  Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]
  ☆113Updated last month
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆124Updated 10 years ago
• sjoerdvisscher / data-category
  Library of categories, with categorical constructions on them
  ☆55Updated last year
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆80Updated 8 years ago
• IagoAbal / haskell-z3
  Haskell bindings to Microsoft's Z3 API (unofficial).
  ☆58Updated 11 months ago
• well-typed / visualize-cbn
  ☆99Updated last month
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆92Updated last month
• j-mie6 / ParsleyHaskell
  Reimplementation of Parsley in Haskell, with improvements
  ☆51Updated 11 months ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆204Updated 5 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆82Updated last week
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆89Updated 6 years ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆53Updated 2 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated last year
• leftaroundabout / linearmap-family
  Purely-functional, coordinate-free linear algebra
  ☆28Updated 7 months ago
• byorgey / comprog-hs
  Competitive programming utilities in Haskell
  ☆30Updated 2 months ago
• derekelkins / agda-vim
  Agda interaction in vim
  ☆131Updated 3 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆186Updated 7 years ago
• mvr / cf
  "Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct)
  ☆40Updated 9 years ago