coq

coq

Addition of natural numbers in Coq

Curly brace proof syntax: begin x. = { auto } y. []

Check cnat. and got Type return

Proof of "less equal" transitive law in Coq

Relations with dependent types in Coq

Why Coq does not infer the type parameter

How to prove an absurd rule in Coq

How to prove shorter nat comparisons like 10000 > 1 for sigma types in Coq?

How to prove the correction of derive on reg_exp

Coq's proof #Coq

How can I proove forall a b, a <=? b = true -> a <=? S b = true in Coq

Is it possible to import a file in a proof only in Coq?

Cannot rewrite goal with assertion?

Proving S (n + m) = n + (S m), how to rewrite n+1 = S(n)?

Coq QuickChick : Making propery Checkable, Decidable, Arbitrary (Gen)

Trace inclusion between program and state machine

Coq: trying to use dependent induction

What does the term "?T#{x:=t}", or a type with a question mark and at sign surrounding it mean in Coq?

Is there a shorter proof to this Coq theorem?

What is the tactic that does nothing?

How does one install a new version of Coq when it cannot find the repositories in a new Mac M1 machine?

Reversing a vector in Coq

How does one produce types (or theorems) from proof terms (programs or objects) in Coq?

can't launch CoqIde

Solving a split proof in Coq

How can I proove 0 <= a < b -> rem a b = a in Coq?

Unable to split a conjunction in Hypothesis

Controlling unification order in Coq

Good way of testing a class in Coq

Proving existance by providing an example

How can I reorder existential variables in Coq?

How to write intermediate proof statements inside Coq - similar to how in Isar one has `have Statement using Lemma1, Lemma2 by auto` but in Coq?

Proof with multiple cases theorem

Proof with forall for a particular term

Equality between two propositions nat -> nat

Certified calculations in a proof assistant

How to try a tactic in Ltac, but continue if it fails

Coinductive principle for streams

Proving a_j ≤ b_j → sum (a_j) ≤ sum (b_j)

Unification problem with HOL-style alpha-conversion in Coq (matching the equality)

Modulo simplification in coq

Is CoInductive "extensionality" sound in Coq? Is it generalizable?

Transitivity of subsequence in COQ

How to apply an axiom to simplify a match in Coq?

Decidable equality statement with Set vs. Prop

Is there a more elegant way to convince coq that a list based hypothesis is a contradiction?

Proving that s-expressions printing is injective

How to do induction on BinNums.Z in Coq/

Proof in Coq with named parameters in constructors

How to express that one element of an inductive relation can't be derived from another in Coq?

How to prove `plus_le_compat_l : forall n m p, n <= m -> p + n <= p + m.`

How to prove this DeMorgan law without using automation tactics in Coq?

Real numbers in Coq

Can any one help me how to prove this therom in coq

computation theory in coq

Software Foundations: weak_pumping lemma proof

Weird goal `Some 0 = true` generated in proof

How to generalize a variable on both sides of an equation in Coq?

What does the tactic destruct do in the proof below?

Not pretty-printing a field of a record

page:3 of 26 prev page next page main page

Categories

tfidfvectorizer

fastify-swagger

python-server-pages

angular-datatables

acoustic-telemetry

yii2-advanced-app

broadcastreceiver

angular-http-interceptors

jquery-ui-autocomplete

spring-boot-configuration

try-with-resources

android-fileprovider

outlook-web-app

spark-framework

playframework-2.4

lumia-imaging-sdk

nsmutablestring

django-pagination

Resources