Tag Archives: Programming

Initial Algebras: Part II

In the last post we looked at functor algebras and properties of morphisms (arrows) between them. In this post we’ll explore initial functor algebras (or initial F-Algebras). The Cliffhanger The last episode ended with a question on whether it is … Continue reading

Posted in Computers | Tagged , , , , | Leave a comment

Logic Puzzles in Agda

This post assumes basic knowledge of Agda. A few days ago, Paul Snively published a post which set me thinking on how Agda (which is the closest thing to Coq I have some knowledge of) fares in similar scenarios. Pretty … Continue reading

Posted in Computers | Tagged , , , | Leave a comment

On Monads, Part II

Recap As promised, we will now talk about how we can exploit the monadic style of programming to: Introduce sequentiality into an programmings environment that lack the concept of time Propagate some hidden data through a sequence of expressions. Last … Continue reading

Posted in Computers | Tagged , , , , | Leave a comment

On Monads, Part I

Introduction This is the first instalment in two (or maybe three) posts I shall write to explain how Monads work in stateless function-oriented programming languages. This is less intended as a resource for a third party than as a way … Continue reading

Posted in Computers | Tagged , , , | Leave a comment