Alternatives and similar repositories for lambda-calculus:

Users that are interested in lambda-calculus are comparing it to the libraries listed below

• banacorn / agda-mode-vscode
  agda-mode on VS Code
  ☆175Updated this week
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆101Updated 2 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆124Updated 10 months ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆73Updated 2 years ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆45Updated 2 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• polarity-lang / polarity
  A Language with Dependent Data and Codata Types
  ☆99Updated last week
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆113Updated last week
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated 3 weeks ago
• thiagofelicissimo / BiTTs
  ☆24Updated 7 months ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆126Updated last year
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆157Updated 2 weeks ago
• HoTT-Intro / Agda
  Agda formalisation of the Introduction to Homotopy Type Theory
  ☆123Updated 3 years ago
• keathley / pointfree.io
  A web site for converting haskell code into pointfree haskell code
  ☆163Updated 2 years ago
• codyroux / name-the-biggest-number
  ☆63Updated 2 years ago
• agda / agda2hs
  Compiling Agda code to readable Haskell
  ☆184Updated last week
• lexa-lang / lexa
  ☆32Updated 6 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆171Updated this week
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• Anderssorby / SDL.lean
  SDL2 bindings for lean
  ☆21Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆72Updated 2 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆63Updated 3 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆37Updated 5 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆97Updated 6 months ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆56Updated 4 years ago
• RedPRL / cooltt
  😎TT
  ☆225Updated last year