Eļ¬ƒcient representations for triangular substitutions

A comparison in miniKanren

 Posted on March 1, 2015  |  1 min  |  164 words  |  David C. Bender  |  Lindsey Kuper  |  William E. Byrd  |  Daniel P. Friedman

This paper studies efficient representations for triangular substitutions in miniKanren, showing how skew binary random-access lists reduce lookup costs while preserving the advantages of a purely functional Scheme implementation. [Read More]
kanren  sbral  substitutions  unification  logic  scheme  functional  lookup  triangular  minikanren 

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