Coq
E446868
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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Coq canonical | 2 |
| Coq proof assistant | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T4493127 — 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: Coq Context triple: [Gödel's ontological proof, verifiedIn, Coq]
-
A.
coq gaulois
Coq gaulois is the French term for the Gallic rooster, a national emblem of France symbolizing courage, pride, and the French nation.
-
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.
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.
-
D.
OCaml
OCaml is a statically typed functional programming language from the ML family, known for its powerful type system, pattern matching, and efficient native code compilation.
-
E.
ReasonML
ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Coq Target entity description: 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.
-
A.
coq gaulois
Coq gaulois is the French term for the Gallic rooster, a national emblem of France symbolizing courage, pride, and the French nation.
-
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.
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.
-
D.
OCaml
OCaml is a statically typed functional programming language from the ML family, known for its powerful type system, pattern matching, and efficient native code compilation.
-
E.
ReasonML
ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
- F. None of above. chosen
Statements (56)
| Predicate | Object |
|---|---|
| instanceOf |
dependently typed programming language
ⓘ
functional programming language ⓘ interactive theorem prover ⓘ proof assistant ⓘ |
| basedOn | dependent type theory ⓘ |
| canExtractTo |
Haskell
NERFINISHED
ⓘ
OCaml NERFINISHED ⓘ Scheme ⓘ |
| developedBy | INRIA NERFINISHED ⓘ |
| developedIn | France NERFINISHED ⓘ |
| hasApplication |
certified programming
ⓘ
formal verification of mathematical proofs ⓘ formal verification of software ⓘ program extraction ⓘ |
| hasCommunity |
Coq development team
NERFINISHED
ⓘ
Coq users community ⓘ |
| hasFeature |
Gallina specification language
NERFINISHED
ⓘ
Ltac tactic language ⓘ coercions ⓘ interactive proof mode ⓘ module system ⓘ notations ⓘ proof scripts ⓘ standard library ⓘ universe polymorphism ⓘ |
| hasInterface |
Coq support in Emacs
ⓘ
Coq support in VS Code ⓘ Coq support in Vim ⓘ CoqIDE NERFINISHED ⓘ Proof General NERFINISHED ⓘ command-line interface ⓘ |
| implements |
Calculus of Inductive Constructions
NERFINISHED
ⓘ
Predicative Calculus of Inductive Constructions NERFINISHED ⓘ |
| initialReleaseYear | 1989 ⓘ |
| license | LGPL NERFINISHED ⓘ |
| namedAfter | Thierry Coquand NERFINISHED ⓘ |
| repository | https://github.com/coq/coq ⓘ |
| supports |
coinductive types
ⓘ
constructive logic ⓘ dependent types ⓘ extraction to functional programming languages ⓘ higher-order logic ⓘ inductive types ⓘ modules ⓘ pattern matching ⓘ proof automation ⓘ tactics ⓘ type classes ⓘ |
| usedFor |
teaching logic
ⓘ
teaching type theory ⓘ |
| usedIn |
CompCert C compiler verification
ⓘ
Feit–Thompson theorem formalization ⓘ Four Color Theorem formalization ⓘ Verified Software Toolchain NERFINISHED ⓘ |
| website | https://coq.inria.fr ⓘ |
| writtenIn | OCaml NERFINISHED ⓘ |
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: Coq Description of subject: 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.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.