Projet COQThis document is an introduction to the definition and use of recursive types in the Coq proof environment. It explains how recursive types like natural numbers and infinite streams are defined in Coq, and the kind of proof techniques that can be used to reason about them (case analysis, induction, inversion of predicates, co-induction, etc). Each technique is illustrated through an executable and self-contained Coq script
International audienceEquations is a plugin for the Coq proof assistant which provides a notation fo...
International audienceCoq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorpora...
International audienceThe Coq Platform is a continuously developed distribution of the Coq proof ass...
This document1 is an introduction to the definition and use of inductive and co-inductive types in t...
International audienceWe present a practical tool for defining and proving properties of recursive f...
This document1 is an introduction to the definition and use of inductive and co-inductive types in t...
International audienceTemplate-Coq is a plugin for Coq, originally implemented by Malecha, which pro...
International audienceCoq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorpora...
International audienceCoq [1] is a proof assistant which relies on the Curry-Howard isomorphism to c...
International audienceWe present a (relatively) short mechanized proof that Coq types any recursive ...
International audienceThis tutorial presents the Ssreflect extension to the Coq system. This extensi...
International audienceThis tutorial presents the Ssreflect extension to the Coq system. This extensi...
Computer proof assistants vary along many dimensions. Among the mature implementations, the Coq syst...
International audienceCoq is built around a well-delimited kernel that perfoms typechecking for defi...
Theme 2 - Genie logiciel et calcul symbolique. Projet COQSIGLEAvailable from INIST (FR), Document Su...
International audienceEquations is a plugin for the Coq proof assistant which provides a notation fo...
International audienceCoq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorpora...
International audienceThe Coq Platform is a continuously developed distribution of the Coq proof ass...
This document1 is an introduction to the definition and use of inductive and co-inductive types in t...
International audienceWe present a practical tool for defining and proving properties of recursive f...
This document1 is an introduction to the definition and use of inductive and co-inductive types in t...
International audienceTemplate-Coq is a plugin for Coq, originally implemented by Malecha, which pro...
International audienceCoq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorpora...
International audienceCoq [1] is a proof assistant which relies on the Curry-Howard isomorphism to c...
International audienceWe present a (relatively) short mechanized proof that Coq types any recursive ...
International audienceThis tutorial presents the Ssreflect extension to the Coq system. This extensi...
International audienceThis tutorial presents the Ssreflect extension to the Coq system. This extensi...
Computer proof assistants vary along many dimensions. Among the mature implementations, the Coq syst...
International audienceCoq is built around a well-delimited kernel that perfoms typechecking for defi...
Theme 2 - Genie logiciel et calcul symbolique. Projet COQSIGLEAvailable from INIST (FR), Document Su...
International audienceEquations is a plugin for the Coq proof assistant which provides a notation fo...
International audienceCoq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorpora...
International audienceThe Coq Platform is a continuously developed distribution of the Coq proof ass...