Question

How do you selectively simplify arguments to each time a function is called, without evaluating the function itself?

score 857 · Answer 1 · 2024-12-26 13:30:00

857

Views

How do you selectively simplify arguments to each time a function is called, without evaluating the function itself?

Published on 26 December 2024 at 13:30

score 380 · Answer 2 · 2024-12-26 13:13:14

380

Views

Check for evars in a tactic that returns a value

Published on 26 December 2024 at 13:13

score 198 · Answer 3 · 2024-12-26 13:15:13

198

Views

Proof of the application of a Substitution on a term

Published on 26 December 2024 at 13:15

score 1.2k · Answer 4 · 2024-12-26 13:02:29

1.2k

Views

Coq contradiction in hypotheses

Published on 26 December 2024 at 13:02

score 520 · Answer 5 · 2024-12-31 00:49:20

520

Views

Simplifying Subformulas in Coq

Published on 31 December 2024 at 00:49

score 602 · Answer 6 · 2024-12-26 13:26:20

602

Views

is there any tactic in Coq that can transform a bool expression to a Prop one?

Published on 26 December 2024 at 13:26

score 402 · Answer 7 · 2024-12-26 13:15:40

402

Views

Coq error: Unable to unify "true" with "is_true (0 < a - b - 3)"

Published on 26 December 2024 at 13:15

score 436 · Answer 8 · 2024-12-26 13:30:44

436

Views

If two constructor expressions of an inductive type are equal in Coq, can I do rewriting based on their corresponding arguments?

Published on 26 December 2024 at 13:30

score 139 · Answer 9 · 2024-12-26 13:26:21

139

Views

Can I use destruct here given the constraint I have for index range of a list?

Published on 26 December 2024 at 13:26

score 723 · Answer 10 · 2024-12-26 13:24:31

723

Views

Take a conjunction of two hypotheses and create a new hypothesis in Coq

Published on 26 December 2024 at 13:24

score 185 · Answer 11 · 2024-12-26 13:23:03

185

Views

How can I build a list of bytes from its specification in Coq

Published on 26 December 2024 at 13:23

score 208 · Answer 12 · 2024-12-26 13:19:34

208

Views

How to prove that the subsequence of an empty list is empty?

Published on 26 December 2024 at 13:19

score 155 · Answer 13 · 2024-12-26 13:08:44

155

Views

Inductive proposition for sublists in Coq

Published on 26 December 2024 at 13:08

score 666 · Answer 14 · 2024-12-26 13:10:57

666

Views

Coq unable to unify -- how to change hypothesis?

Published on 26 December 2024 at 13:10

score 318 · Answer 15 · 2024-12-27 14:24:18

318

Views

How to apply a constructor in an hypothesis?

Published on 27 December 2024 at 14:24

score 70 · Answer 16 · 2024-12-26 13:22:22

70

Views

Is there a three-valued case analysis on patterns (a < b) (a = b) (a > b)?

Published on 26 December 2024 at 13:22

score 47 · Answer 17 · 2024-12-26 13:08:43

47

Views

Custom tactics provided by libraries

Published on 26 December 2024 at 13:08

score 185 · Answer 18 · 2024-12-26 13:17:18

185

Views

Why is `specialize` not an invalid tactic within a proof?

Published on 26 December 2024 at 13:17

score 107 · Answer 19 · 2024-12-26 13:17:17

107

Views

How to continue case analysis of a nested match in coq?

Published on 26 December 2024 at 13:17

score 120 · Answer 20 · 2024-12-26 13:19:33

120

Views

How to prove the goals in more elegant way using ssreflect?

Published on 26 December 2024 at 13:19

List Question

How do you selectively simplify arguments to each time a function is called, without evaluating the function itself?

Check for evars in a tactic that returns a value

Proof of the application of a Substitution on a term

Coq contradiction in hypotheses

Simplifying Subformulas in Coq

is there any tactic in Coq that can transform a bool expression to a Prop one?

Coq error: Unable to unify "true" with "is_true (0 < a - b - 3)"

If two constructor expressions of an inductive type are equal in Coq, can I do rewriting based on their corresponding arguments?

Can I use destruct here given the constraint I have for index range of a list?

Take a conjunction of two hypotheses and create a new hypothesis in Coq

How can I build a list of bytes from its specification in Coq

How to prove that the subsequence of an empty list is empty?

Inductive proposition for sublists in Coq

Coq unable to unify -- how to change hypothesis?

How to apply a constructor in an hypothesis?

Is there a three-valued case analysis on patterns (a < b) (a = b) (a > b)?

Custom tactics provided by libraries

Why is `specialize` not an invalid tactic within a proof?

How to continue case analysis of a nested match in coq?

How to prove the goals in more elegant way using ssreflect?

Trending Questions

Popular # Hahtags

Popular Questions