Alternatives and similar repositories for edh:

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

• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• taktoa / wasm-agda
  A typechecker for WebAssembly, written in Agda (WIP)
  ☆17Updated 6 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• rootmos / silly-joy
  An interpreter for the concatenative language Joy, written in Haskell using extensible-effects
  ☆35Updated 2 months ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 3 months ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 2 years ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical types
  ☆26Updated last week
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 6 years ago
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆28Updated last year
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆32Updated this week
• Russoul / Idris2-Lua
  Lua backend for Idris 2
  ☆27Updated 2 years ago
• ziman / idris2-mlf
  Malfunction backend for Idris 2
  ☆12Updated 3 years ago
• sinelaw / hmf
  A copy of Daan Leijen's reference implementation of HMF (type inference)
  ☆16Updated 8 years ago
• LightAndLight / sage
  Efficient parser combinators for Haskell
  ☆39Updated 9 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆38Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆56Updated 7 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 3 months ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆32Updated 5 years ago
• TOTBWF / teenytt
  A Teeny Type Theory
  ☆26Updated 2 years ago
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 4 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆30Updated 5 years ago