Triple

T23281162
Position Surface form Disambiguated ID Type / Status
Subject Curry–Howard correspondence E588866 entity
Predicate usedIn P98 FINISHED
Object Idris programming language
Idris is a functional programming language with full-spectrum dependent types that leverages the Curry–Howard correspondence to support expressive, machine-checked proofs alongside general-purpose programming.
 E1578108 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: Idris programming language | Statement: [Curry–Howard correspondence, usedIn, Idris programming language]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Idris programming language
Context triple: [Curry–Howard correspondence, usedIn, Idris programming language]
  • A. Idris 2
    Idris 2 is a modern, dependently typed functional programming language and proof assistant designed as the next-generation evolution of Idris, featuring a new core language and improved tooling.
  • B. 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.
  • C. Well-Typed LLP
    Well-Typed LLP is a Haskell-focused consultancy and development company known for its core contributions to the Glasgow Haskell Compiler and the Haskell ecosystem.
  • D. Agda
    Agda is a dependently typed functional programming language and interactive theorem prover used for formal verification and constructive mathematics.
  • E. Haskell
    Haskell is a statically typed, purely functional programming language known for its strong type system, lazy evaluation, and use in both academic research and industry.
  • 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: Idris programming language
Triple: [Curry–Howard correspondence, usedIn, Idris programming language]
Generated description
Idris is a functional programming language with full-spectrum dependent types that leverages the Curry–Howard correspondence to support expressive, machine-checked proofs alongside general-purpose programming.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Idris programming language
Target entity description: Idris is a functional programming language with full-spectrum dependent types that leverages the Curry–Howard correspondence to support expressive, machine-checked proofs alongside general-purpose programming.
  • A. Idris 2
    Idris 2 is a modern, dependently typed functional programming language and proof assistant designed as the next-generation evolution of Idris, featuring a new core language and improved tooling.
  • B. 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.
  • C. Well-Typed LLP
    Well-Typed LLP is a Haskell-focused consultancy and development company known for its core contributions to the Glasgow Haskell Compiler and the Haskell ecosystem.
  • D. Agda
    Agda is a dependently typed functional programming language and interactive theorem prover used for formal verification and constructive mathematics.
  • E. Haskell
    Haskell is a statically typed, purely functional programming language known for its strong type system, lazy evaluation, and use in both academic research and industry.
  • 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_69e25d16e2c08190a291de254703129e completed April 17, 2026, 4:17 p.m.
NER Named-entity recognition batch_69f19642b46481909fd455acd2155792 completed April 29, 2026, 5:25 a.m.
NED1 Entity disambiguation (via context triple) batch_6a0c3f7f06a08190a3ac574cdcd79e3d completed May 19, 2026, 10:46 a.m.
NEDg Description generation batch_6a0c4075bc508190ae0dc8b61c24faa0 completed May 19, 2026, 10:50 a.m.
NED2 Entity disambiguation (via description) batch_6a0c411702a48190ba2964ba221394d1 completed May 19, 2026, 10:53 a.m.
Created at: April 17, 2026, 4:57 p.m.