Triple

T22552224
Position Surface form Disambiguated ID Type / Status
Subject Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs E557585 entity
Predicate hasAbbreviation P43 FINISHED
Object Backus 1978 Turing lecture NE NERFINISHED

How this triple was built (3 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: Backus 1978 Turing lecture | Statement: [Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs, hasAbbreviation, Backus 1978 Turing lecture]
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

Provenance (2 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_69e11e59db848190b4272ecd2b690ffd completed April 16, 2026, 5:37 p.m.
NER Named-entity recognition batch_69f15f7647208190a1aaebd083bf095a completed April 29, 2026, 1:31 a.m.
Created at: April 16, 2026, 8:52 p.m.