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.
  ☆12Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated last month
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 4 years ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• ncfavier / agda-stuff
  My Agda blog/lab/playground
  ☆12Updated last week
• dunhamsteve / newt
  A toy dependent typed language.
  ☆36Updated this week
• gelisam / typechecker-combinators
  ☆17Updated last year
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 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
• nomeata / lean-wf-induct
  ☆17Updated last year
• rzk-lang / hottbook
  HoTT Book formalisations in Rzk.
  ☆20Updated 2 years ago
• brendanzab / lean-holes
  Interactive holes for Lean 4
  ☆22Updated last year
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 10 months ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 2 months ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆21Updated 2 months ago
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆34Updated 8 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 4 years ago
• hide-kawabata / traf
  A proof tree viewer that works with Coq through Proof General
  ☆28Updated 5 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆24Updated last year
• bloomberg / game-trees
  Functions and proofs about game trees in Rocq, implemented as rose trees.
  ☆12Updated 2 months ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 3 years ago
• andrejbauer / clerical
  Command-like expressions for real infinite-precision calculations
  ☆55Updated 6 months 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
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 4 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago