Metraipolis › archive › dc_132be535ff44
The Mathematical Evolution of Addressing: From Yushchenko's Address Programming Language to A Mathematics of Arrays How Addressing Evolved into a Mathematical Theory of… — arXiv:2609.23854
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23854
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T22:41:49.111Z
- SHA-256 of the archived text
728a968c7a2b2216fc3888c8243b2abb8dc2484637c2a850763359f13aef2755- Stable URL of this page
https://metraipolis.com/documento/dc_132be535ff44
How to cite
The Mathematical Evolution of Addressing: From Yushchenko's Address Programming Language to A Mathematics of Arrays How Addressing Evolved into a Mathematical Theory of… — arXiv:2609.23854 — arXiv (en), https://arxiv.org/abs/2609.23854 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_132be535ff44 (Metraipolis archive dc_132be535ff44, sha256 728a968c7a2b2216fc3888c8243b2abb8dc2484637c2a850763359f13aef2755)
BibTeX
@misc{dc132be535ff44,
title = {The Mathematical Evolution of Addressing: From Yushchenko's Address Programming Language to A Mathematics of Arrays How Addressing Evolved into a Mathematical Theory of… — arXiv:2609.23854},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23854},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_132be535ff44; sha256 728a968c7a2b2216fc3888c8243b2abb8dc2484637c2a850763359f13aef2755},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23854. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This article argues that a central development in the history of computing is the mathematical evolution of addressing. During the three decades separating Kateryna Yushchenko's Address Programming Language (1958) from Lenore Mullin's A Mathematics of Arrays (1988), addressing evolved from a machine-level mechanism for locating data into a formal theory of indexing, reduction, and machine realization, passing through Kenneth Iverson's algebra of arrays and Philip Abrams' recognition of shape as an architectural resource. Mullin's theory establishes indexing itself, via the function {\psi}, as the primitive from which array operations compose, reduce to a Denotational Normal Form, transform into an Operational Normal Form, and realize on hardware through dimension lifting. Historical claims are sourced against primary material, with inferences flagged as such; mathematical claims are stated as identities; performance claims are marked validated, theoretically established, or provisional. The result links programming languages, array mathematics, and computer architecture in one account.
Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-22 in cs.PL).
Categorie arXiv: General Literature (cs.GL) ; Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2609.23854 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T22:25:03.985Z dalla pagina https://arxiv.org/catchup/cs.PL/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).