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

Synthesizing programs using example input/outputs is a classic problem in artificial
intelligence. We present a method for solving Programming By Example (PBE) problems by …

A Unified Approach to Solving Seven Programming Problems (Functional Pearl) Page 1 8 A
Unified Approach to Solving Seven Programming Problems (Functional Pearl) WILLIAM E …

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

A language-agnostic approach for type-based component-oriented software synthesis is
developed from the fundamental principles of abstract algebra and Combinatory Logic. It …

We present decidable logic programs for addition, multiplication, division with remainder,
exponentiation, and logarithm with remainder over the unbounded domain of natural …

We present a method for solving Programming by Example (PBE) problems that tightly
integrates a neural network with a constraint logic programming system called miniKanren …

Ziggurat is a meta-language system that permits programmers to develop Scheme-like
macros for languages with nontrivial static semantics, such as C or Java (suitably encoded …

Symbolic execution is a technique for automatic software validation and verification. New
symbolic executors regularly appear for both existing and new languages and such …

CPS macros written using Scheme's syntax-rules macro system allow for guaranteed
composition of macros and control over the order of macro expansion. We identify a …