Kleisli is a term that appears frequently when reading about functional programming. It is an important concept but it is not trivial to grasp. Often it is easier to understand new ideas by putting them into practice, in this blog entry we will see h...
Much (most?) of the third-parties software that you will have to deal with will not handle asynchronous actions using our beloved IO monad, they will instead use either Scala’s or Java’s Future. This brief entry shows how to convert those Futures int...
This blog entry will show how to add a simple retry mechanism to cats-effect (CE) using Scala 3 extensions. The idea is that whenever we define our IO instances we can also specify that, if they fail and certain conditions are met, they will be autom...
The 'Functional programming in Scala' book (aka 'the red book') defines a state transformation as a function with this signature: S => (S, A) where S is a type representing the state of our application and A is the type of the output we get running ...
The dining philosophers problem is a classical concurrency problem. This post shows an example of how you can use Scala 3 and the Cats Effect (CE) libraryto implement a solution of that problem. 💡 All code samples can be compiled using scala-cli. T...
(all code samples can be run using scala-cli) If you use Cats Effect (CE) it is likely you have found that you need a Map instance that has to be fiber-safe as several fibers can access it concurrently. MapRef is a type offered by CE std package that...
