Unification

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]