Types and Programming Languages (research contributions)
E238247
Types and Programming Languages (research contributions) refers to Tobias Nipkow’s influential work advancing the theory and mechanization of type systems and programming language semantics, particularly through formal verification and theorem proving.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Types and Programming Languages (research contributions) canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2139676 — 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: Types and Programming Languages (research contributions) Context triple: [Tobias Nipkow, notableWork, Types and Programming Languages (research contributions)]
-
A.
PLDI
PLDI (Programming Language Design and Implementation) is a premier annual research conference focused on the design, implementation, and analysis of programming languages and compilers.
-
B.
PLDI Student Research Competition
The PLDI Student Research Competition is an annual forum where undergraduate and graduate students present and discuss their research in programming languages and related areas, typically co-located with the PLDI conference.
-
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.
Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
-
E.
POPL conference proceedings
POPL conference proceedings are the collected scholarly papers presented at the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, a leading venue for research in programming languages and formal methods.
- 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: Types and Programming Languages (research contributions) Target entity description: Types and Programming Languages (research contributions) refers to Tobias Nipkow’s influential work advancing the theory and mechanization of type systems and programming language semantics, particularly through formal verification and theorem proving.
-
A.
PLDI
PLDI (Programming Language Design and Implementation) is a premier annual research conference focused on the design, implementation, and analysis of programming languages and compilers.
-
B.
PLDI Student Research Competition
The PLDI Student Research Competition is an annual forum where undergraduate and graduate students present and discuss their research in programming languages and related areas, typically co-located with the PLDI conference.
-
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.
Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
-
E.
POPL conference proceedings
POPL conference proceedings are the collected scholarly papers presented at the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, a leading venue for research in programming languages and formal methods.
- F. None of above. chosen
Statements (40)
| Predicate | Object |
|---|---|
| instanceOf |
area of computer science research
ⓘ
research topic ⓘ |
| aimsTo |
bridge gap between programming language theory and verification tools
ⓘ
increase reliability of programming language definitions ⓘ reduce errors in type soundness proofs ⓘ |
| appliedIn |
development of verified software tools
ⓘ
formalization of language standards ⓘ verification of programming language implementations ⓘ |
| associatedWith |
conference papers on theorem proving in language theory
ⓘ
journal articles on formalized type systems ⓘ technical reports on mechanized semantics ⓘ |
| contributedTo |
certified compilers
ⓘ
formalization of axiomatic semantics ⓘ formalization of denotational semantics ⓘ formalization of operational semantics ⓘ mechanized meta-theory of programming languages ⓘ verified type checkers ⓘ |
| field |
formal verification
ⓘ
programming language semantics ⓘ theorem proving ⓘ type systems ⓘ |
| focusesOn |
formalization of type soundness proofs
ⓘ
machine-checked proofs for programming languages ⓘ mechanization of programming language semantics ⓘ mechanization of type systems ⓘ |
| influenced |
education in semantics and type systems using proof assistants
ⓘ
formalization of programming language textbooks ⓘ mechanized metatheory research ⓘ |
| influencedBy |
Hoare logic
ⓘ
lambda calculus ⓘ program logics ⓘ structural operational semantics ⓘ type theory ⓘ |
| mainContributor | Tobias Nipkow ⓘ |
| relatedTo |
interactive theorem proving
ⓘ
proof assistants ⓘ semantics of functional programming languages ⓘ semantics of imperative programming languages ⓘ semantics of object-oriented programming languages ⓘ |
| usesTool |
Isabelle theorem prover
ⓘ
linked to:
Isabelle proof assistant
|
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: Types and Programming Languages (research contributions) Description of subject: Types and Programming Languages (research contributions) refers to Tobias Nipkow’s influential work advancing the theory and mechanization of type systems and programming language semantics, particularly through formal verification and theorem proving.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.