coq

coq

Logic: In_app_iff exercize

How to make algebraic manipulations in Coq easier?

Coq: How to rewrite inside a lambda?

Logic: All_In can't expand nested forall

Transform casual list into dependently typed list in Coq

what does this notation `:>` mean in Coq?

Coq won't reduce expression involving decision procedure

universe inconsistency with sumbool

Coq induction hypothesis is wrong

Proving that a rational function is monotonically nondecreasing in Coq

apply rewrite tactic to sub-expression

Why does nesting the induction tactic also nest the inductive hypotheses under a lambda?

Coq: how to apply hypothesis with internal “if” branch

Proving a contradiction in Coq

Confusing obligations generated by `Program` tactic

Prove inequality of complex objects

Verify Coq proofs in a different language

Why does Coq object to the following PairUsualDecidableTypeFull module type?

How to automatically leverage hypotheses of the form x <> y?

Paramcoq: Free theorems in Coq

What does the tactic `Induction` followed by a number do?

Tactics: filter_exercise

Coq proof that factorial N / (factorial k * factorial (N-k)) is integer

I'm looking for this lemma about the nat type

Tactics: stuck in eqb_trans

Logic: In_example_2

How to prove something by using a definition?

Splitting disjunctions (\/) in Coq hypothesis

Curly brace in Coq generics

Transitivity of -> in Coq

Derive a ssreflect finType from a seq over a finType with uniq

Extract / use membership proof from a ssreflect finset

“if” is not just sugar for “match”

Why is my Record of Type sort showing as Set sort?

How do I prove the following lemma in Coq?

Is there any thing like apply lem in *?

Coq module “Cannot find a physical path bound to logical path matching suffix <> and prefix” and “not found in the loadpath”

Explanation transitivity of equal coq

Using induction starting from 1 in Coq

Well-founded induction for a counting predicate

Church numerals

Field tactic with partial inverse function

Lemma as a type in a record

Coq: Proving conat is either finite or infinite

How do I use a lemma from a Coq library?

Coq doesn't recognize equality of dependent list

Inductive definition of boolean

Specialization of module argument in Coq

Logical foundations errors

Trouble in implementing dependently typed lookup in Coq using Equations

Using “omega” for type “N”

How to prove forall P : Prop, ~~P -> P [duplicate]

Prove a property of finding the same elements in two lists

What is the case_eq equivalent of the induction tactic?

To which subterms can we apply a lemma?

Proving another property of finding same elements in lists

Proving (~A -> ~B)-> (~A -> B) -> A in Coq

Intersection of lists using List.filter

Coq: How to produce a strong polymorphic dependent type hypothesis

How to prove forall (p q:Prop), ~p->~((p ->q) ->p). using coq

page:1 of 20 next page main page

Categories

instagram-graph-api

azure-pipelines

aws-api-gateway

httpclientfactory

twine-game-engine

database-replication

sonata-media-bundle

playframework-2.0

android-install-apk

montgomery-multiplication

libreoffice-impress

syndicationfeed

berkeley-db-xml

hexagonal-architecture

solution-explorer

partial-application

knockout-components

floating-point-exceptions

Resources