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
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months 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
• gelisam / typechecker-combinators
  ☆17Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 6 months ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• ncfavier / agda-stuff
  My Agda blog/lab/playground
  ☆13Updated 3 weeks ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆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 5 months ago
• acorrenson / modulus
  A constraint solver built from scratch in OCaml
  ☆12Updated 3 years ago
• crabbo-rave / Soup
  Extra and extended datatypes for Lean 4
  ☆12Updated 2 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated this week
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆19Updated 5 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆21Updated 2 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 2 months ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• nomeata / lean-wf-induct
  ☆17Updated last year
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• rzk-lang / hottbook
  HoTT Book formalisations in Rzk.
  ☆19Updated last year
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated 2 months ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated last week