<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Monad Transformers for Backtracking Search · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1406.2058/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1406.2058/feed.xml" rel="self" type="application/rss+xml" /><item><title>Monad Transformers for Backtracking Search — mentioned by danidiaz</title><link>https://news.ycombinator.com/item?id=13874652</link><guid isPermaLink="false">urn:hackerpapers:mention:1406.2058:13874652</guid><pubDate>Wed, 15 Mar 2017 08:32:01 GMT</pubDate><description>&lt;p&gt;These notes explain the logic monad by solving solve n-queens with it: https://github.com/sshastry/queenslogic Despite its name, it&amp;#x27;s more of a search monad, it doesn&amp;#x27;t perform unification or anything like that. Another interesting paper is &amp;quot;Monad transformers for backtracking search&amp;quot; https://arxiv.org/abs/1406.2058 The Select monad described in the later paper can be found in the &amp;quot;transformers&amp;quot; library http://hackage.haskell.org/package/transformers-0.5.4.0/docs...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1406.2058/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
