💾 Archived View for dcreager.net › concatenative › linear-basis-2.gmi captured on 2023-11-14 at 07:52:50. Gemini links have been rewritten to link to archived content
⬅️ Previous capture (2023-11-04)
-=-=-=-=-=-=-
Brent Kerby calls out that ‘cons’ and ‘sap’ are a linear basis in a concatenative language.
The Theory of Concatenative Combinators » Linear Completeness
[B] [A] cons == [[B] A] [B] [A] sap == A B
This is a valid basis because ‘cons’ covers quoting and concatenation, and ‘sap’ covers reordering and unquoting.