<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Minikanren on Massimo Nocentini</title><link>https://massimo-nocentini.github.io/tags/minikanren/</link><description>Recent content in Minikanren on Massimo Nocentini</description><generator>Hugo</generator><language>en</language><managingEditor>massimo.nocentini@gmail.com (Massimo Nocentini)</managingEditor><webMaster>massimo.nocentini@gmail.com (Massimo Nocentini)</webMaster><lastBuildDate>Sun, 01 Mar 2015 18:33:23 +0100</lastBuildDate><atom:link href="https://massimo-nocentini.github.io/tags/minikanren/index.xml" rel="self" type="application/rss+xml"/><item><title>Eﬃcient representations for triangular substitutions</title><link>https://massimo-nocentini.github.io/post/2015-03-00-efficient-representations-of-triangular-substitutions/</link><pubDate>Sun, 01 Mar 2015 18:33:23 +0100</pubDate><author>massimo.nocentini@gmail.com (Massimo Nocentini)</author><guid>https://massimo-nocentini.github.io/post/2015-03-00-efficient-representations-of-triangular-substitutions/</guid><description>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.</description></item><item><title>miniKanren, live and untagged</title><link>https://massimo-nocentini.github.io/post/2026-02-04-minikanren-live-and-untagged/</link><pubDate>Sun, 09 Sep 2012 18:33:23 +0100</pubDate><author>massimo.nocentini@gmail.com (Massimo Nocentini)</author><guid>https://massimo-nocentini.github.io/post/2026-02-04-minikanren-live-and-untagged/</guid><description>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.</description></item></channel></rss>