miniKanren, live and untagged

Quine generation via relational interpreters

 Posted on September 9, 2012  |  3 min  |  484 words  |  William E. Byrd  |  Eric Holk  |  Daniel P. Friedman

This paper presents relational interpreters for subsets of Scheme in miniKanren, emphasizing backward execution, quine generation, constraint-based reasoning, and untagged representations that simplify interpreter design. [Read More]
kanren  minikanren  scheme  relational  interpreters  quines  logic  constraints  untagged  matching