This is a quick and dirty post attempting rational (fraction) math with Prolog's integer constraint library. CLPFD works well for integer math, but it is not built to handle decimal values. This limits where you can use CLPFD, if a domain has even a single non-integer value, you'll have to …

In yesterday's post we wrote a Prolog predicate for 'bookend numeronyms'. Ian Brown wrote an Emacs extension with a similar goal, but in that extension he included an Easter Egg in the examples:

Some examples of (numerical contraction) numeronyms:

• i18n --- internationalization
• a11y --- accessibility
• c14n --- canonicalization
• o11y --- observability
• e14n --- Andreesen Horowitz …

Have you ever wondered about kay eights? What it is? Where it comes from? and why does it keep showing up everywhere?

Numeronyms are abbreviations that involve (you guessed it) numerals. They come in many forms, but in one common subcategory …

I've been thinking about a non-existent language for evaluating expressions on multiple data resources. It's key properties are:

• Limited capability
• Easily interpreted
• Global references to cross-application data models
• Logic owned by the backend

The fastest way to grok what I'm proposing is through a code snippet. Imagine this JSON object …

I am slowly building up the ability to work with Clojure macros. This was my main motivation for learning the language, since I want to learn a new way of thinking.

Here's a simple macro I wrote as I was learning. It doesn't do much. It uses the built-in &env …

The Kotlin standard library has a peculiarly long method called firstNotNullOfOrNull. The method maps a function to a collection and returns the first that evaluates to a non-null value. If there are no so elements, the method returns null. As an exercise I reproduced the method in Clojure.

A …

I write this article as I bumble around trying to wrap my head around Clojure. This article serves mostly to document my journey to accomplish the simple task of implementing a linked list. On the face, this is relatively simple:

(defrecord RListNode [value next])

(defn r-first [ln] (:value ln))
(defn …

Complexity is a hot-topic and catchy phrase. Everyone agrees "Complexity is bad" and "simplicity is good", but the terms continue to be muddled in mixed meaning and over-use. This page serves as a series of notes on the terms. I don't agree with all the theories here, I'm just penning …

In Rich Hickey's 2016 talk Speculation he argues that too often library authors break backwards compatibility. Instead library authors should aim to maintain backwards compatibility potentially indefinitely.

Much of the talk is spent creating a framework for understanding backwards compatibility when it comes to software (and specifically Clojure). This is …

Reactive programming offers a powerful paradigm for handling asynchronous and event-driven code. When working with reactive frameworks, it's important to understand the distinction between two key timelines: the Construction Timeline and the Subscription Timeline. In this article, we'll explore these timelines, their significance, and the potential bugs that can occur …