The promise of logic programming is that programs can be written relationally, without
distinguishing between input and output arguments. Relational programs are remarkably …

We present relational interpreters for several subsets of Scheme, written in the pure logic
programming language miniKanren. We demonstrate these interpreters running" …

We present an implementation of the relational programming language miniKanren as a set
of combinators and syntax extensions for OCaml. The key feature of our approach is …

Implementations of domain-specific languages should offer both extensibility and
performance optimizations. With the new syntax-spec metalanguage in Racket …

We present a framework for building CLP languages with symbolic constraints based on
microKanren, a domain-specific logic language shallowly embedded in Racket. We rely on …

We describe a search optimization technique for implementation of relational programming
language miniKanren which makes more queries converge. Specifically, we address the …

A common foundation of finite arithmetic, hereditarily finite sets and sequences, binary trees
and graphs is described as a progressive refinement of Haskell type classes. We derive as …

We express in terms of binary trees seen as Gödel System T types (with the empty type as
the only primitive type) arithmetic computations within time and space bounds comparable to …

There are plenty of relational libraries for JVM languages, eg for Scala (Scalogno [1]) and
Core. Logic. However, according to TIOBE [2], Kotlin is the most popular JVM language …

We present a statically typed embedding of relational programming (specifically a dialect of
miniKanren with disequality constraints) in Haskell. Apart from handling types, our dialect …