Alternatives and similar repositories for LHL

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

• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• gelisam / typechecker-combinators
  ☆17Updated last year
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 3 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆28Updated 3 weeks ago
• nomeata / lean-wf-induct
  ☆17Updated last year
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• ncfavier / cubical-experiments
  Experiments with Cubical Agda
  ☆11Updated 2 weeks ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated 11 months ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated last month
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 3 months ago
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆45Updated 3 months ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆19Updated 2 weeks ago
• brendanzab / lean-holes
  Interactive holes for Lean 4
  ☆19Updated last year
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆20Updated 7 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• JacquesCarette / Notes
  ☆13Updated last month
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆14Updated last year
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 7 months ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated last month
• joscoh / why3-semantics
  Formal Semantics for Why3
  ☆18Updated 3 weeks ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• rzk-lang / hottbook
  HoTT Book formalisations in Rzk.
  ☆18Updated 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
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 12 years ago
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated 10 months ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 3 years ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆33Updated 8 years ago
• dannypsnl / typed-racket-eff
  typed/racket + effect system
  ☆10Updated 4 months ago