High-level programming language: Science
Principles
The science it rests on, with why each principle matters to it
Relies on- Computability and the universal machine Turing showed that a universal machine can compute everything that is humanly computable [6], so a program written once in a language can be turned into any computer's instructions.
- Boolean logic The true-or-false tests and logical operators in every language, and the circuits that run them, follow Boole's algebra of logic [7].
as of 2026-11-10
Discoveries
The discoveries that made it possible: when, by whom and what was found
| Year | Who | What |
|---|---|---|
| 1854 | George Boole | Publishes An Investigation into the Laws of Thought, the start of the algebra of logic [7] |
| 1936 | Alan Turing | Publishes On Computable Numbers, the paper behind the universal Turing machine [6] |
as of 2026-11-10
The science explained
The science behind it explained for a curious reader
Think of a recipe written for a cook and the same recipe written for a robot that knows only a few movements: grip, lift, turn, release. The cook's version is short, because the cook fills in the details. The robot's version is long and easy to get wrong. A high-level language lets a programmer write the cook's version, and a compiler is a second program that expands it into the robot's version automatically. That trick is possible because of a deep result: in 1936 Alan Turing showed that one universal machine can carry out any step-by-step procedure [6]. So any procedure written clearly enough in one notation can be translated, mechanically, into the instructions of any real computer. Grace Hopper's A-0 of 1952 was a pioneering translator of this kind [1][2].
as of 2026-11-10
Sources
- Milestones:Grace Hopper's Compiler and Programming Language Work, 1952-1959 IEEE, Engineering and Technology History Wiki
- From Punch Cards to Python IEEE Spectrum (Joanna Goodrich), 2024
- Alan Turing Encyclopaedia Britannica
- Boole Collection UCC Library, University College Cork