Alternatives and similar repositories for metaKanren:

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

• namin / reflective-towers
  software archaeology of reflective towers of interpreters
  ☆16Updated 6 months ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated last year
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆22Updated 9 years ago
• gregr / first-order-miniKanren
  miniKanren with a first-order representation of the search space
  ☆16Updated 9 months ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 7 years ago
• namin / mk-on-smt
  miniKanren for search, SMT for solving
  ☆13Updated 5 years ago
• namin / blond
  the reflective tower Blond by Olivier Danvy & Karoline Malmkjær
  ☆15Updated last year
• webyrd / alphaKanren
  Nominal logic programming extensions to miniKanren, based on alphaProlog.
  ☆25Updated 11 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆35Updated 3 years ago
• stamourv / partial-evaluation-tutorial
  Racket implementation of Cook and Lämmel's partial evaluation tutorial.
  ☆31Updated 12 years ago
• takikawa / racket-ppa
  Ubuntu PPA for Racket (based on the upstream in Debian at https://salsa.debian.org/bremner/racket). Check the Launchpad page for details …
  ☆10Updated 2 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 9 years ago
• webyrd / normalization-by-evaluation
  Normalization-by-evaluation in miniKanren
  ☆24Updated 2 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated last year
• ualib / ualib.github.io
  The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…
  ☆20Updated 3 years ago
• Sintrastes / Montague
  A library for non-deterministically parsing natural language expressions into a structured form.
  ☆17Updated 2 years ago
• michaelballantyne / syntax-spec
  A metalanguage for creating sophisticated DSLs in Racket.
  ☆32Updated 3 weeks ago
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• jasonhemann / constraint-microKanren
  A microKanren framework for implementing constraints.
  ☆18Updated 6 years ago
• Barry-Jay / Intensional-computation
  translations of a lambda abstraction to combinations of operators
  ☆18Updated 5 years ago
• xieyuheng / cat
  A categorical semantics library in Agda.
  ☆17Updated 5 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• samdphillips / rhombus-examples
  Some code in the Rhombus/Shrubbery prototype
  ☆12Updated 4 months ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 6 months ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆65Updated 11 years ago
• RichardMoot / LinearOne
  LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.
  ☆18Updated 4 years ago
• lexi-lambda / mini-ml
  An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)
  ☆21Updated 6 years ago