Curry (program transformation)
E839550
Curry (program transformation) is a program transformation technique in functional programming, named after logician Haskell Curry, that systematically converts higher-order functions into equivalent first-order forms.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Curry (program transformation) canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10063120 — 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: Curry (program transformation) Context triple: [Haskell Curry, hasConceptNamedAfter, Curry (program transformation)]
-
A.
Curry encoding
Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
-
B.
Partial Evaluation and Program Manipulation
Partial Evaluation and Program Manipulation (PEPM) is a specialized conference and research area in computer science focused on techniques for program transformation, optimization, and analysis through partial evaluation and related methods.
-
C.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
-
D.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
E.
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) is a specialized academic venue focusing on research in program transformation, partial evaluation, and related aspects of program analysis and manipulation.
- 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: Curry (program transformation) Target entity description: Curry (program transformation) is a program transformation technique in functional programming, named after logician Haskell Curry, that systematically converts higher-order functions into equivalent first-order forms.
-
A.
Curry encoding
Curry encoding is a technique in lambda calculus for representing data structures and algebraic types purely as higher-order functions.
-
B.
Partial Evaluation and Program Manipulation
Partial Evaluation and Program Manipulation (PEPM) is a specialized conference and research area in computer science focused on techniques for program transformation, optimization, and analysis through partial evaluation and related methods.
-
C.
Hindley–Milner type system
The Hindley–Milner type system is a classical polymorphic type system used in many functional programming languages, notable for enabling type inference without explicit type annotations.
-
D.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
E.
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
The ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) is a specialized academic venue focusing on research in program transformation, partial evaluation, and related aspects of program analysis and manipulation.
- F. None of above. chosen
Statements (38)
| Predicate | Object |
|---|---|
| instanceOf |
program transformation technique
ⓘ
technique in functional programming ⓘ |
| aimsTo | convert higher-order functions to first-order functions ⓘ |
| appliesTo | higher-order functions ⓘ |
| assumes | source language supports higher-order functions ⓘ |
| basedOn |
ideas from combinatory logic
ⓘ
representation of functions without variables ⓘ |
| benefit |
can improve performance on first-order execution platforms
ⓘ
enables use of first-order model checkers ⓘ enables use of first-order theorem provers ⓘ |
| category | program analysis and transformation ⓘ |
| effect |
reduces need for closures at runtime
ⓘ
removes higher-order values from runtime representation ⓘ |
| field |
functional programming
ⓘ
programming languages ⓘ |
| goal |
facilitate reasoning about programs using first-order techniques
ⓘ
make higher-order programs executable on first-order abstract machines ⓘ |
| influencedBy | work of Haskell Curry on combinatory logic ⓘ |
| input | higher-order program ⓘ |
| namedAfter | Haskell Curry NERFINISHED ⓘ |
| output | first-order program ⓘ |
| preserves |
observable behavior of programs
ⓘ
program semantics ⓘ |
| relatedTo |
closure conversion
ⓘ
defunctionalization ⓘ lambda lifting ⓘ |
| requires | systematic encoding of function spaces ⓘ |
| resultsIn | first-order representations of functions ⓘ |
| targetLanguage | first-order language ⓘ |
| typicalStep |
introducing explicit data structures for function values
ⓘ
replacing function arguments with first-order encodings ⓘ |
| usedFor |
eliminating higher-order functions
ⓘ
enabling first-order optimization techniques ⓘ simplifying program analysis ⓘ |
| usedIn |
compilation of functional languages
ⓘ
implementation of higher-order features ⓘ |
| usedInContext |
compilers for functional languages
ⓘ
formal methods for program verification ⓘ |
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: Curry (program transformation) Description of subject: Curry (program transformation) is a program transformation technique in functional programming, named after logician Haskell Curry, that systematically converts higher-order functions into equivalent first-order forms.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.