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
  ☆14Updated 9 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆12Updated last year
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 5 years ago
• SjVer / Lamb
  An implementation of Colin James' "Compiling Lambda Calculus"
  ☆16Updated 3 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 8 months ago
• etiamz / optiscope
  A Lévy-optimal lambda calculus reducer with a backdoor to C
  ☆40Updated 2 months ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• dunhamsteve / newt
  A toy dependent typed language.
  ☆35Updated last week
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated last week
• acorrenson / modulus
  A constraint solver built from scratch in OCaml
  ☆12Updated 4 years ago
• exaexa / minihm
  toy implementation of Hindley-Milner type system that prints out inference steps
  ☆17Updated 2 months ago
• ehatti / konna
  ☆16Updated 3 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 4 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• andrejbauer / faux-type-theory
  ☆46Updated 3 months ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 8 months ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated this week
• UberPyro / prowl
  WIP stack language that uses regex for control flow
  ☆42Updated 2 years ago
• iczelia / lc-apl
  Journey to the Center of the Lambda Calculus
  ☆14Updated 2 years ago
• tlively / BrainCoqulus
  A formally verified compiler of untyped lambda calculus to brainfuck
  ☆16Updated 8 years ago
• ncfavier / agda-stuff
  My Agda blog/lab/playground
  ☆12Updated last week
• marvinborner / BLoC
  File format and optimizer for programs encoded in binary lambda calculus
  ☆17Updated 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
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• lynn / universal-lambda
  A minimal esolang based on lambda calculus
  ☆16Updated 4 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 8 years ago