public/post/index.xml


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Posts on </title>
    <link>https://blog.gluegadget.com/post/</link>
    <description>Recent content in Posts on </description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Tue, 17 Feb 2026 20:59:41 +0000</lastBuildDate>
    <atom:link href="https://blog.gluegadget.com/post/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Fairstream</title>
      <link>https://blog.gluegadget.com/post/fairstream/</link>
      <pubDate>Tue, 17 Feb 2026 20:59:41 +0000</pubDate>
      <guid>https://blog.gluegadget.com/post/fairstream/</guid>
      <description>&lt;p&gt;&lt;a href=&#34;https://en.wikipedia.org/wiki/Backtracking&#34;&gt;Backtracking&lt;/a&gt; is a versatile approach for solving search problems by building solutions incrementally.  If a partial solution cannot be extended, it is discarded and the process returns to a previous step to explore an alternative path.  This method is generally more efficient than brute-force searching due to pruning: stopping exploration of a branch as soon as it violates a constraint, which eliminates entire sections of the search space.&lt;/p&gt;&#xA;&lt;p&gt;Strictly speaking, fair backtracking is not required for all search problems. A fair strategy guarantees all branches make progress, preventing any single branch from starving the others. The List monad handles non-deterministic computation well, and within a finite search space it produces the same results as a fair stream. When the search space is infinite, or when one branch may produce unbounded results, fairness becomes essential to ensure completeness.&lt;/p&gt;</description>
    </item>
    <item>
      <title>ThinkPad E470</title>
      <link>https://blog.gluegadget.com/post/2017-08-22-thinkpad-e470/</link>
      <pubDate>Tue, 22 Aug 2017 00:00:00 +0000</pubDate>
      <guid>https://blog.gluegadget.com/post/2017-08-22-thinkpad-e470/</guid>
      <description>&lt;p&gt;Recently I&amp;rsquo;ve been looking for a Linux-friendly, budget laptop. I like ThinkPads, and all of my laptops have been either T-series or X-series but this time I didn&amp;rsquo;t want to spend that amount of money and was looking for cheaper alternatives.&lt;/p&gt;&#xA;&lt;p&gt;Browsing Lenovo website, I realised that a reasonably configured &lt;a href=&#34;http://www3.lenovo.com/ie/en/laptops/thinkpad/edge-series/E470/p/22TP2TEE470&#34;&gt;E470&lt;/a&gt; would cost about €1000 which was about how much I was willing to pay. I configured it, so it has:&lt;/p&gt;</description>
    </item>
    <item>
      <title>Types and Programming Languages</title>
      <link>https://blog.gluegadget.com/post/2017-08-16-tapl/</link>
      <pubDate>Wed, 16 Aug 2017 00:00:00 +0000</pubDate>
      <guid>https://blog.gluegadget.com/post/2017-08-16-tapl/</guid>
      <description>&lt;p&gt;February 2016, as a birthday present to myself I bought a copy of &lt;a href=&#34;https://www.cis.upenn.edu/~bcpierce/tapl/&#34;&gt;Types and Programming Languages&lt;/a&gt;.  At the time the only thing I did with it was to take a photo of it, sharing it on Twitter and congratulating myself.  To be fair, I did try reading it, but it was so intimidating that I gave up very early in the book. One and a half years later I’m going to give it another go because a few things have changed.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>