Church encoding
E588094
Church encoding is a means of representing data and operators in the lambda calculus using only functions, forming the theoretical basis for functional programming representations of numbers, booleans, and data structures.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Church encoding canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T6370940 — 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: Church encoding Context triple: [Curry encoding, relatedTo, Church encoding]
-
A.
Scott encoding
Scott encoding is a method in lambda calculus for representing algebraic data types and their pattern matching behavior using higher-order functions.
-
B.
Gödel numbering
Gödel numbering is a method in mathematical logic that encodes symbols, formulas, and proofs as unique natural numbers, enabling arithmetic to represent and reason about syntactic statements.
-
C.
Curry encoding
Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
-
D.
Baconian method
The Baconian method is a systematic approach to scientific inquiry that emphasizes empirical observation, experimentation, and inductive reasoning to derive general principles from particular facts.
-
E.
Kleene numbering
Kleene numbering is a method in computability theory for effectively assigning natural numbers to partial recursive functions, refining Gödel numbering to study algorithmic properties of functions.
- 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: Church encoding Target entity description: Church encoding is a means of representing data and operators in the lambda calculus using only functions, forming the theoretical basis for functional programming representations of numbers, booleans, and data structures.
-
A.
Scott encoding
Scott encoding is a method in lambda calculus for representing algebraic data types and their pattern matching behavior using higher-order functions.
-
B.
Gödel numbering
Gödel numbering is a method in mathematical logic that encodes symbols, formulas, and proofs as unique natural numbers, enabling arithmetic to represent and reason about syntactic statements.
-
C.
Curry encoding
Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
-
D.
Baconian method
The Baconian method is a systematic approach to scientific inquiry that emphasizes empirical observation, experimentation, and inductive reasoning to derive general principles from particular facts.
-
E.
Kleene numbering
Kleene numbering is a method in computability theory for effectively assigning natural numbers to partial recursive functions, refining Gödel numbering to study algorithmic properties of functions.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
concept in lambda calculus
ⓘ
representation scheme ⓘ technique in theoretical computer science ⓘ |
| appliedIn | proofs of expressiveness of lambda calculus ⓘ |
| assumes | pure lambda calculus setting ⓘ |
| basisFor |
functional representations of booleans
ⓘ
functional representations of data structures ⓘ functional representations of numbers ⓘ |
| contrastedWith |
Scott encoding
ⓘ
direct machine-level data representations ⓘ |
| example |
Church boolean
ⓘ
Church numeral ⓘ encoded list ⓘ encoded pair ⓘ |
| field |
functional programming
ⓘ
lambda calculus ⓘ theoretical computer science ⓘ |
| goal | represent all computable data using functions alone ⓘ |
| historicalContext |
developed in the context of foundations of mathematics
ⓘ
introduced in early 20th century ⓘ |
| influenced |
design of functional programming languages
ⓘ
theory of data representation in lambda calculus ⓘ |
| namedAfter | Alonzo Church NERFINISHED ⓘ |
| property |
data and control unified as functions
ⓘ
extensional representation of data ⓘ no primitive data types required ⓘ uses only functions ⓘ |
| relatedTo |
Boehm–Berarducci encoding
NERFINISHED
ⓘ
Curry–Howard correspondence NERFINISHED ⓘ Scott encoding ⓘ System F NERFINISHED ⓘ combinatory logic ⓘ functional programming languages ⓘ lambda calculus ⓘ typed lambda calculus ⓘ |
| represents |
algebraic data types
ⓘ
booleans ⓘ data as functions ⓘ lists ⓘ natural numbers ⓘ operators as functions ⓘ pairs ⓘ tuples ⓘ |
| supports |
definition of arithmetic operations
ⓘ
definition of logical operations ⓘ definition of recursion via fixed-point combinators ⓘ |
| uses |
beta reduction
ⓘ
higher-order functions ⓘ lambda abstractions ⓘ |
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: Church encoding Description of subject: Church encoding is a means of representing data and operators in the lambda calculus using only functions, forming the theoretical basis for functional programming representations of numbers, booleans, and data structures.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.