LambdaProlog
E143339
LambdaProlog is a logic programming language that extends Prolog with higher-order features, polymorphism, and strong support for reasoning about formal systems and syntax with bindings.
All labels observed (2)
| Label | Occurrences |
|---|---|
| LambdaProlog canonical | 1 |
| λProlog | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1255178 — 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: LambdaProlog Context triple: [lambda calculus, influenced, LambdaProlog]
-
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.
Lisp programming language
Lisp is a pioneering high-level programming language, especially influential in artificial intelligence research and known for its symbolic processing and distinctive parenthesized syntax.
-
C.
Chez Scheme
Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
-
D.
Lambda
Lambda is a General Motors mid-size crossover SUV platform used for vehicles such as the Saturn Outlook.
-
E.
SETL
SETL is a high-level programming language developed in the late 1960s that is notable for its powerful set-theoretic abstractions and influence on later language design.
- 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: LambdaProlog Target entity description: LambdaProlog is a logic programming language that extends Prolog with higher-order features, polymorphism, and strong support for reasoning about formal systems and syntax with bindings.
-
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.
Lisp programming language
Lisp is a pioneering high-level programming language, especially influential in artificial intelligence research and known for its symbolic processing and distinctive parenthesized syntax.
-
C.
Chez Scheme
Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
-
D.
Lambda
Lambda is a General Motors mid-size crossover SUV platform used for vehicles such as the Saturn Outlook.
-
E.
SETL
SETL is a high-level programming language developed in the late 1960s that is notable for its powerful set-theoretic abstractions and influence on later language design.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
logic programming language
ⓘ
programming language ⓘ |
| basedOn | Prolog ⓘ |
| designedFor |
encoding inference systems
ⓘ
encoding operational semantics ⓘ encoding typing rules ⓘ meta-theoretic reasoning ⓘ |
| extends | Prolog ⓘ |
| hasDesignGoal |
support reasoning about deductive systems
ⓘ
support reasoning about operational semantics ⓘ support reasoning about type systems ⓘ support specification of formal systems ⓘ treat binding structures declaratively ⓘ |
| hasFeature |
higher-order abstract syntax
ⓘ
lambda-tree syntax ⓘ |
| hasImplementation |
ELPI
ⓘ
Prolog/Mali-based implementations ⓘ Teyjus ⓘ |
| hasKeyConcept |
goals-as-formulas
ⓘ
program-clauses-as-formulas ⓘ uniform proof search ⓘ |
| influenced |
Abella
ⓘ
Bedwyr ⓘ Twelf ⓘ other systems for reasoning about specifications ⓘ |
| relatedTo |
Prolog
ⓘ
higher-order logic ⓘ logical frameworks ⓘ |
| supports |
meta-programming
ⓘ
symbolic computation ⓘ theorem-proving style search ⓘ |
| supportsFeature |
embedded implication
ⓘ
generic judgments ⓘ higher-order programming ⓘ higher-order unification ⓘ hypothetical reasoning ⓘ lambda-abstraction in terms ⓘ modules ⓘ polymorphism ⓘ reasoning about formal systems ⓘ reasoning about syntax with bindings ⓘ scoped constants ⓘ strong typing of terms ⓘ |
| usedIn |
research on formal verification
ⓘ
research on programming language metatheory ⓘ research on proof theory ⓘ |
| usesLogic |
higher-order hereditary Harrop formulas
ⓘ
intuitionistic logic ⓘ |
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: LambdaProlog Description of subject: LambdaProlog is a logic programming language that extends Prolog with higher-order features, polymorphism, and strong support for reasoning about formal systems and syntax with bindings.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
λProlog