Term for feature that abstracts RPN program location?

[J-F Garnier]

(05-12-2020 04:33 PM)Orome Wrote:  What is the technical term that describes a programming language that abstracts (or at least largely abstracts) the machine location of programs?

I’m thinking here specifically of the evolution of HP keystroke languages, from early (and some late) models where each instruction exists in a single linear space (e.g., before the 41 series), to (some) later models such as the 41 series and the 42S, where each program exists in its own space.

Interesting question, in my opinion the key here is not the fact that the program space is global to all programs (e.g. 15C) or in separated areas (e.g. 41C) but the use of absolute line references for jumps and calls.
Without line references but labels for jumps and calls (15C, 41C), the program is relocatable in the sense that it is keyed in exactly in the same way regardless of its position in memory. This is not true for machines that use line references (e.g. 12C).

For the right term describing this, I just used 'relocatable' above, but in the HP calculator world the usual term may better be label-referenced vs line-referenced goto/gosub.

J-F