→
A Survey of Agentic Coordination Formalisms

What Deleuze and Guattari's assemblage names in a multiagent system, and the formal theories, from session types to Dec-POMDPs, that let us reason about it

→
Petri Nets: Tokens, Workflows, and Decidable Soundness

Places, transitions, and the token game; why fixed topology buys decidability, and what workflow nets make of it

→
The π-Calculus: Computation as Communication

An introduction to Milner's calculus of mobile processes, and what it has to say about actors, agents, and orchestration

→
Pattern Matching on Elixir's AST

Using Elixir's homoiconic AST as a query language—from IEx exploration to structural fingerprinting

→
Backus-Naur Form: Syntax Specification for Language Design

An introduction to Backus-Naur Form notation for formally specifying programming language syntax

→
Database Normal Forms: Eliminating Redundancy Through Systematic Decomposition

An introduction to database normalisation theory from First Normal Form through Boyce-Codd Normal Form, with practical examples and historical context.

→
Async Iterators in Rust
→
Classic Papers - Reducibility Among Combinatorial Problems

Karp's 21 NP-complete problems and why reductions matter for algorithms and complexity

→
Computational Reversibility and Landauer’s Limit

Why erasing bits costs energy, and how reversible computing tries to avoid it

→
Async Iterators in JavaScript

Using async generators, for-await loops, and streams to handle data incrementally

→
Sequence Maps for Modelling State Machines
→
Notes on Girard's Linear Logic

The foundational 1987 paper introducing linear logic