Alternatives and similar repositories for write-yourself-a-scheme-in-agda

Users that are interested in write-yourself-a-scheme-in-agda are comparing it to the libraries listed below

• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 6 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated last year
• Toxaris / pts
  Interpreter for functional pure type systems.
  ☆21Updated 8 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 12 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated 9 months ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated last year
• wouter-swierstra / xmonad
  xmonad in Coq
  ☆46Updated 13 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 7 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 6 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• evertedsphere / how-to-implement-dependent-type-theory
  A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml
  ☆38Updated 6 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆38Updated 14 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆56Updated 8 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆16Updated 6 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆41Updated 5 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆55Updated 8 years ago
• hazelgrove / agda-popl17
  Mechanization of Hazelnut, as submitted to POPL 2017
  ☆16Updated 4 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• jfaure / lfvm-stg
  Map lazy functional language constructs to LLVM IR
  ☆52Updated 6 years ago
• xgrommx / agda-ecosystem
  ☆32Updated 7 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆53Updated 6 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆60Updated last year
• sbp / idris-bi
  Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq
  ☆37Updated 5 years ago