Alternatives and similar repositories for lambda-calculus

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

• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆59Updated last year
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆59Updated 3 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆54Updated last year
• agda / agda-pkg
  apkg - package manager for Agda
  ☆37Updated 3 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated last month
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆56Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆58Updated 4 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆29Updated 5 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• stoeffel / haskell-simple-dsl-examples
  Simple examples on how to implement a DSL in Haskell.
  ☆19Updated 5 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 11 months ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆27Updated 2 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 2 years ago
• avigad / qpf
  Datatypes as quotients of polynomial functors
  ☆35Updated 5 years ago
• tetrapharmakon / yoneda-in-tongues
  Yoneda lemma in every known language
  ☆17Updated 2 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆37Updated 5 years ago
• anton-k / hindley-milner-type-check
  Haskell library for type-inference with Hindley-Milner type-system.
  ☆34Updated 11 months ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated 2 years ago
• InitialTypes / Club
  Organization and planning for the Initial Types Club
  ☆72Updated 2 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated 2 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆59Updated 5 years ago