Scott encoding
E143340
Scott encoding is a method in lambda calculus for representing algebraic data types and their pattern matching behavior using higher-order functions.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Scott encoding canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1255182 — 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: Scott encoding Context triple: [lambda calculus, hasEncoding, Scott encoding]
-
A.
Manchester encoding
Manchester encoding is a digital line code that represents each data bit with a transition in the middle of the bit period, providing both clock and data synchronization on the same signal.
-
B.
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.
-
C.
Specific Area Message Encoding
Specific Area Message Encoding (SAME) is a digital protocol used in U.S. emergency alerting systems to target warnings to specific geographic areas and types of hazards.
-
D.
Encoding Standard
The Encoding Standard is a WHATWG specification that defines how text is encoded and decoded on the web to ensure consistent character handling across browsers and platforms.
-
E.
Spritz cipher
Spritz cipher is a modern stream cipher and hash function designed by Ronald Rivest and Jacob Schuldt as a more secure and flexible successor to RC4.
- 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: Scott encoding Target entity description: Scott encoding is a method in lambda calculus for representing algebraic data types and their pattern matching behavior using higher-order functions.
-
A.
Manchester encoding
Manchester encoding is a digital line code that represents each data bit with a transition in the middle of the bit period, providing both clock and data synchronization on the same signal.
-
B.
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.
-
C.
Specific Area Message Encoding
Specific Area Message Encoding (SAME) is a digital protocol used in U.S. emergency alerting systems to target warnings to specific geographic areas and types of hazards.
-
D.
Encoding Standard
The Encoding Standard is a WHATWG specification that defines how text is encoded and decoded on the web to ensure consistent character handling across browsers and platforms.
-
E.
Spritz cipher
Spritz cipher is a modern stream cipher and hash function designed by Ronald Rivest and Jacob Schuldt as a more secure and flexible successor to RC4.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
encoding scheme
ⓘ
representation in lambda calculus ⓘ |
| advantage |
constant-time access to constructor and fields in many formulations
ⓘ
more natural pattern matching than Church encoding for some data types ⓘ |
| appliedTo |
booleans
ⓘ
lists ⓘ natural numbers ⓘ pairs ⓘ trees ⓘ |
| basedOn |
function application
ⓘ
lambda abstraction ⓘ |
| category |
lambda calculus encodings
ⓘ
representations of algebraic data types ⓘ |
| contrastsWith |
Church encoding
ⓘ
Parigot encoding ⓘ |
| disadvantage |
can be more complex in typed systems
ⓘ
less canonical than Church encoding in some settings ⓘ |
| enables |
representation of coinductive types
ⓘ
representation of inductive types ⓘ |
| field |
functional programming
ⓘ
lambda calculus ⓘ |
| formalizes | case distinction as higher-order function ⓘ |
| models |
product types
ⓘ
recursive data types ⓘ sum types ⓘ |
| namedAfter | Dana Scott ⓘ |
| property |
constructor arguments are passed to branch functions
ⓘ
data values are functions expecting case branches ⓘ pattern matching is represented as function application ⓘ |
| relatedTo |
denotational semantics
ⓘ
domain theory ⓘ system F ⓘ typed lambda calculus ⓘ |
| represents |
algebraic data types
ⓘ
data constructors ⓘ pattern matching behavior ⓘ |
| supports |
case analysis
ⓘ
direct pattern matching ⓘ |
| usedFor |
constructive proofs in type theory
ⓘ
defining interpreters in pure lambda calculus ⓘ encoding pattern matching in calculi without native data types ⓘ reasoning about program equivalence ⓘ |
| usedIn |
proof theory
ⓘ
semantics of programming languages ⓘ theoretical computer science ⓘ |
| uses | higher-order functions ⓘ |
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: Scott encoding Description of subject: Scott encoding is a method in lambda calculus for representing algebraic data types and their pattern matching behavior using higher-order functions.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.