Computer Science on [[logs]]

Core Dump of S-REPLS 14

Fri, 08 Mar 2024 23:38:17 +0000

This is a very high level summary of the experience attending S-REPLS 14. Feel free to look at the respective website of the speakers for more details. To keep this blog concise, I thought I would just use introductory examples where possible to illustrate the idea rather than going into the actual theory behind them.

Graded types and algebraic effects

Graded type system is based on the idea of linear types. Linear types essentially allows one to restrict the usage of variables exactly once, which can be useful for resource management such as IO. Graded types go further than this and allows one to specify the number of times a variable can be used. For example, in the following code¹, the variable a needs to be used exactly twice.

Making sense of adjunctions

Fri, 03 Nov 2023 19:53:38 +0000

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’s the matter of a free and forgetful functor, why is free left to forgetful but not the other way round. That’s where this blog comes from. I hope this blogpost can help demystify adjunction for you a little bit.

Monad in programming and category theory

Tue, 24 Oct 2023 23:48:44 +0100

A monoid in the category of monad tutorials

Erlog: A Distributed Datalog Engine

Sun, 16 Apr 2023 19:53:43 +0000

Showcasing a project on building a distributed Datalog engine in Erlang

Equivalence of proof techniques in proving the fixpoint properties

Thu, 30 Jun 2022 08:59:42 +0100

Denotational Semantics 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.

In this blog we look at three techniques that can be used to prove the fixpoint of a function, namely, Tarski’s fixpoint theorem, lfp1 + lfp2 and Scott induction. We will show that they are equivalent to each other by working on an example.