<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Maths on [[logs]]</title><link>https://incipit0.github.io/pweb/tags/maths/</link><description>Recent content in Maths on [[logs]]</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 03 Nov 2023 19:53:38 +0000</lastBuildDate><atom:link href="https://incipit0.github.io/pweb/tags/maths/index.xml" rel="self" type="application/rss+xml"/><item><title>Making sense of adjunctions</title><link>https://incipit0.github.io/pweb/posts/adjunctions/</link><pubDate>Fri, 03 Nov 2023 19:53:38 +0000</pubDate><guid>https://incipit0.github.io/pweb/posts/adjunctions/</guid><description>&lt;p&gt;When I first encountered the concept of an adjunction, I got quite confused as
to what it is, and why it is useful: Just how on earth is a left adjoint of a functor?
What&amp;rsquo;s the matter of a free and forgetful functor, why is free left to forgetful
but not the other way round. That&amp;rsquo;s where this blog comes from. I hope this blogpost
can help demystify adjunction for you a little bit.&lt;/p&gt;</description></item><item><title>Monad in programming and category theory</title><link>https://incipit0.github.io/pweb/posts/monad/</link><pubDate>Tue, 24 Oct 2023 23:48:44 +0100</pubDate><guid>https://incipit0.github.io/pweb/posts/monad/</guid><description>A monoid in the category of monad tutorials</description></item><item><title>Equivalence of proof techniques in proving the fixpoint properties</title><link>https://incipit0.github.io/pweb/posts/fixpoint/</link><pubDate>Thu, 30 Jun 2022 08:59:42 +0100</pubDate><guid>https://incipit0.github.io/pweb/posts/fixpoint/</guid><description>&lt;p&gt;&lt;a href="https://www.cl.cam.ac.uk/teaching/current/DenotSem/"&gt;Denotational Semantics&lt;/a&gt; is
a unique course offered by the Computer Lab at UoC. It can be intimidating at first
glance but at the same time bring you lots of fun and frustration at the same time.
In this blog post we will look at three proof techniques in domain theory and investigate the connections between them.&lt;/p&gt;
&lt;p&gt;In this blog we look at three techniques that can be used to prove the fixpoint
of a function, namely, Tarski&amp;rsquo;s fixpoint theorem, lfp1 + lfp2 and Scott induction.
We will show that they are equivalent to each other by working on an example.&lt;/p&gt;</description></item></channel></rss>