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
• dhil / pthandlers
  an encoding of affine effect handlers using pthreads
  ☆13Updated 2 years ago
• c-cube / quip
  [wip] Proof format and checker for first-order and higher-order theorem provers
  ☆12Updated last year
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆17Updated 4 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆34Updated 3 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• 4y8 / esoo
  Like the Programming Languages Zoo but with esoteric languages.
  ☆25Updated 4 years ago
• andrejbauer / repl-in-browser
  Implementation of a language interpreter in the browser, using js_of_ocaml.
  ☆15Updated 7 years ago
• adrieng / pulsar
  Experimental functional language
  ☆18Updated 2 years ago
• mvr / tiny
  A type theory for tiny objects
  ☆10Updated last year
• dunhamsteve / newt
  A toy dependent typed language.
  ☆24Updated this week
• joscoh / why3-semantics
  Formal Semantics for Why3
  ☆14Updated this week
• coq-community / atbr
  Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]
  ☆23Updated 2 months ago
• elpinal / subtyping-agda
  Some rudimentary proofs on subtyping
  ☆11Updated 2 years ago
• dannypsnl / typed-racket-eff
  typed/racket + effect system
  ☆10Updated last month
• acorrenson / owl
  A mini language for logic programming
  ☆24Updated 4 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 2 years ago
• jashug / FormalizedCompilerAlgorithms
  Formalization in Coq of algorithms used in compilers for the Compiler.org project
  ☆15Updated 6 years ago
• ezyang / eff
  Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators
  ☆13Updated 4 years ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical types
  ☆26Updated last week
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 5 years ago
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆15Updated last year
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆10Updated 7 years ago
• ocaml-multicore / uring-trace
  Visualization tool for your IO-uring workload
  ☆14Updated 4 months ago
• uwplse / potpie
  Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct
  ☆15Updated 4 months ago
• umazalakain / session-types-coq
  Formalising session types in Coq
  ☆17Updated 5 years 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
• coq-community / metaprogramming-rosetta-stone
  A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…
  ☆17Updated 11 months ago