<?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Yestino - The Signal · Conquering Recursion</title><link>https://yestino.com/entities/conquering-recursion-162043</link><description>Every event involving Conquering Recursion</description><language>en</language><atom:link href="https://yestino.com/entities/conquering-recursion-162043/feed.xml" rel="self" type="application/rss+xml"/><item><title>Conquering Recursion</title><link>https://yestino.com/events/conquering-recursion-0765fd</link><guid isPermaLink="true">https://yestino.com/events/conquering-recursion-0765fd</guid><pubDate>Wed, 14 Oct 2026 05:07:10 GMT</pubDate><description>This article presents a set of combinator patterns which can be used to decompose recursive procedures into smaller, more reusable components.
Sources: Lobsters</description></item></channel></rss>