An Addressless Coding Scheme based on Mathematical Notation

(1957). An Addressless Coding Scheme based on Mathematical Notation.

Type

Unclassified

Intellectual base

Unclassified

Year

1957

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Reverse Polish notation
  • For example, the distinction between constitutive identity and a convenient observable transfers from The infix expression (3+4)×5 becomes 3 4 + 5 ×. to A parser preserves operand order for noncommutative operators and validates stack underflow and leftover values..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:90cc195c4b7b · see in the full table