Alternatives and similar repositories for blond

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

• namin / reflective-towers
  software archaeology of reflective towers of interpreters
  ☆16Updated 4 months ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 8 years ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆17Updated last year
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 6 months ago
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆22Updated 9 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
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆20Updated 4 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• webyrd / normalization-by-evaluation
  Normalization-by-evaluation in miniKanren
  ☆24Updated 2 years ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• triska / trs
  Reason about Term Rewriting Systems
  ☆18Updated 3 years ago
• jdan / compiler.lean
  A formally verified compiler for a simple language with numbers and sums
  ☆27Updated 4 years ago
• sto0pkid / swipl-tt
  Implementation of dependent type theory in SWI-Prolog
  ☆10Updated 5 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 6 years ago
• JacquesCarette / TheoriesAndDataStructures
  Showing how some simple mathematical theories naturally give rise to some common data-structures
  ☆39Updated last year
• kmcallister / qoppa
  Metacircular evaluator for a tiny fexpr language
  ☆44Updated 13 years ago
• pmatos / racket-loci
  Implementation of local and remote loci for Racket
  ☆12Updated 4 years ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆19Updated 5 years ago
• aprolog-lang / aprolog
  αProlog
  ☆18Updated 2 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated 2 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 13 years ago
• jsiek / arete
  Arete is an experimental programming language.
  ☆12Updated 2 years ago
• webyrd / tree-automata
  Tree-automata-based run-time type constraints for miniKanren
  ☆14Updated 2 years ago