Alternatives and similar repositories for Lamb:

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

• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• c-cube / quip
  [wip] Proof format and checker for first-order and higher-order theorem provers
  ☆12Updated last year
• 4y8 / esoo
  Like the Programming Languages Zoo but with esoteric languages.
  ☆25Updated 4 years ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆17Updated 4 years ago
• acorrenson / owl
  A mini language for logic programming
  ☆24Updated 4 years ago
• joscoh / why3-semantics
  Formal Semantics for Why3
  ☆15Updated this week
• ocaml-multicore / uring-trace
  Visualization tool for your IO-uring workload
  ☆14Updated 6 months ago
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆14Updated 2 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• acorrenson / SATurne
  Tiny verified SAT-solver
  ☆27Updated 3 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆28Updated this week
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• patricoferris / riscv-o-spec
  An OCaml extension for RISC-V
  ☆16Updated 4 years ago
• adrieng / pulsar
  Experimental functional language
  ☆17Updated 2 years ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆28Updated last month
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆14Updated 11 months ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆14Updated 8 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
• mmcco / verified-parser-example
  A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.
  ☆20Updated 9 years ago
• ezyang / eff
  Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators
  ☆13Updated 4 years ago
• effect-handlers / effect-handlers-bench
  Benchmark repository of polyglot effect handler examples
  ☆23Updated 3 months ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 2 years ago
• contificate / lr
  An interactive tool for experimenting with LR(1) grammars
  ☆14Updated 3 years ago
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆19Updated 4 months ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• ocaml-gospel / ortac
  Runtime assertion checking based on Gospel specifications
  ☆44Updated last month
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 7 years ago