Alternatives and similar repositories for BLoC:

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

• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆20Updated 4 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• obfusk / koneko
  koneko - a concatenative not-quite-lisp for kittens
  ☆23Updated 8 months 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
• marvinborner / bruijn
  Programming with pure lambda calculus
  ☆106Updated 2 weeks ago
• cicada-lang / inet-forth
  An implementation of interaction nets as a forth-like language.
  ☆33Updated last week
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated last month
• lexi-lambda / shattered-plans
  ☆36Updated 2 years ago
• fortlang / fort
  Compiler for the fort programming language
  ☆12Updated 10 months ago
• ralsei / types.pl
  The glitch-soc/Mastodon fork running on types.pl
  ☆22Updated last month
• thma / lambda-ski
  Implementing a small functional language with a combinator based graph-reduction machine
  ☆29Updated last year
• Armael / conch
  ☆24Updated 3 years ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆14Updated last year
• gelisam / typechecker-combinators
  ☆17Updated last year
• kspalaiologos / lc-apl
  Journey to the Center of the Lambda Calculus
  ☆15Updated last year
• brismu / brismu
  A relational interpretation of Lojban
  ☆33Updated 3 months ago
• edemko / nanopass
  Haskell port of the Nanopass Compiler Framework
  ☆22Updated last year
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆19Updated last week
• ehatti / LHL
  Linearizability Hoare Logic
  ☆13Updated last month
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆27Updated 2 years ago
• Kleidukos / Intrigue
  My attempt at writing a R⁵RS-compliant Scheme with Megaparsec
  ☆14Updated last year
• xy-kasumi / hs2bf
  Haskell to brainfuck compiler
  ☆29Updated 10 years ago
• ncfavier / cubical-experiments
  Experiments with Cubical Agda
  ☆11Updated last week
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• ncfavier / glam
  Polymorphic guarded λ-calculus
  ☆13Updated 5 months ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 2 months ago
• eviefp / logic-in-haskell
  Classical Logic in Haskell
  ☆24Updated last month
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• RiscInside / LanguageEtudes
  Components of programming languages, all implemented in self-contained files
  ☆9Updated last year