Restating the constraint correctly: program and data must not share storage. That
is already guaranteed by the instruction set, not by wiring -- none of the eight
instructions can read or write the program memory, ip only moves by one or by a
bracket jump, so there is no self modifying code and no way for data to become
instructions. The two also wrap differently: the tape is linear and halts at the
end, the data is a ring of 64 cells.
Given a strict Harvard split, the program side has two ordinary implementations:
* in place ROM: ip is the address of a parallel EEPROM or flash (28C256, 29C010,
39SF010), fifteen to seventeen address lines and eight data lines, no glue
logic; the chip in a wide socket is the cartridge and there is no boot step;
* on board program RAM plus a one shot load: a separate RAM or block RAM is
filled at reset from any small source (serial flash, microSD, UART, even a
24C512) and then executed in place. Swapping tapes no longer means burning a
chip; the price is a boot state machine and one more chip. It is still not the
data RAM -- only the boot logic can write it, so the Harvard property holds.
Both give random access, so the bracket scan question stays about speed only, and
the loop stack is still the default because the calculator main loop wraps the
whole tape. Media that cannot be addressed at all (mechanical tape, serial only
flash, floppy) remain useful as the source for the second variant.