¶S₀

S₀ bytecode

Four stacks

Continuation-passing S₀: The return

Bethel stacks

Slip and slurp

¶Concatenative

Should Swanson be concatenative?

A linear basis for Swanson

¶Stack values

Stacks should be first-class

Should stack values be modeled as quotations?

Staged stacks are just values

¶Quotations

Closing over values

¶Staged programming

Towers of stacks

¶Miscellaneous

There shouldn't be any names in S₀

Branches are the key

¶Out of date

Primitives should be primitive

Swanson formalism

Rethinking the ‘enum’ and ‘struct’ modules