Triple
T22552228
| 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 | relatedWork |
P37
|
FINISHED |
| Object |
FP: A Functional Programming System
FP: A Functional Programming System is a programming language and framework introduced by John Backus to exemplify and promote a purely functional, algebraic approach to program construction as an alternative to the von Neumann style.
|
E1542593
|
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: FP: A Functional Programming System | Statement: [Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs, relatedWork, FP: A Functional Programming System]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: FP: A Functional Programming System Context triple: [Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs, relatedWork, FP: A Functional Programming System]
-
A.
The Implementation of Functional Programming Languages
The Implementation of Functional Programming Languages is a foundational textbook that systematically explains how to design and implement compilers and runtime systems for lazy functional languages.
-
B.
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.
-
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.
ACM SIGPLAN International Conference on Functional Programming
The ACM SIGPLAN International Conference on Functional Programming (ICFP) is a leading annual research conference focused on the design, implementation, theory, and application of functional programming languages and paradigms.
-
E.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
- 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: FP: A Functional Programming System Triple: [Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs, relatedWork, FP: A Functional Programming System]
Generated description
FP: A Functional Programming System is a programming language and framework introduced by John Backus to exemplify and promote a purely functional, algebraic approach to program construction as an alternative to the von Neumann style.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: FP: A Functional Programming System Target entity description: FP: A Functional Programming System is a programming language and framework introduced by John Backus to exemplify and promote a purely functional, algebraic approach to program construction as an alternative to the von Neumann style.
-
A.
The Implementation of Functional Programming Languages
The Implementation of Functional Programming Languages is a foundational textbook that systematically explains how to design and implement compilers and runtime systems for lazy functional languages.
-
B.
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.
-
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.
ACM SIGPLAN International Conference on Functional Programming
The ACM SIGPLAN International Conference on Functional Programming (ICFP) is a leading annual research conference focused on the design, implementation, theory, and application of functional programming languages and paradigms.
-
E.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
- 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_69e11e59db848190b4272ecd2b690ffd |
completed | April 16, 2026, 5:37 p.m. |
| NER | Named-entity recognition | batch_69f15f7647208190a1aaebd083bf095a |
completed | April 29, 2026, 1:31 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a0b2d6309d481909185ea6ebaf80d64 |
completed | May 18, 2026, 3:16 p.m. |
| NEDg | Description generation | batch_6a0b364718308190937c3b7ae90ea9df |
completed | May 18, 2026, 3:54 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a0b37998f888190bb53c2429760321a |
completed | May 18, 2026, 4 p.m. |
Created at: April 16, 2026, 8:52 p.m.