Backus 1978 Turing lecture
E1543308
UNEXPLORED
The Backus 1978 Turing lecture is John Backus’s influential address that critiqued the von Neumann programming style and advocated for functional programming and an algebraic approach to program construction.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Backus 1978 Turing lecture canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T22552224 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Backus 1978 Turing lecture Context triple: [Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs, hasAbbreviation, Backus 1978 Turing lecture]
-
A.
An Axiomatic Basis for Computer Programming
"An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
-
B.
Moore School Lectures on computing
The Moore School Lectures on computing were a landmark 1946 summer course that introduced many of the foundational concepts of modern electronic digital computers and helped disseminate early computer design principles to a generation of pioneers.
-
C.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
D.
Prentice Hall Series in Automatic Computation
Prentice Hall Series in Automatic Computation is a classic academic book series focused on foundational topics in computer science, particularly algorithms, data structures, and programming theory.
-
E.
"A Correspondence between ALGOL 60 and Church’s Lambda-notation"
"A Correspondence between ALGOL 60 and Church’s Lambda-notation" is a seminal paper by Peter Landin that introduced the use of lambda calculus to formally describe and reason about the semantics of the ALGOL 60 programming language, helping to found the field of denotational semantics.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Backus 1978 Turing lecture Target entity description: The Backus 1978 Turing lecture is John Backus’s influential address that critiqued the von Neumann programming style and advocated for functional programming and an algebraic approach to program construction.
-
A.
An Axiomatic Basis for Computer Programming
"An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
-
B.
Moore School Lectures on computing
The Moore School Lectures on computing were a landmark 1946 summer course that introduced many of the foundational concepts of modern electronic digital computers and helped disseminate early computer design principles to a generation of pioneers.
-
C.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
D.
Prentice Hall Series in Automatic Computation
Prentice Hall Series in Automatic Computation is a classic academic book series focused on foundational topics in computer science, particularly algorithms, data structures, and programming theory.
-
E.
"A Correspondence between ALGOL 60 and Church’s Lambda-notation"
"A Correspondence between ALGOL 60 and Church’s Lambda-notation" is a seminal paper by Peter Landin that introduced the use of lambda calculus to formally describe and reason about the semantics of the ALGOL 60 programming language, helping to found the field of denotational semantics.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
→
hasAbbreviation
→
Backus 1978 Turing lecture
ⓘ