-
A Tiling for Computation
A small, fixed alphabet whose local composition rules generate an unbounded, non-repeating space of checkable systems — token standards, business operations, games, music, our own infrastructure. Not one system that swallows every domain. Two tiles, remixed without limit.
-
The Little Language Thesis
cell, func, arrow, guard are the structural primitives — but the real ubiquitous language lives in the labels. Like Forth, we build up domain vocabularies on a minimal substrate.
-
Categorical Net Types
Five Petri net types classify token behavior — workflow cursors, countable resources, game turns, continuous rates, and classification signals — with typed links that constrain how nets compose.
-
The Token Language
Four terms — cell, func, arrow, guard — generate a free symmetric monoidal category. The DSL is a categorical language for executable token models.