 25 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 19 Jul, 2016 1 commit


Robbert Krebbers authored
I also reverted 7952bca4 since there is no need for atomic to be a boolean predicate anymore. Moreover, I introduced a hint database fsaV for solving sideconditions related to FSAs, in particular, sideconditions related to expressions being atomic.

 13 Jul, 2016 1 commit


Robbert Krebbers authored
The intropattern {H} also meant clear (both in ssreflect, and the logic part of the introduction pattern).

 05 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 03 Jul, 2016 1 commit


Robbert Krebbers authored
That way type class search becomes more predictable.

 30 Jun, 2016 6 commits


Robbert Krebbers authored

Robbert Krebbers authored
For example iIntros "{$H1 H2} H1" frames H1, clears H2, and introduces H1.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
This fixes a bug in 916ff44a causing proof mode notations not being pretty printed.

Robbert Krebbers authored
This tweak allows us to declare pvs as an instance of FromPure (it is not an instance of IntoPure), making some tactics (like iPureIntro and done) work with pvs too.

 29 Jun, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 27 Jun, 2016 2 commits


Robbert Krebbers authored
We are now using the prefixes Into, From, and Is (the first two are inspired by the names of some traits in the Rust stdlib), and hopefully doing that consistenly.

Robbert Krebbers authored

 24 Jun, 2016 1 commit


Robbert Krebbers authored

 23 Jun, 2016 4 commits


Robbert Krebbers authored
This is more consistent with the proofmode, where we also call it pure.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 17 Jun, 2016 1 commit


Robbert Krebbers authored

 16 Jun, 2016 2 commits


Robbert Krebbers authored
This introduces n hypotheses and destructs the nth one.

Robbert Krebbers authored

 15 Jun, 2016 1 commit


Robbert Krebbers authored

 01 Jun, 2016 5 commits


Robbert Krebbers authored

Robbert Krebbers authored
We used => before, which is strange, because it has another meaning in ssreflect.

Robbert Krebbers authored
Generating a fresh name consists of two stages: + Use [cbv] to compute a list representing the domain of the environment. This is a very simply computation that just erases the hypotheses. + Use [vm_compute] to compute a fresh name based on the list representing the domain. The domain itself should never contain evars, so [vm_compute] will do the job.

Robbert Krebbers authored

Robbert Krebbers authored

 31 May, 2016 3 commits


Robbert Krebbers authored
be the same as
↔ . This is a fairly intrusive change, but at least makes notations more consistent, and often shorter because fewer parentheses are needed. Note that viewshifts already had the same precedence as →. 
Robbert Krebbers authored
It used to be: (P ={E}=> Q) := (True ⊢ (P → ={E}=> Q)) Now it is: (P ={E}=> Q) := (P ⊢ ={E}=> Q)

Robbert Krebbers authored

 30 May, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
It is now able to destruct:  [own γ (a1 ⋅ a1)] into [own γ a1] and [own γ a2]  [own γ a] into [own γ a] and [own γ a] if [a] is persistent  [own γ (a,b)] by proceeding recursively.  [own γ (Some a)] by preceeding resursively.

 27 May, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 24 May, 2016 1 commit


Robbert Krebbers authored
Rationale: to make the code closer to what is on paper, I want the notations to look like quantifiers, i.e. have a binder builtin. I thus introduced the following notations: [★ map] k ↦ x ∈ m, P [★ set] x ∈ X, P The good thing  contrary to the notations that we had before that required an explicit lambda  is that type annotations of k and x are now not printed making goals much easier to read.
