Alternatives and similar repositories for miniagda

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

• adamgundry / type-inference
  Unification and type inference algorithms
  ☆127Updated 10 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆116Updated 5 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆86Updated 4 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆66Updated 5 years ago
• lambda-pi-plus / lambda-pi-plus
  A simple Depdently-Typed Language for Research and Learning
  ☆57Updated 9 years ago
• mortberg / yacctt
  yacctt: Yet Another Cartesian Cubical Type Theory
  ☆76Updated 7 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆85Updated 9 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• edwinb / SPLV20
  SPLV20 course notes
  ☆114Updated 3 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 3 months ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 months ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆86Updated 4 years ago
• frex-project / idris-frex
  ☆51Updated 5 months ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆46Updated 3 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆98Updated 3 weeks ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 12 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆74Updated 6 years ago
• bobatkey / sott
  Simplified Observational Type Theory
  ☆87Updated 2 years ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆97Updated 11 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆121Updated 8 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆60Updated last year
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆80Updated 5 months ago
• agda / agda-pkg
  apkg - package manager for Agda
  ☆38Updated 4 years ago
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆113Updated 2 years ago