 30 Jun, 2016 3 commits


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 6 commits


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.

Robbert Krebbers authored

Robbert Krebbers authored
To do so, we have introduced the specialization patterns: =>[H1 .. Hn] and =>[H1 .. Hn] That generate a goal in which the view shift is preserved. These specialization patterns can also be used for e.g. iApply. Note that this machinery is not tied to primitive view shifts, and works for various kinds of goal (as captured by the ToAssert type class, which describes how to transform the asserted goal based on the main goal). TODO: change the name of these specialization patterns to reflect this generality.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
Changes:  We no longer have a different syntax for specializing a term H : P ★ Q whose range P or domain Q is persistent. There is just one syntax, and the system automatically determines whether either P or Q is persistent.  While specializing a term, always modalities are automatically stripped. This gets rid of the specialization pattern !.  Make the syntax of specialization patterns more consistent. The syntax for generating a goal is [goal_spec] where goal_spec is one of the following: H1 .. Hn : generate a goal using hypotheses H1 .. Hn H1 .. Hn : generate a goal using all hypotheses but H1 .. Hn # : generate a goal for the premise in which all hypotheses can be used. This is only allowed when specializing H : P ★ Q where either P or Q is persistent. % : generate a goal for a pure premise.

 20 May, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored
I have introduced the following definition to avoid many case analyses where both branches had nearly identical proofs. Definition uPred_always_if {M} (p : bool) (P : uPred M) : uPred M := (if p then □ P else P)%I.

Robbert Krebbers authored

 07 May, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
