Alternatives and similar repositories for universal-lambda

Users that are interested in universal-lambda are comparing it to the libraries listed below

• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• mb64 / prolog
  A simple prolog implementation in Rust
  ☆26Updated 4 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• meraymond2 / idris-ide-client
  TypeScript client for Idris IDE-mode.
  ☆11Updated 2 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆20Updated 8 months ago
• hydrolarus / toml-idr
  A TOML parser for Idris 2
  ☆17Updated 11 months ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• edwinb / idris2-clibs
  Idris 2 bindings to various C libraries
  ☆15Updated 3 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆52Updated 3 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 5 months ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 3 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• atennapel / qtt-ts
  Implementation of Quantitative Type Theory (in TypeScript)
  ☆12Updated 4 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• kino3 / Mini-TT
  mirror of A simple type-theoretic language: Mini-TT
  ☆40Updated 8 years ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• SchrodingerZhu / LeanGccBackend
  Lean4 backend using `libgccjit`!
  ☆11Updated last year
• dunhamsteve / newt
  A toy dependent typed language.
  ☆29Updated 2 weeks ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 5 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• sergei-romanenko / spsc
  SPSC: A Small Positive Supercompiler
  ☆35Updated last year
• sconybeare / mltt
  Implementation of Martin-Löf Type Theory in Haskell
  ☆16Updated 9 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆24Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• owo-lang / Mini-TT
  Documented version of a simple type-theoretic language: Mini-TT
  ☆18Updated 6 years ago
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 2 months ago
• RemuLang / remu-type-system
  type-system, revised unification algorithm and runtime time representations
  ☆14Updated 5 years ago