Triple
T36898851
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Calculus of Constructions |
E911973
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | higher-order typed lambda calculus |
C59135
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: higher-order typed lambda calculus Context triple: [Calculus of Constructions, instanceOf, higher-order typed lambda calculus]
-
A.
type theory
chosen
Type theory is a formal framework that classifies expressions by their types to ensure logical consistency and safety in mathematical proofs and programming languages.
-
B.
higher-order logic theorem prover
A higher-order logic theorem prover is a software system that automatically or interactively checks, derives, and manipulates logical statements and proofs in a logic where functions and predicates can take other functions and predicates as arguments.
-
C.
foundational paper in type theory
A foundational paper in type theory is a seminal scholarly work that introduces or rigorously formalizes core concepts, systems, or results that shape the theoretical and practical development of type systems in logic and computer science.
-
D.
dependently typed programming language
A dependently typed programming language is one in which types can depend on values, enabling the expression and static verification of rich logical properties directly in the type system.
-
E.
representation in lambda calculus
A representation in lambda calculus is a systematic encoding of data, operations, or computational structures solely using lambda terms, enabling them to be manipulated and reasoned about within the formalism.
- F. None of above.
Provenance (1 batch)
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_69f76e841b54819097e7fa768bbc70b2 |
completed | May 3, 2026, 3:49 p.m. |
Created at: May 3, 2026, 4:13 p.m.