TechQA.

Question

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

score 818 · Answer 1 · 2016-12-31 00:23:26

2

Answer

818

Views

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

818 views Asked by scubed At 31 December 2016 at 00:23

score 337 · Answer 2 · 2017-08-29 22:12:43

Check for evars in a tactic that returns a value

337 views Asked by Rand00 At 29 August 2017 at 22:12

score 153 · Answer 3 · 2017-08-30 16:59:56

Proof of the application of a Substitution on a term

153 views Asked by DerMann At 30 August 2017 at 16:59

score 1173 · Answer 4 · 2017-09-11 23:45:13

Coq contradiction in hypotheses

1.1k views Asked by Alexander Boll At 11 September 2017 at 23:45

score 477 · Answer 5 · 2017-09-13 20:12:45

Simplifying Subformulas in Coq

477 views Asked by Rand00 At 13 September 2017 at 20:12

score 533 · Answer 6 · 2020-09-29 20:18:21

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

533 views Asked by Dan Johnson At 29 September 2020 at 20:18

score 345 · Answer 7 · 2020-10-02 02:13:08

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

345 views Asked by Dan Johnson At 02 October 2020 at 02:13

score 370 · Answer 8 · 2020-10-05 02:13:56

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

370 views Asked by Dan Johnson At 05 October 2020 at 02:13

score 75 · Answer 9 · 2020-10-03 15:26:39

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

75 views Asked by Dan Johnson At 03 October 2020 at 15:26

score 682 · Answer 10 · 2020-10-06 21:37:30

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

682 views Asked by Dan Johnson At 06 October 2020 at 21:37

TechQA.

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

Popular Questions

Popular Tags

Trending Questions