Alternatives and similar repositories for monads:

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

• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆112Updated last year
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated 2 weeks ago
• CHTT-s18 / lecture-notes
  ☆27Updated 4 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• jonsterling / sml-modernized-algol
  Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees
  ☆15Updated 7 years ago
• abooij / wiwikwlhott
  What I wish I knew when learning HoTT
  ☆53Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• UlfNorell / agda-summer-school
  Summer school on programming in Agda
  ☆68Updated last year
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• gallais / aGdaREP
  Implementing grep in Agda
  ☆32Updated 4 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• effectfully / random-stuff
  ☆19Updated 7 months ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• jmchapman / Relative-Monads
  Relative Monad Library for Agda
  ☆24Updated 5 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• plclub / lngen
  Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
  ☆31Updated 5 months ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆54Updated 5 years ago
• jonsterling / agda-brouwerian-mathematics
  some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson
  ☆8Updated 9 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• AndrasKovacs / stlc-nbe
  Correctness of normalization-by-evaluation for STLC
  ☆22Updated 5 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 6 months ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• ezyang / lr-agda
  Logical relations proof in Agda
  ☆26Updated 9 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago