Triple

T5945348

Position	Surface form	Disambiguated ID	Type / Status
Subject	John Backus	`E132264`	entity
Predicate	wrote	`P2831`	FINISHED
Object	Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs "Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs" is a landmark 1977 paper that introduced and advocated for functional programming as an alternative to traditional von Neumann architectures, laying theoretical foundations for modern functional languages.	`E557585`	NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini

Instruction

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Input

Phrase: Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs | Statement: [John Backus, wrote, Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs]

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
Context triple: [John Backus, wrote, Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs]

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. A Discipline of Programming
A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
C. Notes on Structured Programming
Notes on Structured Programming is a seminal work by Edsger W. Dijkstra that advocates for disciplined, mathematically grounded program design and helped popularize the principles of structured programming.
D. Scheme: An Interpreter for Extended Lambda Calculus
"Scheme: An Interpreter for Extended Lambda Calculus" is the seminal 1975 technical report by Gerald Jay Sussman and Guy L. Steele Jr. that introduced the Scheme programming language and demonstrated the power of lexical scoping and first-class procedures in a minimalist Lisp dialect.
E. Revised^n Report on the Algorithmic Language Scheme
The Revised^n Report on the Algorithmic Language Scheme is the series of formal documents that define and evolve the official specification of the Scheme programming language.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NEDg Description generation gpt-5.1

Instruction

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Input

Entity: Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
Triple: [John Backus, wrote, Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs]

Generated description

"Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs" is a landmark 1977 paper that introduced and advocated for functional programming as an alternative to traditional von Neumann architectures, laying theoretical foundations for modern functional languages.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs
Target entity description: "Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs" is a landmark 1977 paper that introduced and advocated for functional programming as an alternative to traditional von Neumann architectures, laying theoretical foundations for modern functional languages.

A. 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.
B. 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.
C. A Discipline of Programming
A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
D. Notes on Structured Programming
Notes on Structured Programming is a seminal work by Edsger W. Dijkstra that advocates for disciplined, mathematically grounded program design and helped popularize the principles of structured programming.
E. Scheme: An Interpreter for Extended Lambda Calculus
"Scheme: An Interpreter for Extended Lambda Calculus" is the seminal 1975 technical report by Gerald Jay Sussman and Guy L. Steele Jr. that introduced the Scheme programming language and demonstrated the power of lexical scoping and first-class procedures in a minimalist Lisp dialect.
F. None of above. chosen

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step	Stage	Batch ID	Status	When
creating	Elicitation	`batch_69c00869d3308190af89b2453e0f7546`	completed	March 22, 2026, 3:19 p.m.
NER	Named-entity recognition	`batch_69c0393a10448190b0960f4487e87448`	completed	March 22, 2026, 6:47 p.m.
NED1	Entity disambiguation (via context triple)	`batch_69c0c084fce481909c306d6eeb99066d`	completed	March 23, 2026, 4:24 a.m.
NEDg	Description generation	`batch_69c0c19665b08190ab3c66b7c6c33f61`	completed	March 23, 2026, 4:29 a.m.
NED2	Entity disambiguation (via description)	`batch_69c0c4576824819080ced71df8fdda6c`	completed	March 23, 2026, 4:40 a.m.

Created at: March 22, 2026, 4:01 p.m.