Thierry Coquand
E265289
Thierry Coquand is a French logician and computer scientist known for his work on type theory, constructive mathematics, and the development of the calculus of constructions.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Thierry Coquand canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2419110 — 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: Thierry Coquand Context triple: [Gérard Huet, notableStudent, Thierry Coquand]
-
A.
Gilles Dowek
Gilles Dowek is a French logician and computer scientist known for his influential work in proof theory, type systems, and automated deduction.
-
B.
Nikolaj Bjørner
Nikolaj Bjørner is a computer scientist best known for his work on automated theorem proving and the development of the Z3 SMT solver.
-
C.
Vladimir Voevodsky
Vladimir Voevodsky was a Russian-American mathematician renowned for his work in algebraic geometry and homotopy theory, and for founding the field of motivic cohomology, for which he received the Fields Medal.
-
D.
Markus Wenzel
Markus Wenzel is a computer scientist best known as the primary developer of the Isabelle proof assistant.
-
E.
Luca Cardelli
Luca Cardelli is an Italian computer scientist known for his influential work in type theory, programming language design, and the development of the Modula-3 and Polyphonic C# languages.
- 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: Thierry Coquand Target entity description: Thierry Coquand is a French logician and computer scientist known for his work on type theory, constructive mathematics, and the development of the calculus of constructions.
-
A.
Gilles Dowek
Gilles Dowek is a French logician and computer scientist known for his influential work in proof theory, type systems, and automated deduction.
-
B.
Nikolaj Bjørner
Nikolaj Bjørner is a computer scientist best known for his work on automated theorem proving and the development of the Z3 SMT solver.
-
C.
Vladimir Voevodsky
Vladimir Voevodsky was a Russian-American mathematician renowned for his work in algebraic geometry and homotopy theory, and for founding the field of motivic cohomology, for which he received the Fields Medal.
-
D.
Markus Wenzel
Markus Wenzel is a computer scientist best known as the primary developer of the Isabelle proof assistant.
-
E.
Luca Cardelli
Luca Cardelli is an Italian computer scientist known for his influential work in type theory, programming language design, and the development of the Modula-3 and Polyphonic C# languages.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
academic
ⓘ
computer scientist ⓘ logician ⓘ person ⓘ |
| affiliation |
Department of Computer Science and Engineering, Chalmers University of Technology
ⓘ
Department of Computer Science and Engineering, University of Gothenburg ⓘ |
| citizenship | French ⓘ |
| countryOfCitizenship | France ⓘ |
| educatedAt |
Sorbonne University
ⓘ
surface form:
University of Paris
École Normale Supérieure de Lyon ⓘ |
| employer |
Chalmers University of Technology
ⓘ
University of Gothenburg ⓘ |
| fieldOfWork |
computer science
ⓘ
constructive mathematics ⓘ formal verification ⓘ homotopy type theory ⓘ mathematical logic ⓘ proof theory ⓘ type theory ⓘ |
| gender | male ⓘ |
| hasAcademicAdvisor | Jean-Yves Girard ⓘ |
| hasPublicationType |
book chapters
ⓘ
conference papers ⓘ journal articles ⓘ |
| influenced |
development of proof assistants
ⓘ
research in type theory ⓘ |
| influencedBy |
Jean-Yves Girard
ⓘ
Per Martin-Löf ⓘ |
| knownFor |
calculus of constructions
ⓘ
contributions to proof assistants ⓘ work in constructive mathematics ⓘ work in intuitionistic type theory ⓘ work on type theory ⓘ |
| languageOfWorkOrName |
English
ⓘ
French ⓘ |
| notableConcept | calculus of constructions ⓘ |
| notableStudent | Peter Dybjer ⓘ |
| notableWork |
calculus of constructions
ⓘ
papers on constructive algebra ⓘ work on formalization of mathematics ⓘ |
| positionHeld |
professor of computer science
ⓘ
professor of logic ⓘ |
| researchInterest |
constructive algebra
ⓘ
formalization of mathematics ⓘ proof assistants ⓘ semantics of type theory ⓘ |
| workLocation |
France
ⓘ
Sweden ⓘ |
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: Thierry Coquand Description of subject: Thierry Coquand is a French logician and computer scientist known for his work on type theory, constructive mathematics, and the development of the calculus of constructions.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.