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
  ☆15Updated 4 months ago
• iambrj / metaKanren
  Relational interpreter for miniKanren, in miniKanren.
  ☆14Updated 3 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆10Updated 7 years ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆16Updated 6 months ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆22Updated 8 years ago
• namin / 3-proto-lisp
  Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.
  ☆13Updated 3 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated last year
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 5 years ago
• elpinal / subtyping-agda
  Some rudimentary proofs on subtyping
  ☆11Updated 3 years ago
• michaelballantyne / syntax-spec
  A metalanguage for creating sophisticated DSLs in Racket.
  ☆30Updated this week
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated 11 months ago
• webyrd / normalization-by-evaluation
  Normalization-by-evaluation in miniKanren
  ☆24Updated last year
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• webyrd / tree-automata
  Tree-automata-based run-time type constraints for miniKanren
  ☆14Updated last year
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• forked-from-1kasper / anders
  Anders: Cubical Type Checker
  ☆22Updated last year
• 8l / asif
  A Self-Interpreter for F-omega
  ☆16Updated 9 years ago
• gelisam / typechecker-combinators
  ☆16Updated 10 months ago
• 4y8 / ski-in-asm
  A SKI combinators interpreter written in assembly
  ☆17Updated 4 years ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆18Updated 4 years ago
• Barry-Jay / Intensional-computation
  translations of a lambda abstraction to combinations of operators
  ☆18Updated 5 years ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 12 years ago
• triska / trs
  Reason about Term Rewriting Systems
  ☆16Updated 2 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 10 years ago
• rntz / minikanren-datalog
  Datalog implemented in minikanren
  ☆24Updated 7 years ago
• stevenbagley / metaii
  Common lisp implementation of Val Schorr's Meta-II language
  ☆17Updated 7 years ago
• jasonhemann / micro-in-mini
  an implementation of a microKanren(-like language) in miniKanren
  ☆26Updated 10 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago