Inria–Université Paris-Sud–CNRS research community around Coq
E941108
The Inria–Université Paris-Sud–CNRS research community around Coq is a collaborative French research group focused on the development, theory, and applications of the Coq proof assistant in formal methods and computer science.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Inria–Université Paris-Sud–CNRS research community around Coq canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T11695170 — 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.
Target entity: Inria–Université Paris-Sud–CNRS research community around Coq Context triple: [Christine Paulin-Mohring, memberOf, Inria–Université Paris-Sud–CNRS research community around Coq]
-
A.
Coq
Coq is an interactive theorem prover and functional programming language based on dependent type theory, widely used for formally verifying mathematical proofs and software correctness.
-
B.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
C.
Archive of Formal Proofs
The Archive of Formal Proofs is an online, peer-reviewed collection of machine-checked mathematical and computer science proofs formalized primarily in the Isabelle proof assistant.
-
D.
coq gaulois
Coq gaulois is the French term for the Gallic rooster, a national emblem of France symbolizing courage, pride, and the French nation.
-
E.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Inria–Université Paris-Sud–CNRS research community around Coq Target entity description: The Inria–Université Paris-Sud–CNRS research community around Coq is a collaborative French research group focused on the development, theory, and applications of the Coq proof assistant in formal methods and computer science.
-
A.
Coq
Coq is an interactive theorem prover and functional programming language based on dependent type theory, widely used for formally verifying mathematical proofs and software correctness.
-
B.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
C.
Archive of Formal Proofs
The Archive of Formal Proofs is an online, peer-reviewed collection of machine-checked mathematical and computer science proofs formalized primarily in the Isabelle proof assistant.
-
D.
coq gaulois
Coq gaulois is the French term for the Gallic rooster, a national emblem of France symbolizing courage, pride, and the French nation.
-
E.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
- F. None of above. chosen
Statements (45)
| Predicate | Object |
|---|---|
| instanceOf |
research community
ⓘ
scientific collaboration ⓘ |
| aimsTo |
advance theory of Coq
ⓘ
develop applications of Coq in academia ⓘ develop applications of Coq in industry ⓘ |
| appliesTo |
formalization of mathematics
ⓘ
security protocols verification ⓘ software certification ⓘ verification of critical systems ⓘ |
| basedOn | calculus of inductive constructions NERFINISHED ⓘ |
| collaboratesWith |
CNRS
NERFINISHED
ⓘ
Inria NERFINISHED ⓘ Université Paris-Sud NERFINISHED ⓘ |
| contributesTo | development of Coq ecosystem ⓘ |
| country | France ⓘ |
| field |
computer science
ⓘ
formal methods ⓘ mathematical logic ⓘ |
| focusesOn |
Coq proof assistant
NERFINISHED
ⓘ
formal verification of hardware ⓘ formal verification of software ⓘ interactive theorem proving ⓘ type theory ⓘ |
| hasParticipant |
researchers from CNRS
ⓘ
researchers from Inria ⓘ researchers from Université Paris-Sud ⓘ |
| languageOfWorkOrName |
English
ⓘ
French ⓘ |
| locatedIn |
Île-de-France region
ⓘ
surface form:
Île-de-France
|
| partOf |
European research community on theorem proving
NERFINISHED
ⓘ
French formal methods community ⓘ |
| researchArea |
certified programming
ⓘ
dependent type theory ⓘ formal specification ⓘ interactive proof development ⓘ program verification ⓘ proof assistants ⓘ proof automation ⓘ |
| uses | Coq NERFINISHED ⓘ |
| usesMethod |
formal proof development
ⓘ
interactive proof assistants ⓘ mechanized reasoning ⓘ |
| worksOn |
extensions of Coq
ⓘ
libraries for Coq ⓘ tools around Coq ⓘ |
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.
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.
Subject: Inria–Université Paris-Sud–CNRS research community around Coq Description of subject: The Inria–Université Paris-Sud–CNRS research community around Coq is a collaborative French research group focused on the development, theory, and applications of the Coq proof assistant in formal methods and computer science.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.