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 2 weeks ago
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆16Updated 10 months ago
• namin / 3-proto-lisp
  Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.
  ☆14Updated 3 years ago
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 5 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 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
• webyrd / normalization-by-evaluation
  Normalization-by-evaluation in miniKanren
  ☆24Updated 2 years ago
• stchang / mlish
  ☆22Updated 5 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆22Updated 9 years ago
• racket / honu
  ☆19Updated 2 years 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
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 12 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• namin / higher-rank
  Practical type inference for arbitrary-rank types
  ☆11Updated 6 years ago
• Barry-Jay / Intensional-computation
  translations of a lambda abstraction to combinations of operators
  ☆18Updated 5 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• stevenbagley / metaii
  Common lisp implementation of Val Schorr's Meta-II language
  ☆18Updated 8 years ago
• lamdu / lamdu-calculus
  An extended typed Lambda Calculus
  ☆21Updated 10 months ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated last year
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• jasonhemann / micro-in-mini
  an implementation of a microKanren(-like language) in miniKanren
  ☆26Updated 10 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• webyrd / tree-automata
  Tree-automata-based run-time type constraints for miniKanren
  ☆14Updated last year