Alternatives and similar repositories for universal-lambda:

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

• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• hydrolarus / toml-idr
  A TOML parser for Idris 2
  ☆17Updated 10 months ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• meraymond2 / idris-ide-client
  TypeScript client for Idris IDE-mode.
  ☆11Updated 2 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated last month
• edwinb / idris2-clibs
  Idris 2 bindings to various C libraries
  ☆15Updated 3 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 5 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
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 3 years ago
• Guest0x0 / trebor
  an implementation of Observational Type Theory (OTT) and more
  ☆26Updated 2 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆20Updated 7 months ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆28Updated 2 weeks ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆29Updated 4 years ago
• 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
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆63Updated 3 years ago
• ziman / itt-idris
  ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2
  ☆23Updated 5 months ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆57Updated 3 months ago
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• kino3 / Mini-TT
  mirror of A simple type-theoretic language: Mini-TT
  ☆38Updated 8 years ago
• dannypsnl / minic
  Minimalist compiler course, based on Essential of Compilation
  ☆10Updated 8 months ago
• hazelgrove / diy-hazelnut
  A template for you to implement Hazelnut yourself
  ☆21Updated 3 months ago
• andreypopp / type-systems
  Playing with type systems
  ☆50Updated 4 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 4 years ago
• forked-from-1kasper / anders
  Anders: Cubical Type Checker
  ☆24Updated last year
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆14Updated last year