I have been trying to solve Pumping lemma in Coq. I was on the third subgoal, Mapp. My proof on MApp is as follow. I am now stuck on case Hc: l ...
I am trying to prove the pumping Lemma (which is one of the exercises of the Logical Foundations book). I thought I had completed the MStarApp case bu ...
All I am trying to understand the Church numerals, mentioned in the SF-LF book, chp4. And I get It seems cnat is some kind of type, and functio ...
I am currently confused about how to prove the following theorem: I am stuck here: I know that it's impossible to simply prove the law of exclud ...
2 I'm going through software foundations and ran into an error. (https://softwarefoundations.cis.upenn.edu/lf-current/Maps.html) The proof example ...
In IndProp.v from Logical Foundations we have the following inductive property: Is it possible to solve this: Presumably one would need some sor ...
I am trying to figure out how the LF test scripts output the manually graded assignments when run from the terminal. For instance, if you look at Indu ...
Passing Quick Chick course from Software foundations I am stuck at the following theorem: Here we get: Proving true = true -> (eqb f1 f2) = t ...
Task: write a function to convert natural numbers to binary numbers. The 2-nd function gives an error, because it is not structurally recursive: ...
In volume 4 of Software foundations "QuickChick" we have the following excercise: But get an error: And it highlights match opt1 with. Maybe ...
The task. Suppose we give Coq the following definition: Which of the following propositions are provable? I proved 2 out of 3. The 3-rd is not ...
Output: Now n can be either even or not even. if n is even, m is also even. Then by ev_sum theorem (n+m) is also even. if n is not even, i ...
We get this: Also we have a previously proven theorem: We know that (n+m) is even and (n+p) is even. How to create a new hypothesis in the con ...
I am currently learning coq thanks to the Software Fondation's ebook. I successfully wrote the addition as follow: But I'm stuck with exp because o ...
Rel chapter from Logical foundations. I was given a solution to the excersize that I'm trying to comprehend: I don't understand, how does intro pat ...
I came to this point: Output: My plan was to use transitivity of le: a <= b -> b <= c -> a <= c And substitute a := a, b := (S ...
Playing with nostutter excersizes I found another odd behaviour. Here is the code: Status after unfold is this: When I run specialize (H2 eq_ref ...
Trying to comprehend the answer of @keep_learning I walked through this code step by step: Here is what we have before excuting specialize Here ...
Diving deep into test_nostutter_1 excersize I found a way to solve it without repeat: I decided to play more with it and in coq reference manual I ...
The authors of the book have provided proofs for some unit tests for nostutter exercise. Unfortunately, they didn't provide explanations how they work ...