Alternatives and similar repositories for monads:

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

• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 7 years ago
• 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.
  ☆34Updated 7 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆112Updated 2 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 6 months ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• abooij / wiwikwlhott
  What I wish I knew when learning HoTT
  ☆53Updated 6 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆43Updated last month
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated last month
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆34Updated 4 years ago
• jonsterling / sml-modernized-algol
  Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees
  ☆15Updated 7 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆72Updated 3 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
• UlfNorell / agda-summer-school
  Summer school on programming in Agda
  ☆68Updated last year
• david-christiansen / derive-all-the-instances
  Work on type class deriving with elaboration reflection
  ☆32Updated 6 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• clayrat / sequent-calc
  Experiments with sequent calculi
  ☆27Updated 4 years ago
• gallais / thesis
  Syntaxes with Binding, Their Programs, and Proofs
  ☆23Updated last year
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• ezyang / lr-agda
  Logical relations proof in Agda
  ☆26Updated 9 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆34Updated last year