Alternatives and similar repositories for language-agda:

Users that are interested in language-agda are comparing it to the libraries listed below

• banacorn / agda-mode
  agda-mode on Atom
  ☆58Updated 3 years ago
• andreasabel / strong-normalization
  Formalizations of strong normalization proofs
  ☆34Updated 5 years ago
• jonsterling / agda-brouwerian-mathematics
  some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson
  ☆8Updated 9 years ago
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• jonsterling / agda-zipper-machine
  An abstract machine using indexed containers and their zippers
  ☆14Updated 8 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• ZongzheYuan / HaltingProblem
  The proof of undecidability of halting problem, using the model -- WHILE language.
  ☆20Updated 4 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• pnwamk / stop2015-redex
  PLT Redex model of basic Dependently Typed Racket calculus
  ☆18Updated 9 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 9 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated last week
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 5 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆71Updated 2 years ago
• Zekt / Type-Embellishment
  Experimenting on ornamentation in Agda via reflection.
  ☆12Updated last year
• gallais / thesis
  Syntaxes with Binding, Their Programs, and Proofs
  ☆23Updated last year
• david-christiansen / final-pretty-printer
  A monadic (and pretty) pretty printer for Haskell
  ☆37Updated last year
• pigworker / Saturday
  being a thing I build on a Saturday
  ☆28Updated 6 years ago
• jonsterling / topos-theory-notes
  ☆10Updated 7 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆44Updated 2 years ago
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• jmchapman / Relative-Monads
  Relative Monad Library for Agda
  ☆24Updated 5 years ago
• pigworker / Ming
  being the emperor of Mongo, but also a verb
  ☆15Updated 6 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• lexi-lambda / racket-higher-rank
  ☆21Updated 7 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago