Yesterday I watched a conference talk about Formal Logic and De Morgan’s laws were discussed.
Wikipedia does a very good job of explaining the laws in-depth, but essentially they are transformation rules that allow you to simplify certain propositions.
Whilst programming, predicate logic of this form appears very frequently, and it is very useful to know how you can rewrite a predicate to better describe its intent.

Last week I was required to validate that a supplied integer would fit correctly into a 32-bit address space.
The available size of an integer within PHP is platform dependent, and could either be 32 or 64 bits based on the architecture you are using.
This function had to cater for these differences and as such I decided to explore a couple of different options for producing this validation.

In a recent tweet from Adam Wathan highlighting one of the examples in his upcoming book, he demonstrated breaking down the process of converting from binary to decimal representation using a pipeline of transformations.
I thought it would again be interesting to see how I would go about performing this process in JavaScript.

Recently I have been looking more into SQL and in-particular how RDMS’s work under-the-hood.
I thought it would be interesting to use some of the lesser-known features that PostgreSQL has to offer, concentrating my efforts on operations performed on a deck of cards.

In a recent Full Stack Radio podcast, discussion around the application of transpose and zip on collections made me wonder how I would go about implementing such a feature in JavaScript.