lambda calculus
E26971
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.
All labels observed (4)
| Label | Occurrences |
|---|---|
| lambda calculus canonical | 10 |
| Church numerals | 1 |
| Computability and λ-definability | 1 |
| untyped lambda calculus | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T211709 — 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: lambda calculus Context triple: [Alonzo Church, knownFor, lambda calculus]
-
A.
Scheme
Scheme is a minimalist, lexically scoped dialect of the Lisp programming language known for its elegant functional programming model and powerful macro system.
-
B.
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
C.
ALGOL 60
ALGOL 60 is an early high-level programming language that pioneered block structure and lexical scoping, profoundly influencing the design of many later languages.
-
D.
ReasonML
ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
-
E.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
- 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: lambda calculus Target entity description: 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.
-
A.
Scheme
Scheme is a minimalist, lexically scoped dialect of the Lisp programming language known for its elegant functional programming model and powerful macro system.
-
B.
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
C.
ALGOL 60
ALGOL 60 is an early high-level programming language that pioneered block structure and lexical scoping, profoundly influencing the design of many later languages.
-
D.
ReasonML
ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
-
E.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
formal system
ⓘ
model of computation ⓘ theoretical framework ⓘ |
| equivalentTo | Turing machine in computational power ⓘ |
| field |
mathematical logic
ⓘ
theoretical computer science ⓘ |
| formalizedIn | lambda notation ⓘ |
| foundationFor |
functional programming languages
ⓘ
theory of programming languages ⓘ |
| hasApplication |
automated theorem proving
ⓘ
compiler design ⓘ program verification ⓘ |
| hasConcept |
Church–Rosser property
ⓘ
alpha conversion ⓘ beta reduction ⓘ bound variable ⓘ combinator ⓘ confluence ⓘ eta conversion ⓘ free variable ⓘ lambda abstraction ⓘ normal form ⓘ strong normalization ⓘ weak normalization ⓘ |
| hasEncoding |
Church encoding
ⓘ
Curry encoding ⓘ Scott encoding ⓘ |
| hasProperty | Turing completeness ⓘ |
| hasVariant |
dependent type lambda calculus
ⓘ
polymorphic lambda calculus ⓘ simply typed lambda calculus ⓘ lambda calculus self-linksurface differs ⓘ
surface form:
untyped lambda calculus
|
| influenced |
F#
ⓘ
Haskell ⓘ Lisp programming language ⓘ
surface form:
LISP
LambdaProlog ⓘ ML ⓘ OCaml ⓘ Scheme ⓘ |
| introducedBy | Alonzo Church ⓘ |
| introducedInYear | 1930s ⓘ |
| relatedTo | combinatory logic ⓘ |
| represents | computable functions ⓘ |
| studies | computation ⓘ |
| usedIn |
denotational semantics
ⓘ
proof theory ⓘ type theory ⓘ |
| uses |
function abstraction
ⓘ
function application ⓘ |
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: lambda calculus Description of subject: 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.
Referenced by (13)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Alonzo Church
On Computable Numbers with an Application to the Entscheidungsproblem
→
relatedTo
→
lambda calculus
ⓘ
subject surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
On Computable Numbers with an Application to the Entscheidungsproblem
→
followedBy
→
lambda calculus
ⓘ
subject surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
this entity surface form:
Computability and λ-definability
this entity surface form:
untyped lambda calculus
this entity surface form:
Church numerals
subject surface form:
Lisp