💾 Archived View for dcreager.net › concatenative › basis-categories.gmi captured on 2023-11-04 at 11:30:02. Gemini links have been rewritten to link to archived content
-=-=-=-=-=-=-
Brent Kerby describes several “bases” — sets of primitive instructions that are sufficient to make a concatenative language Turing complete, since all other instructions can be written in terms of your basis.
The Theory of Concatenative Combinators » Linear Completeness
In my Strange Loop talk, I call out that there are six “categories” that your primitive instructions need to cover to form a valid basis:
Kerby also discusses “constructive” bases, where we remove “destroy” from the list, and “linear” bases where we remove “duplicate” and “destroy”.
[Strange Loop] Concatenative programming and stack-based languages