combinatory logic
E588865
Combinatory logic is a foundational formal system in mathematical logic and computer science that eliminates variables by expressing computation through the combination of a small set of primitive functions.
All labels observed (6)
| Label | Occurrences |
|---|---|
| combinatory logic canonical | 3 |
| "Combinatory Logic" by Haskell Curry and Robert Feys | 1 |
| Curry’s combinator | 1 |
| Curry’s combinators | 1 |
| K combinator | 1 |
| SKI combinator calculus | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6370953 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: combinatory logic Context triple: [Curry encoding, influencedBy, combinatory logic]
-
A.
lambda calculus
Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
-
B.
linear logic
Linear logic is a substructural logic introduced by Jean-Yves Girard that treats logical propositions as resources, carefully tracking their use to model state change, concurrency, and resource-sensitive computation.
-
C.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
-
D.
Symbolic Logic
Symbolic Logic is a foundational work in mathematical logic by John Venn that systematically develops and popularizes the use of diagrams and algebraic methods to represent logical relations.
-
E.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
- 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: combinatory logic Target entity description: Combinatory logic is a foundational formal system in mathematical logic and computer science that eliminates variables by expressing computation through the combination of a small set of primitive functions.
-
A.
lambda calculus
Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
-
B.
linear logic
Linear logic is a substructural logic introduced by Jean-Yves Girard that treats logical propositions as resources, carefully tracking their use to model state change, concurrency, and resource-sensitive computation.
-
C.
Church–Rosser property
The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
-
D.
Symbolic Logic
Symbolic Logic is a foundational work in mathematical logic by John Venn that systematically develops and popularizes the use of diagrams and algebraic methods to represent logical relations.
-
E.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
branch of mathematical logic
ⓘ
formal system ⓘ model of computation ⓘ theory of computation ⓘ |
| aimsTo | provide a basis for mathematics without bound variables ⓘ |
| basedOn | combination of primitive combinators ⓘ |
| developedBy |
Haskell Curry
ⓘ
Moses Schönfinkel ⓘ |
| documentedIn |
"Combinatory Logic" by Haskell Curry and Robert Feys
ⓘ
linked to:
combinatory logic
|
| fieldOfStudy |
lambda calculus
ⓘ
mathematical logic ⓘ proof theory ⓘ theoretical computer science ⓘ |
| formalizedIn | equational logic ⓘ |
| hasApplication | categorical combinatory logic ⓘ |
| hasGoal | eliminate variables from formal expressions ⓘ |
| hasHistoricalPeriod | early 20th century ⓘ |
| hasNormalFormConcept | normal form of a combinatory term ⓘ |
| hasNotation | juxtaposition for application ⓘ |
| hasOperation |
combinator abstraction
ⓘ
function application ⓘ |
| hasPrimitive |
I combinator
ⓘ
K combinator ⓘ
linked to:
combinatory logic
S combinator ⓘ |
| hasProblem | decidability of equality of combinatory terms ⓘ |
| hasProperty |
Turing complete
ⓘ
equivalent in expressive power to lambda calculus ⓘ variable-free notation ⓘ |
| hasSubfield |
typed combinatory logic
ⓘ
untyped combinatory logic ⓘ |
| influenced |
combinator-based programming languages
ⓘ
functional programming ⓘ proof assistants ⓘ type theory ⓘ |
| relatedTo |
SKI combinator calculus
ⓘ
linked to:
combinatory logic
lambda calculus ⓘ logic combinators ⓘ |
| studiedIn |
denotational semantics
ⓘ
foundations of mathematics ⓘ |
| supports | representation of functions without variables ⓘ |
| usedFor |
analyzing functional programs
ⓘ
constructing models of lambda calculus ⓘ studying foundations of computation ⓘ |
| usesConcept |
application
ⓘ
combinator ⓘ reduction ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: combinatory logic Description of subject: Combinatory logic is a foundational formal system in mathematical logic and computer science that eliminates variables by expressing computation through the combination of a small set of primitive functions.
Referenced by (8)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: combinatory logic
linked to: combinatory logic
linked to: combinatory logic
linked to: combinatory logic
linked to: combinatory logic