Q: Why The Disparity?

In assembler, mutation is one opcode MOV.

Why does this memory footprint disparity exist?

It takes only a few bytes to express save.

is this just a difference in problem complexity?

Sector Lisp - FP pure as the driven snow

or, is there something wrong with what we’re doing? and how we’re doing it?

Yet, we use General purpose Programming Languages (GPLs), like Python, Rust, etc. daily which result in apps that need MBytes of memory.

complete language in <512 bytes[sic]

essential complexity?

no mutation, no heap

GC very, very small (40 bytes)

GC more pure than that of McCarthy

2 types - List and Atom

even smaller than Sector Lisp