Alternatives and similar repositories for mltt-c

Users that are interested in mltt-c are comparing it to the libraries listed below

• ehatti / LHL
  Linearizability Hoare Logic
  ☆17Updated this week
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆12Updated last year
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 5 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆36Updated this week
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 10 months ago
• etiamz / optiscope
  A Lévy-optimal lambda calculus reducer with a backdoor to C
  ☆43Updated this week
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 4 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 4 years ago
• SjVer / Lamb
  An implementation of Colin James' "Compiling Lambda Calculus"
  ☆16Updated 3 years ago
• ehatti / konna
  ☆16Updated 3 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated last month
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• dannypsnl / minic
  Minimalist compiler course, based on Essential of Compilation
  ☆11Updated last month
• bloomberg / game-trees
  Functions and proofs about game trees in Rocq, implemented as rose trees.
  ☆12Updated 2 months ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• exaexa / minihm
  toy implementation of Hindley-Milner type system that prints out inference steps
  ☆17Updated 3 months ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• iczelia / lc-apl
  Journey to the Center of the Lambda Calculus
  ☆14Updated 2 years ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 2 weeks ago
• UberPyro / Prowl-Ideas-Pile
  Ideas, documents, and tutorial pile for the Prowl Language
  ☆12Updated last year
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated 2 years ago
• T-Brick / c0deine
  Reference compiler for c0
  ☆39Updated 2 months ago
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆52Updated 2 months ago
• marvinborner / BLoC
  File format and optimizer for programs encoded in binary lambda calculus
  ☆17Updated 2 years ago
• lynn / universal-lambda
  A minimal esolang based on lambda calculus
  ☆16Updated 5 years ago
• ncfavier / agda-stuff
  My Agda blog/lab/playground
  ☆12Updated last week
• andrejbauer / faux-type-theory
  ☆48Updated last week
• mb64 / poly
  A WIP compiler for a functional language. Very incomplete!
  ☆16Updated 4 years ago
• fir-lang / fir
  Fir programming language
  ☆91Updated this week