tactics.v 88.5 KB
Newer Older
1
From iris.proofmode Require Import coq_tactics.
2
From iris.proofmode Require Import base intro_patterns spec_patterns sel_patterns.
3
From iris.bi Require Export bi big_op.
Joseph Tassarotti's avatar
Joseph Tassarotti committed
4
From stdpp Require Import namespaces.
Robbert Krebbers's avatar
Robbert Krebbers committed
5
From iris.proofmode Require Export classes notation.
6
From iris.proofmode Require Import class_instances.
7
From stdpp Require Import hlist pretty.
8
Set Default Proof Using "Type".
9
Export ident.
Robbert Krebbers's avatar
Robbert Krebbers committed
10
11

Declare Reduction env_cbv := cbv [
12
  option_bind
13
  beq ascii_beq string_beq positive_beq ident_beq
14
15
  env_lookup env_lookup_delete env_delete env_app env_replace env_dom
  env_persistent env_spatial env_spatial_is_nil envs_dom
16
  envs_lookup envs_lookup_delete envs_delete envs_snoc envs_app
17
18
    envs_simple_replace envs_replace envs_split
    envs_clear_spatial envs_clear_persistent
19
    envs_split_go envs_split].
Robbert Krebbers's avatar
Robbert Krebbers committed
20
21
Ltac env_cbv :=
  match goal with |- ?u => let v := eval env_cbv in u in change v end.
22
Ltac env_reflexivity := env_cbv; exact eq_refl.
Robbert Krebbers's avatar
Robbert Krebbers committed
23

24
(** * Misc *)
25
(* Tactic Notation tactics cannot return terms *)
26
Ltac iFresh :=
Robbert Krebbers's avatar
Robbert Krebbers committed
27
  lazymatch goal with
28
  |- envs_entails ?Δ _ =>
29
30
31
     (* [vm_compute fails] if any of the hypotheses in [Δ] contain evars, so
     first use [cbv] to compute the domain of [Δ] *)
     let Hs := eval cbv in (envs_dom Δ) in
32
33
34
35
36
37
     eval vm_compute in
       (IAnon (match Hs with
         | [] => 1
         | _ => 1 + foldr Pos.max 1 (omap (maybe IAnon) Hs)
         end))%positive
  | _ => constr:(IAnon 1)
Robbert Krebbers's avatar
Robbert Krebbers committed
38
39
  end.

40
41
42
Ltac iMissingHyps Hs :=
  let Δ :=
    lazymatch goal with
43
    | |- envs_entails ?Δ _ => Δ
44
45
46
47
48
    | |- context[ envs_split _ _ ?Δ ] => Δ
    end in
  let Hhyps := eval env_cbv in (envs_dom Δ) in
  eval vm_compute in (list_difference Hs Hhyps).

49
Ltac iTypeOf H :=
50
  let Δ := match goal with |- envs_entails ?Δ _ => Δ end in
51
  eval env_cbv in (envs_lookup H Δ).
Robbert Krebbers's avatar
Robbert Krebbers committed
52

53
Tactic Notation "iMatchHyp" tactic1(tac) :=
54
55
56
57
  match goal with
  | |- context[ environments.Esnoc _ ?x ?P ] => tac x P
  end.

Robbert Krebbers's avatar
Robbert Krebbers committed
58
(** * Start a proof *)
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
59
60
61
62
63
64
65
66
67
68
69
70
Tactic Notation "iStartProof" :=
  lazymatch goal with
  | |- envs_entails _ _ => idtac
  | |- ?φ => eapply (as_valid_2 φ);
               [apply _ || fail "iStartProof: not a Bi entailment"
               |apply tac_adequate]
  end.

(* Same as above, with 2 differences :
   - We can specify a BI in which we want the proof to be done
   - If the goal starts with a let or a ∀, they are automatically
     introduced. *)
71
Tactic Notation "iStartProof" uconstr(PROP) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
72
  lazymatch goal with
73
  | |- @envs_entails ?PROP' _ _ =>
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
74
75
    (* This cannot be shared with the other [iStartProof], because
    type_term has a non-negligeable performance impact. *)
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
76
    let x := type_term (eq_refl : @eq Type PROP PROP') in idtac
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
77

Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
78
  (* We eta-expand [as_valid_2], in order to make sure that
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
79
80
     [iStartProof PROP] works even if [PROP] is the carrier type. In
     this case, typing this expression will end up unifying PROP with
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
81
82
     [bi_car _], and hence trigger the canonical structures mechanism
     to find the corresponding bi. *)
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
83
  | |- ?φ => eapply (λ P : PROP, @as_valid_2 φ _ P);
84
               [apply _ || fail "iStartProof: not a Bi entailment"
85
               |apply tac_adequate]
Robbert Krebbers's avatar
Robbert Krebbers committed
86
87
  end.

88

89
90
(** * Simplification *)
Tactic Notation "iEval" tactic(t) :=
91
  iStartProof;
92
  eapply tac_eval;
93
94
    [let x := fresh in intros x; t; unfold x; reflexivity
    |].
95

96
97
98
99
Tactic Notation "iEval" tactic(t) "in" constr(H) :=
  iStartProof;
  eapply tac_eval_in with _ H _ _ _;
    [env_reflexivity || fail "iEval:" H "not found"
100
    |let x := fresh in intros x; t; unfold x; reflexivity
101
102
    |env_reflexivity
    |].
103
104

Tactic Notation "iSimpl" := iEval simpl.
105
Tactic Notation "iSimpl" "in" constr(H) := iEval simpl in H.
106

107
108
109
110
111
112
113
(* It would be nice to also have an `iSsrRewrite`, however, for this we need to
pass arguments to Ssreflect's `rewrite` like `/= foo /bar` in Ltac, see:

  https://sympa.inria.fr/sympa/arc/coq-club/2018-01/msg00000.html

PMP told me (= Robbert) in person that this is not possible today, but may be
possible in Ltac2. *)
114

Robbert Krebbers's avatar
Robbert Krebbers committed
115
116
117
(** * Context manipulation *)
Tactic Notation "iRename" constr(H1) "into" constr(H2) :=
  eapply tac_rename with _ H1 H2 _ _; (* (i:=H1) (j:=H2) *)
118
119
    [env_reflexivity || fail "iRename:" H1 "not found"
    |env_reflexivity || fail "iRename:" H2 "not fresh"|].
Robbert Krebbers's avatar
Robbert Krebbers committed
120

121
122
Local Inductive esel_pat :=
  | ESelPure
123
  | ESelIdent : bool  ident  esel_pat.
124

125
Ltac iElaborateSelPat pat :=
126
127
  let rec go pat Δ Hs :=
    lazymatch pat with
128
    | [] => eval cbv in Hs
129
130
131
132
    | SelPure :: ?pat => go pat Δ (ESelPure :: Hs)
    | SelPersistent :: ?pat =>
       let Hs' := eval env_cbv in (env_dom (env_persistent Δ)) in
       let Δ' := eval env_cbv in (envs_clear_persistent Δ) in
133
       go pat Δ' ((ESelIdent true <$> Hs') ++ Hs)
134
135
136
    | SelSpatial :: ?pat =>
       let Hs' := eval env_cbv in (env_dom (env_spatial Δ)) in
       let Δ' := eval env_cbv in (envs_clear_spatial Δ) in
137
138
       go pat Δ' ((ESelIdent false <$> Hs') ++ Hs)
    | SelIdent ?H :: ?pat =>
139
       lazymatch eval env_cbv in (envs_lookup_delete false H Δ) with
140
       | Some (?p,_,?Δ') => go pat Δ' (ESelIdent p H :: Hs)
141
142
143
144
       | None => fail "iElaborateSelPat:" H "not found"
       end
    end in
  lazymatch goal with
145
  | |- envs_entails ?Δ _ =>
146
147
148
    let pat := sel_pat.parse pat in go pat Δ (@nil esel_pat)
  end.

149
150
Local Ltac iClearHyp H :=
  eapply tac_clear with _ H _ _; (* (i:=H) *)
151
152
153
154
155
    [env_reflexivity || fail "iClear:" H "not found"
    |env_cbv; apply _ ||
     let P := match goal with |- TCOr (Affine ?P) _ => P end in
     fail "iClear:" H ":" P "not affine and the goal not absorbing"
    |].
156

Robbert Krebbers's avatar
Robbert Krebbers committed
157
158
Tactic Notation "iClear" constr(Hs) :=
  let rec go Hs :=
159
    lazymatch Hs with
Robbert Krebbers's avatar
Robbert Krebbers committed
160
    | [] => idtac
161
    | ESelPure :: ?Hs => clear; go Hs
162
    | ESelIdent _ ?H :: ?Hs => iClearHyp H; go Hs
Robbert Krebbers's avatar
Robbert Krebbers committed
163
    end in
164
  let Hs := iElaborateSelPat Hs in iStartProof; go Hs.
165

166
167
Tactic Notation "iClear" "(" ident_list(xs) ")" constr(Hs) :=
  iClear Hs; clear xs.
Robbert Krebbers's avatar
Robbert Krebbers committed
168
169
170

(** * Assumptions *)
Tactic Notation "iExact" constr(H) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
171
  eapply tac_assumption with _ H _ _; (* (i:=H) *)
172
    [env_reflexivity || fail "iExact:" H "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
173
174
    |apply _ ||
     let P := match goal with |- FromAssumption _ ?P _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
175
176
177
     fail "iExact:" H ":" P "does not match goal"
    |env_cbv; apply _ ||
     fail "iExact:" H "not absorbing and the remaining hypotheses not affine"].
Robbert Krebbers's avatar
Robbert Krebbers committed
178
179
180

Tactic Notation "iAssumptionCore" :=
  let rec find Γ i P :=
181
    lazymatch Γ with
Robbert Krebbers's avatar
Robbert Krebbers committed
182
    | Esnoc ?Γ ?j ?Q => first [unify P Q; unify i j|find Γ i P]
Robbert Krebbers's avatar
Robbert Krebbers committed
183
184
185
    end in
  match goal with
  | |- envs_lookup ?i (Envs ?Γp ?Γs) = Some (_, ?P) =>
186
     first [is_evar i; fail 1 | env_reflexivity]
Robbert Krebbers's avatar
Robbert Krebbers committed
187
  | |- envs_lookup ?i (Envs ?Γp ?Γs) = Some (_, ?P) =>
188
     is_evar i; first [find Γp i P | find Γs i P]; env_reflexivity
189
  | |- envs_lookup_delete _ ?i (Envs ?Γp ?Γs) = Some (_, ?P, _) =>
190
     first [is_evar i; fail 1 | env_reflexivity]
191
  | |- envs_lookup_delete _ ?i (Envs ?Γp ?Γs) = Some (_, ?P, _) =>
192
     is_evar i; first [find Γp i P | find Γs i P]; env_reflexivity
Robbert Krebbers's avatar
Robbert Krebbers committed
193
  end.
194

Robbert Krebbers's avatar
Robbert Krebbers committed
195
Tactic Notation "iAssumption" :=
196
197
  let Hass := fresh in
  let rec find p Γ Q :=
198
    lazymatch Γ with
199
    | Esnoc ?Γ ?j ?P => first
200
       [pose proof (_ : FromAssumption p P Q) as Hass;
Robbert Krebbers's avatar
Robbert Krebbers committed
201
202
203
204
205
206
207
208
209
        eapply (tac_assumption _ _ j p P);
          [env_reflexivity
          |apply Hass
          |env_cbv; apply _ ||
           fail 1 "iAssumption:" j "not absorbing and the remaining hypotheses not affine"]
       |assert (P = False%I) as Hass by reflexivity;
        apply (tac_false_destruct _ j p P);
          [env_reflexivity
          |exact Hass]
210
211
       |find p Γ Q]
    end in
212
  lazymatch goal with
213
  | |- envs_entails (Envs ?Γp ?Γs) ?Q =>
214
215
216
     first [find true Γp Q | find false Γs Q
           |fail "iAssumption:" Q "not found"]
  end.
Robbert Krebbers's avatar
Robbert Krebbers committed
217
218
219
220
221

(** * False *)
Tactic Notation "iExFalso" := apply tac_ex_falso.

(** * Making hypotheses persistent or pure *)
222
Local Tactic Notation "iPersistent" constr(H) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
223
  eapply tac_persistent with _ H _ _ _; (* (i:=H) *)
224
    [env_reflexivity || fail "iPersistent:" H "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
225
    |apply _ ||
Robbert Krebbers's avatar
Robbert Krebbers committed
226
227
228
     let P := match goal with |- IntoPersistent _ ?P _ => P end in
     fail "iPersistent:" P "not persistent"
    |env_cbv; apply _ ||
229
230
     let P := match goal with |- TCOr (Affine ?P) _ => P end in
     fail "iPersistent:" P "not affine and the goal not absorbing"
231
    |env_reflexivity|].
Robbert Krebbers's avatar
Robbert Krebbers committed
232

233
Local Tactic Notation "iPure" constr(H) "as" simple_intropattern(pat) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
234
  eapply tac_pure with _ H _ _ _; (* (i:=H1) *)
235
    [env_reflexivity || fail "iPure:" H "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
236
237
238
    |apply _ ||
     let P := match goal with |- IntoPure ?P _ => P end in
     fail "iPure:" P "not pure"
Robbert Krebbers's avatar
Robbert Krebbers committed
239
    |env_cbv; apply _ ||
240
241
     let P := match goal with |- TCOr (Affine ?P) _ => P end in
     fail "iPure:" P "not affine and the goal not absorbing"
Robbert Krebbers's avatar
Robbert Krebbers committed
242
243
    |intros pat].

Robbert Krebbers's avatar
Robbert Krebbers committed
244
245
246
Tactic Notation "iEmpIntro" :=
  iStartProof;
  eapply tac_emp_intro;
247
248
    [env_cbv; apply _ ||
     fail "iEmpIntro: spatial context contains non-affine hypotheses"].
Robbert Krebbers's avatar
Robbert Krebbers committed
249

250
Tactic Notation "iPureIntro" :=
Robbert Krebbers's avatar
Robbert Krebbers committed
251
  iStartProof;
252
  eapply tac_pure_intro;
253
254
    [env_reflexivity
    |apply _ ||
255
     let P := match goal with |- FromPure _ ?P _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
256
257
     fail "iPureIntro:" P "not pure"
    |].
Robbert Krebbers's avatar
Robbert Krebbers committed
258

259
260
261
262
(** Framing *)
Local Ltac iFrameFinish :=
  lazy iota beta;
  try match goal with
263
  | |- envs_entails _ True => by iPureIntro
264
  | |- envs_entails _ emp => iEmpIntro
265
266
267
  end.

Local Ltac iFramePure t :=
268
  iStartProof;
269
270
271
272
273
274
  let φ := type of t in
  eapply (tac_frame_pure _ _ _ _ t);
    [apply _ || fail "iFrame: cannot frame" φ
    |iFrameFinish].

Local Ltac iFrameHyp H :=
275
  iStartProof;
276
  eapply tac_frame with _ H _ _ _;
277
    [env_reflexivity || fail "iFrame:" H "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
278
279
280
    |apply _ ||
     let R := match goal with |- Frame _ ?R _ _ => R end in
     fail "iFrame: cannot frame" R
281
282
283
284
285
286
    |iFrameFinish].

Local Ltac iFrameAnyPure :=
  repeat match goal with H : _ |- _ => iFramePure H end.

Local Ltac iFrameAnyPersistent :=
287
  iStartProof;
288
289
290
  let rec go Hs :=
    match Hs with [] => idtac | ?H :: ?Hs => repeat iFrameHyp H; go Hs end in
  match goal with
291
  | |- envs_entails ?Δ _ =>
292
293
294
295
     let Hs := eval cbv in (env_dom (env_persistent Δ)) in go Hs
  end.

Local Ltac iFrameAnySpatial :=
296
  iStartProof;
297
298
299
  let rec go Hs :=
    match Hs with [] => idtac | ?H :: ?Hs => try iFrameHyp H; go Hs end in
  match goal with
300
  | |- envs_entails ?Δ _ =>
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
     let Hs := eval cbv in (env_dom (env_spatial Δ)) in go Hs
  end.

Tactic Notation "iFrame" := iFrameAnySpatial.

Tactic Notation "iFrame" "(" constr(t1) ")" :=
  iFramePure t1.
Tactic Notation "iFrame" "(" constr(t1) constr(t2) ")" :=
  iFramePure t1; iFrame ( t2 ).
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) ")" :=
  iFramePure t1; iFrame ( t2 t3 ).
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4) ")" :=
  iFramePure t1; iFrame ( t2 t3 t4 ).
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4)
    constr(t5) ")" :=
  iFramePure t1; iFrame ( t2 t3 t4 t5 ).
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4)
    constr(t5) constr(t6) ")" :=
  iFramePure t1; iFrame ( t2 t3 t4 t5 t6 ).
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4)
    constr(t5) constr(t6) constr(t7) ")" :=
  iFramePure t1; iFrame ( t2 t3 t4 t5 t6 t7 ).
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4)
    constr(t5) constr(t6) constr(t7) constr(t8)")" :=
  iFramePure t1; iFrame ( t2 t3 t4 t5 t6 t7 t8 ).

Tactic Notation "iFrame" constr(Hs) :=
  let rec go Hs :=
329
    lazymatch Hs with
330
    | [] => idtac
331
332
333
    | SelPure :: ?Hs => iFrameAnyPure; go Hs
    | SelPersistent :: ?Hs => iFrameAnyPersistent; go Hs
    | SelSpatial :: ?Hs => iFrameAnySpatial; go Hs
334
    | SelIdent ?H :: ?Hs => iFrameHyp H; go Hs
335
    end
336
  in let Hs := sel_pat.parse Hs in go Hs.
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
Tactic Notation "iFrame" "(" constr(t1) ")" constr(Hs) :=
  iFramePure t1; iFrame Hs.
Tactic Notation "iFrame" "(" constr(t1) constr(t2) ")" constr(Hs) :=
  iFramePure t1; iFrame ( t2 ) Hs.
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) ")" constr(Hs) :=
  iFramePure t1; iFrame ( t2 t3 ) Hs.
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4) ")"
    constr(Hs) :=
  iFramePure t1; iFrame ( t2 t3 t4 ) Hs.
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4)
    constr(t5) ")" constr(Hs) :=
  iFramePure t1; iFrame ( t2 t3 t4 t5 ) Hs.
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4)
    constr(t5) constr(t6) ")" constr(Hs) :=
  iFramePure t1; iFrame ( t2 t3 t4 t5 t6 ) Hs.
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4)
    constr(t5) constr(t6) constr(t7) ")" constr(Hs) :=
  iFramePure t1; iFrame ( t2 t3 t4 t5 t6 t7 ) Hs.
Tactic Notation "iFrame" "(" constr(t1) constr(t2) constr(t3) constr(t4)
    constr(t5) constr(t6) constr(t7) constr(t8)")" constr(Hs) :=
  iFramePure t1; iFrame ( t2 t3 t4 t5 t6 t7 t8 ) Hs.

359
360
(** * Basic introduction tactics *)
Local Tactic Notation "iIntro" "(" simple_intropattern(x) ")" :=
361
362
363
364
365
366
367
368
369
370
371
372
373
374
  (* In the case the goal starts with an [let x := _ in _], we do not
     want to unfold x and start the proof mode. Instead, we want to
     use intros. So [iStartProof] has to be called only if [intros]
     fails *)
  intros x ||
    (iStartProof;
     lazymatch goal with
     | |- envs_entails _ _ =>
       eapply tac_forall_intro;
       [apply _ ||
              let P := match goal with |- FromForall ?P _ => P end in
              fail "iIntro: cannot turn" P "into a universal quantifier"
       |lazy beta; intros x]
     end).
375
376
377
378
379

Local Tactic Notation "iIntro" constr(H) :=
  iStartProof;
  first
  [ (* (?Q → _) *)
380
381
382
    eapply tac_impl_intro with _ H _ _ _; (* (i:=H) *)
      [apply _
      |env_cbv; apply _ ||
383
       let P := lazymatch goal with |- Persistent ?P => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
384
385
       fail 1 "iIntro: introducing non-persistent" H ":" P
              "into non-empty spatial context"
Robbert Krebbers's avatar
Robbert Krebbers committed
386
      |env_reflexivity || fail 1 "iIntro:" H "not fresh"
387
      |apply _
Robbert Krebbers's avatar
Robbert Krebbers committed
388
      |]
389
  | (* (_ -∗ _) *)
390
391
392
    eapply tac_wand_intro with _ H _ _; (* (i:=H) *)
      [apply _
      | env_reflexivity || fail 1 "iIntro:" H "not fresh"
Robbert Krebbers's avatar
Robbert Krebbers committed
393
      |]
394
  | fail "iIntro: nothing to introduce" ].
395
396
397
398
399

Local Tactic Notation "iIntro" "#" constr(H) :=
  iStartProof;
  first
  [ (* (?P → _) *)
400
401
402
    eapply tac_impl_intro_persistent with _ H _ _ _; (* (i:=H) *)
      [apply _
      |apply _ ||
403
       let P := match goal with |- IntoPersistent _ ?P _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
404
       fail 1 "iIntro:" P "not persistent"
Robbert Krebbers's avatar
Robbert Krebbers committed
405
406
      |env_reflexivity || fail 1 "iIntro:" H "not fresh"
      |]
407
  | (* (?P -∗ _) *)
408
409
410
    eapply tac_wand_intro_persistent with _ H _ _ _; (* (i:=H) *)
      [ apply _
      | apply _ ||
411
       let P := match goal with |- IntoPersistent _ ?P _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
412
413
       fail 1 "iIntro:" P "not persistent"
      |apply _ ||
414
415
       let P := match goal with |- TCOr (Affine ?P) _ => P end in
       fail 1 "iIntro:" P "not affine and the goal not absorbing"
Robbert Krebbers's avatar
Robbert Krebbers committed
416
417
      |env_reflexivity || fail 1 "iIntro:" H "not fresh"
      |]
418
  | fail "iIntro: nothing to introduce" ].
419
420
421

Local Tactic Notation "iIntro" "_" :=
  first
422
423
424
  [ (* (?Q → _) *)
    iStartProof; eapply tac_impl_intro_drop;
    [ apply _ | ]
Robbert Krebbers's avatar
Robbert Krebbers committed
425
  | (* (_ -∗ _) *)
426
427
428
    iStartProof; eapply tac_wand_intro_drop;
      [ apply _
      | apply _ ||
Robbert Krebbers's avatar
Robbert Krebbers committed
429
430
431
       let P := match goal with |- TCOr (Affine ?P) _ => P end in
       fail 1 "iIntro:" P "not affine and the goal not absorbing"
      |]
432
433
434
435
436
  | (* (∀ _, _) *) iIntro (_)
  | fail 1 "iIntro: nothing to introduce" ].

Local Tactic Notation "iIntroForall" :=
  lazymatch goal with
Robbert Krebbers's avatar
Robbert Krebbers committed
437
  | |-  _, ?P => fail (* actually an →, this is handled by iIntro below *)
438
  | |-  _, _ => intro
439
440
441
442
443
444
  | |- let _ := _ in _ => intro
  | |- _ =>
    iStartProof;
    lazymatch goal with
    | |- envs_entails _ ( x : _, _) => let x' := fresh x in iIntro (x')
    end
445
446
447
448
  end.
Local Tactic Notation "iIntro" :=
  lazymatch goal with
  | |- _  ?P => intro
449
450
451
452
453
454
  | |- _ =>
    iStartProof;
    lazymatch goal with
    | |- envs_entails _ (_ - _) => iIntro (?) || let H := iFresh in iIntro #H || iIntro H
    | |- envs_entails _ (_  _) => iIntro (?) || let H := iFresh in iIntro #H || iIntro H
    end
455
456
  end.

Robbert Krebbers's avatar
Robbert Krebbers committed
457
(** * Specialize *)
458
459
460
461
462
Record iTrm {X As} :=
  ITrm { itrm : X ; itrm_vars : hlist As ; itrm_hyps : string }.
Arguments ITrm {_ _} _ _ _.

Notation "( H $! x1 .. xn )" :=
463
  (ITrm H (hcons x1 .. (hcons xn hnil) ..) "") (at level 0, x1, xn at level 9).
464
Notation "( H $! x1 .. xn 'with' pat )" :=
465
  (ITrm H (hcons x1 .. (hcons xn hnil) ..) pat) (at level 0, x1, xn at level 9).
466
467
Notation "( H 'with' pat )" := (ITrm H hnil pat) (at level 0).

468
(*
Robbert Krebbers's avatar
Robbert Krebbers committed
469
470
471
472
473
There is some hacky stuff going on here: because of Coq bug #6583, unresolved
type classes in the arguments `xs` are resolved at arbitrary moments. Tactics
like `apply`, `split` and `eexists` wrongly trigger type class search to resolve
these holes. To avoid TC being triggered too eagerly, this tactic uses `refine`
at most places instead of `apply`.
474
*)
475
Local Tactic Notation "iSpecializeArgs" constr(H) open_constr(xs) :=
476
  let rec go xs :=
477
    lazymatch xs with
478
    | hnil => apply id (* Finally, trigger TC *)
479
    | hcons ?x ?xs =>
480
       eapply tac_forall_specialize with _ H _ _ _; (* (i:=H) (a:=x) *)
481
482
         [env_reflexivity || fail "iSpecialize:" H "not found"
         |typeclasses eauto ||
Robbert Krebbers's avatar
Robbert Krebbers committed
483
          let P := match goal with |- IntoForall ?P _ => P end in
484
          fail "iSpecialize: cannot instantiate" P "with" x
Robbert Krebbers's avatar
Robbert Krebbers committed
485
486
487
         |match goal with (* Force [A] in [ex_intro] to deal with coercions. *)
          | |-  _ : ?A, _ => refine (@ex_intro A _ x (conj _ _)); [|]
          (* If the existentially quantified predicate is non-dependent and [x]
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
488
          is a hole, [refine] will generate an additional goal. *)
Robbert Krebbers's avatar
Robbert Krebbers committed
489
          | |-  _ : ?A, _ => refine (@ex_intro A _ x (conj _ _));[shelve| |]
490
          end; [env_reflexivity|go xs]]
491
492
    end in
  go xs.
Robbert Krebbers's avatar
Robbert Krebbers committed
493

494
Local Tactic Notation "iSpecializePat" open_constr(H) constr(pat) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
495
  let solve_to_wand H1 :=
Robbert Krebbers's avatar
Robbert Krebbers committed
496
    apply _ ||
Robbert Krebbers's avatar
Robbert Krebbers committed
497
    let P := match goal with |- IntoWand _ _ ?P _ _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
498
    fail "iSpecialize:" P "not an implication/wand" in
499
500
501
502
503
504
505
506
  let solve_done d :=
    lazymatch d with
    | true =>
       done ||
       let Q := match goal with |- envs_entails _ ?Q => Q end in
       fail "iSpecialize: cannot solve" Q "using done"
    | false => idtac
    end in
Robbert Krebbers's avatar
Robbert Krebbers committed
507
508
509
  let rec go H1 pats :=
    lazymatch pats with
    | [] => idtac
510
    | SForall :: ?pats =>
Ralf Jung's avatar
Ralf Jung committed
511
       idtac "[IPM] The * specialization pattern is deprecated because it is applied implicitly.";
512
       go H1 pats
513
    | SIdent ?H2 :: ?pats =>
Robbert Krebbers's avatar
Robbert Krebbers committed
514
       eapply tac_specialize with _ _ H2 _ H1 _ _ _ _; (* (j:=H1) (i:=H2) *)
515
516
         [env_reflexivity || fail "iSpecialize:" H2 "not found"
         |env_reflexivity || fail "iSpecialize:" H1 "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
517
         |apply _ ||
Robbert Krebbers's avatar
Robbert Krebbers committed
518
519
          let P := match goal with |- IntoWand _ _ ?P ?Q _ => P end in
          let Q := match goal with |- IntoWand _ _ ?P ?Q _ => Q end in
Robbert Krebbers's avatar
Robbert Krebbers committed
520
          fail "iSpecialize: cannot instantiate" P "with" Q
521
         |env_reflexivity|go H1 pats]
522
523
    | SPureGoal ?d :: ?pats =>
       eapply tac_specialize_assert_pure with _ H1 _ _ _ _ _;
524
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
525
         |solve_to_wand H1
Robbert Krebbers's avatar
Robbert Krebbers committed
526
         |apply _ ||
527
          let Q := match goal with |- FromPure _ ?Q _ => Q end in
Robbert Krebbers's avatar
Robbert Krebbers committed
528
          fail "iSpecialize:" Q "not pure"
529
         |env_reflexivity
530
         |solve_done d (*goal*)
531
         |go H1 pats]
532
    | SGoal (SpecGoal GPersistent false ?Hs_frame [] ?d) :: ?pats =>
533
       eapply tac_specialize_assert_persistent with _ _ H1 _ _ _ _ _;
534
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
535
         |solve_to_wand H1
Robbert Krebbers's avatar
Robbert Krebbers committed
536
         |apply _ ||
537
          let Q := match goal with |- Persistent ?Q => Q end in
Robbert Krebbers's avatar
Robbert Krebbers committed
538
          fail "iSpecialize:" Q "not persistent"
539
         |apply _
540
         |env_reflexivity
541
         |iFrame Hs_frame; solve_done d (*goal*)
542
         |go H1 pats]
543
544
545
    | SGoal (SpecGoal GPersistent _ _ _ _) :: ?pats =>
       fail "iSpecialize: cannot select hypotheses for persistent premise"
    | SGoal (SpecGoal ?m ?lr ?Hs_frame ?Hs ?d) :: ?pats =>
546
       let Hs' := eval cbv in (if lr then Hs else Hs_frame ++ Hs) in
547
       eapply tac_specialize_assert with _ _ _ H1 _ lr Hs' _ _ _ _;
548
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
549
         |solve_to_wand H1
550
         |lazymatch m with
551
          | GSpatial => apply add_modal_id
552
          | GModal => apply _ || fail "iSpecialize: goal not a modality"
553
          end
554
555
         |env_reflexivity ||
          let Hs' := iMissingHyps Hs' in
556
          fail "iSpecialize: hypotheses" Hs' "not found"
557
         |iFrame Hs_frame; solve_done d (*goal*)
Robbert Krebbers's avatar
Robbert Krebbers committed
558
         |go H1 pats]
559
560
    | SAutoFrame GPersistent :: ?pats =>
       eapply tac_specialize_assert_persistent with _ _ H1 _ _ _ _;
561
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
562
         |solve_to_wand H1
Robbert Krebbers's avatar
Robbert Krebbers committed
563
         |apply _ ||
564
          let Q := match goal with |- Persistent ?Q => Q end in
Robbert Krebbers's avatar
Robbert Krebbers committed
565
          fail "iSpecialize:" Q "not persistent"
566
         |env_reflexivity
567
568
569
570
         |solve [iFrame "∗ #"]
         |go H1 pats]
    | SAutoFrame ?m :: ?pats =>
       eapply tac_specialize_frame with _ H1 _ _ _ _ _ _;
571
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
572
573
         |solve_to_wand H1
         |lazymatch m with
574
          | GSpatial => apply add_modal_id
575
576
          | GModal => apply _ || fail "iSpecialize: goal not a modality"
          end
577
578
579
580
581
         |first
            [apply tac_unlock_emp
            |apply tac_unlock_True
            |iFrame "∗ #"; apply tac_unlock
            |fail "iSpecialize: premise cannot be solved by framing"]
582
         |reflexivity]; iIntro H1; go H1 pats
583
584
    end in let pats := spec_pat.parse pat in go H pats.

Robbert Krebbers's avatar
Robbert Krebbers committed
585
(* The argument [p] denotes whether the conclusion of the specialized term is
586
587
588
persistent. If so, one can use all spatial hypotheses for both proving the
premises and the remaning goal. The argument [p] can either be a Boolean or an
introduction pattern, which will be coerced into [true] when it solely contains
589
590
591
592
593
`#` or `%` patterns at the top-level.

In case the specialization pattern in [t] states that the modality of the goal
should be kept for one of the premises (i.e. [>[H1 .. Hn]] is used) then [p]
defaults to [false] (i.e. spatial hypotheses are not preserved). *)
594
595
Tactic Notation "iSpecializeCore" open_constr(H)
    "with" open_constr(xs) open_constr(pat) "as" constr(p) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
596
  let p := intro_pat_persistent p in
597
598
599
600
601
  let pat := spec_pat.parse pat in
  let H :=
    lazymatch type of H with
    | string => constr:(INamed H)
    | _ => H
602
    end in
603
604
605
606
607
608
609
610
611
  iSpecializeArgs H xs;
  lazymatch type of H with
  | ident =>
    (* The lemma [tac_specialize_persistent_helper] allows one to use all
    spatial hypotheses for both proving the premises of the lemma we
    specialize as well as those of the remaining goal. We can only use it when
    the result of the specialization is persistent, and no modality is
    eliminated. As an optimization, we do not use this when only universal
    quantifiers are instantiated. *)
612
    let pat := spec_pat.parse pat in
613
614
615
616
617
618
    lazymatch eval compute in
      (p && bool_decide (pat  []) && negb (existsb spec_pat_modal pat)) with
    | true =>
       (* FIXME: do something reasonable when the BI is not affine *)
       eapply tac_specialize_persistent_helper with _ H _ _ _ _;
         [env_reflexivity || fail "iSpecialize:" H "not found"
619
620
621
         |iSpecializePat H pat;
           [..
           |eapply tac_specialize_persistent_helper_done with H _; env_reflexivity]
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
         |apply _ ||
          let Q := match goal with |- IntoPersistent _ ?Q _ => Q end in
          fail "iSpecialize:" Q "not persistent"
         |env_cbv; apply _ ||
          let Q := match goal with |- TCAnd _ (Affine ?Q) => Q end in
          fail "iSpecialize:" Q "not affine"
         |env_reflexivity
         |(* goal *)]
    | false => iSpecializePat H pat
    end
  | _ => fail "iSpecialize:" H "should be a hypothesis, use iPoseProof instead"
  end.

Tactic Notation "iSpecializeCore" open_constr(t) "as" constr(p) :=
  lazymatch type of t with
  | string => iSpecializeCore t with hnil "" as p
  | ident => iSpecializeCore t with hnil "" as p
  | _ =>
    lazymatch t with
    | ITrm ?H ?xs ?pat => iSpecializeCore H with xs pat as p
    | _ => fail "iSpecialize:" t "should be a proof mode term"
643
    end
644
  end.
Robbert Krebbers's avatar
Robbert Krebbers committed
645

646
Tactic Notation "iSpecialize" open_constr(t) :=
647
648
649
  iSpecializeCore t as false.
Tactic Notation "iSpecialize" open_constr(t) "as" "#" :=
  iSpecializeCore t as true.
650

Robbert Krebbers's avatar
Robbert Krebbers committed
651
(** * Pose proof *)
652
653
(* The tactic [iIntoValid] tactic solves a goal [uPred_valid Q]. The
arguments [t] is a Coq term whose type is of the following shape:
654

655
- [∀ (x_1 : A_1) .. (x_n : A_n), uPred_valid Q]
656
- [∀ (x_1 : A_1) .. (x_n : A_n), P1 ⊢ P2], in which case [Q] becomes [P1 -∗ P2]
657
658
659
660
- [∀ (x_1 : A_1) .. (x_n : A_n), P1 ⊣⊢ P2], in which case [Q] becomes [P1 ↔ P2]

The tactic instantiates each dependent argument [x_i] with an evar and generates
a goal [P] for non-dependent arguments [x_i : P]. *)
661
Tactic Notation "iIntoValid" open_constr(t) :=
662
  let rec go t :=
663
664
665
666
667
668
669
670
    (* We try two reduction tactics for the type of t before trying to
       specialize it. We first try the head normal form in order to
       unfold all the definition that could hide an entailment.  Then,
       we try the much weaker [eval cbv zeta], because entailment is
       not necessarilly opaque, and could be unfolded by [hnf].

       However, for calling type class search, we only use [cbv zeta]
       in order to make sure we do not unfold [bi_valid]. *)
671
    let tT := type of t in
672
    first
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
673
674
      [ let tT' := eval hnf in tT in go_specialize t tT'
      | let tT' := eval cbv zeta in tT in go_specialize t tT'
675
676
677
678
679
680
681
682
683
      | let tT' := eval cbv zeta in tT in
        eapply (as_valid_1 tT);
          (* Doing [apply _] here fails because that will try to solve all evars
          whose type is a typeclass, in dependency order (according to Matthieu).
          If one fails, it aborts.  However, we rely on progress on the main goal
          ([AsValid ...])  to unify some of these evars and hence enable progress
          elsewhere.  With [typeclasses eauto], that seems to work better. *)
          [solve [ typeclasses eauto with typeclass_instances ] ||
                   fail "iPoseProof: not a BI assertion"|exact t]]
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
684
  with go_specialize t tT :=
685
686
687
    lazymatch tT with                (* We do not use hnf of tT, because, if
                                        entailment is not opaque, then it would
                                        unfold it. *)
688
689
690
    | ?P  ?Q => let H := fresh in assert P as H; [|go uconstr:(t H); clear H]
    |  _ : ?T, _ =>
      (* Put [T] inside an [id] to avoid TC inference from being invoked. *)
Robbert Krebbers's avatar
Robbert Krebbers committed
691
      (* This is a workarround for Coq bug #6583. *)
692
693
      let e := fresh in evar (e:id T);
      let e' := eval unfold e in e in clear e; go (t e')
694
695
    end
  in
696
  go t.
697

698
699
(* The tactic [tac] is called with a temporary fresh name [H]. The argument
[lazy_tc] denotes whether type class inference on the premises of [lem] should
700
701
702
703
704
705
be performed before (if false) or after (if true) [tac H] is called.

The tactic [iApply] uses laxy type class inference, so that evars can first be
instantiated by matching with the goal, whereas [iDestruct] does not, because
eliminations may not be performed when type classes have not been resolved.
*)
706
707
Tactic Notation "iPoseProofCore" open_constr(lem)
    "as" constr(p) constr(lazy_tc) tactic(tac) :=
708
  iStartProof;
709
  let Htmp := iFresh in
710
711
  let t := lazymatch lem with ITrm ?t ?xs ?pat => t | _ => lem end in
  let t := lazymatch type of t with string => constr:(INamed t) | _ => t end in
712
713
714
715
716
717
  let spec_tac _ :=
    lazymatch lem with
    | ITrm ?t ?xs ?pat => iSpecializeCore (ITrm Htmp xs pat) as p
    | _ => idtac
    end in
  let go goal_tac :=
718
    lazymatch type of t with
719
    | ident =>
720
       eapply tac_pose_proof_hyp with _ _ t _ Htmp _;
721
722
         [env_reflexivity || fail "iPoseProof:" t "not found"
         |env_reflexivity || fail "iPoseProof:" Htmp "not fresh"
723
         |goal_tac ()]
724
725
    | _ =>
       eapply tac_pose_proof with _ Htmp _; (* (j:=H) *)
726
         [iIntoValid t
727
         |env_reflexivity || fail "iPoseProof:" Htmp "not fresh"
728
         |goal_tac ()]
729
    end;
730
731
732
733
    try (apply _) in
  lazymatch eval compute in lazy_tc with
  | true => go ltac:(fun _ => spec_tac (); last (tac Htmp))
  | false => go spec_tac; last (tac Htmp)
Robbert Krebbers's avatar
Robbert Krebbers committed
734
735
736
  end.

(** * Apply *)
737
Tactic Notation "iApplyHyp" constr(H) :=
738
739
  let rec go H := first
    [eapply tac_apply with _ H _ _ _;
740
      [env_reflexivity
741
742
      |apply _
      |lazy beta (* reduce betas created by instantiation *)]
743
    |iSpecializePat H "[]"; last go H] in
744
745
746
747
748
749
750
751
  iExact H ||
  go H ||
  lazymatch iTypeOf H with
  | Some (_,?Q) => fail "iApply: cannot apply" Q
  end.

Tactic Notation "iApply" open_constr(lem) :=
  iPoseProofCore lem as false true (fun H => iApplyHyp H).
Robbert Krebbers's avatar
Robbert Krebbers committed
752
753

(** * Revert *)
754
Local Tactic Notation "iForallRevert" ident(x) :=
755
756
757
758
759
760
  let err x :=
    intros x;
    iMatchHyp (fun H P =>
      lazymatch P with
      | context [x] => fail 2 "iRevert:" x "is used in hypothesis" H
      end) in
Robbert Krebbers's avatar
Robbert Krebbers committed
761
  iStartProof;
762
763
  let A := type of x in
  lazymatch type of A with
764
765
766
  | Prop => revert x; first [apply tac_pure_revert|err x]
  | _ => revert x; first [apply tac_forall_revert|err x]
  end.
Robbert Krebbers's avatar
Robbert Krebbers committed
767
768

Tactic Notation "iRevert" constr(Hs) :=
769
770
  let rec go Hs :=
    lazymatch Hs with
771
    | [] => idtac
772
773
774
    | ESelPure :: ?Hs =>
       repeat match goal with x : _ |- _ => revert x end;
       go Hs
775
    | ESelIdent _ ?H :: ?Hs =>
776
       eapply tac_revert with _ H _ _; (* (i:=H2) *)
777
         [env_reflexivity || fail "iRevert:" H "not found"
778
         |env_cbv; go Hs]
779
    end in
Robbert Krebbers's avatar
Robbert Krebbers committed
780
  let Hs := iElaborateSelPat Hs in iStartProof; go Hs.
Robbert Krebbers's avatar
Robbert Krebbers committed
781

782
Tactic Notation "iRevert" "(" ident(x1) ")" :=
Robbert Krebbers's avatar
Robbert Krebbers committed
783
  iForallRevert x1.
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
Tactic Notation "iRevert" "(" ident(x1) ident(x2) ")" :=
  iForallRevert x2; iRevert ( x1 ).
Tactic Notation "iRevert" "(" ident(x1) ident(x2) ident(x3) ")" :=
  iForallRevert x3; iRevert ( x1 x2 ).
Tactic Notation "iRevert" "(" ident(x1) ident(x2) ident(x3) ident(x4) ")" :=
  iForallRevert x4; iRevert ( x1 x2 x3 ).
Tactic Notation "iRevert" "(" ident(x1) ident(x2) ident(x3) ident(x4)
    ident(x5) ")" :=
  iForallRevert x5; iRevert ( x1 x2 x3 x4 ).
Tactic Notation "iRevert" "(" ident(x1) ident(x2) ident(x3) ident(x4)
    ident(x5) ident(x6) ")" :=
  iForallRevert x6; iRevert ( x1 x2 x3 x4 x5 ).
Tactic Notation "iRevert" "(" ident(x1) ident(x2) ident(x3) ident(x4)
    ident(x5) ident(x6) ident(x7) ")" :=
  iForallRevert x7; iRevert ( x1 x2 x3 x4 x5 x6 ).
Tactic Notation "iRevert" "(" ident(x1) ident(x2) ident(x3) ident(x4)
    ident(x5) ident(x6) ident(x7) ident(x8) ")" :=
  iForallRevert x8; iRevert ( x1 x2 x3 x4 x5 x6 x7 ).

Tactic Notation "iRevert" "(" ident(x1) ")" constr(Hs) :=
  iRevert Hs; iRevert ( x1 ).
Tactic Notation "iRevert" "(" ident(x1) ident(x2) ")" constr(Hs) :=
  iRevert Hs; iRevert ( x1 x2 ).
Tactic Notation "iRevert" "(" ident(x1) ident(x2) ident