tactics.v 89.9 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.
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
7
From iris.proofmode Require Import modality_instances frame_instances
     class_instances_bi class_instances_sbi.
8
From stdpp Require Import hlist pretty.
9
Set Default Proof Using "Type".
10
Export ident.
Robbert Krebbers's avatar
Robbert Krebbers committed
11
12

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

25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
(** For most of the tactics, we want to have tight control over the order and
way in which type class inference is performed. To that end, many tactics make
use of [notypeclasses refine] and the [iSolveTC] tactic to manually invoke type
class inference.

The tactic [iSolveTC] does not use [apply _], as that often leads to issues
because it will try to solve all evars whose type is a typeclass, in
dependency order (according to Matthieu). If one fails, it aborts. However, we
generally rely on progress on the main goal to be solved to make progress
elsewhere. With [typeclasses eauto], that seems to work better.

A drawback of [typeclasses eauto] is that it is multi-success, i.e. whenever
subsequent tactics fail, it will backtrack to [typeclasses eauto] to try the
next type class instance. This is almost always undesired and leads to poor
performance and horrible error messages, so we wrap it in a [once]. *)
Ltac iSolveTC :=
  solve [once (typeclasses eauto)].

43
(** * Misc *)
Robbert Krebbers's avatar
Robbert Krebbers committed
44

45
46
47
Ltac iMissingHyps Hs :=
  let Δ :=
    lazymatch goal with
48
    | |- envs_entails ?Δ _ => Δ
49
50
51
52
53
    | |- context[ envs_split _ _ ?Δ ] => Δ
    end in
  let Hhyps := eval env_cbv in (envs_dom Δ) in
  eval vm_compute in (list_difference Hs Hhyps).

54
Ltac iTypeOf H :=
55
  let Δ := match goal with |- envs_entails ?Δ _ => Δ end in
56
  eval env_cbv in (envs_lookup H Δ).
Robbert Krebbers's avatar
Robbert Krebbers committed
57

58
Tactic Notation "iMatchHyp" tactic1(tac) :=
59
60
61
62
  match goal with
  | |- context[ environments.Esnoc _ ?x ?P ] => tac x P
  end.

Robbert Krebbers's avatar
Robbert Krebbers committed
63
(** * Start a proof *)
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
64
65
66
Tactic Notation "iStartProof" :=
  lazymatch goal with
  | |- envs_entails _ _ => idtac
Ralf Jung's avatar
Ralf Jung committed
67
  | |- ?φ => notypeclasses refine (as_emp_valid_2 φ _ _);
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
68
69
70
71
72
73
74
75
               [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. *)
76
Tactic Notation "iStartProof" uconstr(PROP) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
77
  lazymatch goal with
78
  | |- @envs_entails ?PROP' _ _ =>
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
79
80
    (* 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
81
    let x := type_term (eq_refl : @eq Type PROP PROP') in idtac
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
82

Ralf Jung's avatar
Ralf Jung committed
83
  (* We eta-expand [as_emp_valid_2], in order to make sure that
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
84
85
     [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
86
87
     [bi_car _], and hence trigger the canonical structures mechanism
     to find the corresponding bi. *)
Ralf Jung's avatar
Ralf Jung committed
88
  | |- ?φ => notypeclasses refine ((λ P : PROP, @as_emp_valid_2 φ _ P) _ _ _);
89
               [apply _ || fail "iStartProof: not a Bi entailment"
90
               |apply tac_adequate]
Robbert Krebbers's avatar
Robbert Krebbers committed
91
92
  end.

93
94
95
(** * Generate a fresh identifier *)
(* Tactic Notation tactics cannot return terms *)
Ltac iFresh :=
96
97
98
99
  (* We need to increment the environment counter using [tac_fresh].
     But because [iFresh] returns a value, we have to let bind
     [tac_fresh] wrapped under a match to force evaluation of this
     side-effect. See https://stackoverflow.com/a/46178884 *)
100
101
102
103
104
105
106
107
108
  let do_incr :=
      lazymatch goal with
      | _ => iStartProof; eapply tac_fresh; first by (env_reflexivity)
      end in
  lazymatch goal with
  |- envs_entails ?Δ _ =>
    let n := eval env_cbv in (env_counter Δ) in
    constr:(IAnon n)
  end.
109

110
111
(** * Simplification *)
Tactic Notation "iEval" tactic(t) :=
112
  iStartProof;
113
  eapply tac_eval;
114
115
    [let x := fresh in intros x; t; unfold x; reflexivity
    |].
116

117
118
119
120
Tactic Notation "iEval" tactic(t) "in" constr(H) :=
  iStartProof;
  eapply tac_eval_in with _ H _ _ _;
    [env_reflexivity || fail "iEval:" H "not found"
121
    |let x := fresh in intros x; t; unfold x; reflexivity
122
123
    |env_reflexivity
    |].
124
125

Tactic Notation "iSimpl" := iEval simpl.
126
Tactic Notation "iSimpl" "in" constr(H) := iEval simpl in H.
127

128
129
130
131
132
133
134
(* 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. *)
135

Robbert Krebbers's avatar
Robbert Krebbers committed
136
137
138
(** * Context manipulation *)
Tactic Notation "iRename" constr(H1) "into" constr(H2) :=
  eapply tac_rename with _ H1 H2 _ _; (* (i:=H1) (j:=H2) *)
139
140
    [env_reflexivity || fail "iRename:" H1 "not found"
    |env_reflexivity || fail "iRename:" H2 "not fresh"|].
Robbert Krebbers's avatar
Robbert Krebbers committed
141

142
143
Local Inductive esel_pat :=
  | ESelPure
144
  | ESelIdent : bool  ident  esel_pat.
145

146
Ltac iElaborateSelPat pat :=
147
148
  let rec go pat Δ Hs :=
    lazymatch pat with
149
    | [] => eval cbv in Hs
150
151
    | SelPure :: ?pat => go pat Δ (ESelPure :: Hs)
    | SelPersistent :: ?pat =>
152
       let Hs' := eval env_cbv in (env_dom (env_intuitionistic Δ)) in
153
       let Δ' := eval env_cbv in (envs_clear_persistent Δ) in
154
       go pat Δ' ((ESelIdent true <$> Hs') ++ Hs)
155
156
157
    | SelSpatial :: ?pat =>
       let Hs' := eval env_cbv in (env_dom (env_spatial Δ)) in
       let Δ' := eval env_cbv in (envs_clear_spatial Δ) in
158
159
       go pat Δ' ((ESelIdent false <$> Hs') ++ Hs)
    | SelIdent ?H :: ?pat =>
160
       lazymatch eval env_cbv in (envs_lookup_delete false H Δ) with
161
       | Some (?p,_,?Δ') => go pat Δ' (ESelIdent p H :: Hs)
162
163
164
165
       | None => fail "iElaborateSelPat:" H "not found"
       end
    end in
  lazymatch goal with
166
  | |- envs_entails ?Δ _ =>
167
168
169
    let pat := sel_pat.parse pat in go pat Δ (@nil esel_pat)
  end.

170
171
Local Ltac iClearHyp H :=
  eapply tac_clear with _ H _ _; (* (i:=H) *)
172
173
174
175
176
    [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"
    |].
177

Robbert Krebbers's avatar
Robbert Krebbers committed
178
179
Tactic Notation "iClear" constr(Hs) :=
  let rec go Hs :=
180
    lazymatch Hs with
Robbert Krebbers's avatar
Robbert Krebbers committed
181
    | [] => idtac
182
    | ESelPure :: ?Hs => clear; go Hs
183
    | ESelIdent _ ?H :: ?Hs => iClearHyp H; go Hs
Robbert Krebbers's avatar
Robbert Krebbers committed
184
    end in
185
  let Hs := iElaborateSelPat Hs in iStartProof; go Hs.
186

187
188
Tactic Notation "iClear" "(" ident_list(xs) ")" constr(Hs) :=
  iClear Hs; clear xs.
Robbert Krebbers's avatar
Robbert Krebbers committed
189
190
191

(** * Assumptions *)
Tactic Notation "iExact" constr(H) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
192
  eapply tac_assumption with _ H _ _; (* (i:=H) *)
193
    [env_reflexivity || fail "iExact:" H "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
194
195
    |apply _ ||
     let P := match goal with |- FromAssumption _ ?P _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
196
197
198
     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
199
200
201

Tactic Notation "iAssumptionCore" :=
  let rec find Γ i P :=
202
    lazymatch Γ with
Robbert Krebbers's avatar
Robbert Krebbers committed
203
    | Esnoc ?Γ ?j ?Q => first [unify P Q; unify i j|find Γ i P]
Robbert Krebbers's avatar
Robbert Krebbers committed
204
205
    end in
  match goal with
206
  | |- envs_lookup ?i (Envs ?Γp ?Γs _) = Some (_, ?P) =>
207
     first [is_evar i; fail 1 | env_reflexivity]
208
  | |- envs_lookup ?i (Envs ?Γp ?Γs _) = Some (_, ?P) =>
209
     is_evar i; first [find Γp i P | find Γs i P]; env_reflexivity
210
  | |- envs_lookup_delete _ ?i (Envs ?Γp ?Γs _) = Some (_, ?P, _) =>
211
     first [is_evar i; fail 1 | env_reflexivity]
212
  | |- envs_lookup_delete _ ?i (Envs ?Γp ?Γs _) = Some (_, ?P, _) =>
213
     is_evar i; first [find Γp i P | find Γs i P]; env_reflexivity
Robbert Krebbers's avatar
Robbert Krebbers committed
214
  end.
215

Robbert Krebbers's avatar
Robbert Krebbers committed
216
Tactic Notation "iAssumption" :=
217
218
  let Hass := fresh in
  let rec find p Γ Q :=
219
    lazymatch Γ with
220
    | Esnoc ?Γ ?j ?P => first
221
       [pose proof (_ : FromAssumption p P Q) as Hass;
Robbert Krebbers's avatar
Robbert Krebbers committed
222
223
224
225
226
227
228
229
230
        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]
231
232
       |find p Γ Q]
    end in
233
  lazymatch goal with
234
  | |- envs_entails (Envs ?Γp ?Γs _) ?Q =>
235
236
237
     first [find true Γp Q | find false Γs Q
           |fail "iAssumption:" Q "not found"]
  end.
Robbert Krebbers's avatar
Robbert Krebbers committed
238
239
240
241
242

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

(** * Making hypotheses persistent or pure *)
243
Local Tactic Notation "iPersistent" constr(H) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
244
  eapply tac_persistent with _ H _ _ _; (* (i:=H) *)
245
    [env_reflexivity || fail "iPersistent:" H "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
246
    |apply _ ||
Robbert Krebbers's avatar
Robbert Krebbers committed
247
248
249
     let P := match goal with |- IntoPersistent _ ?P _ => P end in
     fail "iPersistent:" P "not persistent"
    |env_cbv; apply _ ||
250
251
     let P := match goal with |- TCOr (Affine ?P) _ => P end in
     fail "iPersistent:" P "not affine and the goal not absorbing"
252
    |env_reflexivity|].
Robbert Krebbers's avatar
Robbert Krebbers committed
253

254
Local Tactic Notation "iPure" constr(H) "as" simple_intropattern(pat) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
255
  eapply tac_pure with _ H _ _ _; (* (i:=H1) *)
256
    [env_reflexivity || fail "iPure:" H "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
257
258
259
    |apply _ ||
     let P := match goal with |- IntoPure ?P _ => P end in
     fail "iPure:" P "not pure"
Robbert Krebbers's avatar
Robbert Krebbers committed
260
    |env_cbv; apply _ ||
261
262
     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
263
264
    |intros pat].

Robbert Krebbers's avatar
Robbert Krebbers committed
265
266
267
Tactic Notation "iEmpIntro" :=
  iStartProof;
  eapply tac_emp_intro;
268
269
    [env_cbv; apply _ ||
     fail "iEmpIntro: spatial context contains non-affine hypotheses"].
Robbert Krebbers's avatar
Robbert Krebbers committed
270

271
Tactic Notation "iPureIntro" :=
Robbert Krebbers's avatar
Robbert Krebbers committed
272
  iStartProof;
273
  eapply tac_pure_intro;
274
275
    [env_reflexivity
    |apply _ ||
276
     let P := match goal with |- FromPure _ ?P _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
277
278
     fail "iPureIntro:" P "not pure"
    |].
Robbert Krebbers's avatar
Robbert Krebbers committed
279

280
281
282
283
(** Framing *)
Local Ltac iFrameFinish :=
  lazy iota beta;
  try match goal with
284
  | |- envs_entails _ True => by iPureIntro
285
  | |- envs_entails _ emp => iEmpIntro
286
287
288
  end.

Local Ltac iFramePure t :=
289
  iStartProof;
290
291
292
293
294
295
  let φ := type of t in
  eapply (tac_frame_pure _ _ _ _ t);
    [apply _ || fail "iFrame: cannot frame" φ
    |iFrameFinish].

Local Ltac iFrameHyp H :=
296
  iStartProof;
297
  eapply tac_frame with _ H _ _ _;
298
    [env_reflexivity || fail "iFrame:" H "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
299
300
301
    |apply _ ||
     let R := match goal with |- Frame _ ?R _ _ => R end in
     fail "iFrame: cannot frame" R
302
303
304
305
306
307
    |iFrameFinish].

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

Local Ltac iFrameAnyPersistent :=
308
  iStartProof;
309
310
311
  let rec go Hs :=
    match Hs with [] => idtac | ?H :: ?Hs => repeat iFrameHyp H; go Hs end in
  match goal with
312
  | |- envs_entails ?Δ _ =>
313
     let Hs := eval cbv in (env_dom (env_intuitionistic Δ)) in go Hs
314
315
316
  end.

Local Ltac iFrameAnySpatial :=
317
  iStartProof;
318
319
320
  let rec go Hs :=
    match Hs with [] => idtac | ?H :: ?Hs => try iFrameHyp H; go Hs end in
  match goal with
321
  | |- envs_entails ?Δ _ =>
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
     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 :=
350
    lazymatch Hs with
351
    | [] => idtac
352
353
354
    | SelPure :: ?Hs => iFrameAnyPure; go Hs
    | SelPersistent :: ?Hs => iFrameAnyPersistent; go Hs
    | SelSpatial :: ?Hs => iFrameAnySpatial; go Hs
355
    | SelIdent ?H :: ?Hs => iFrameHyp H; go Hs
356
    end
357
  in let Hs := sel_pat.parse Hs in go Hs.
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
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.

380
381
(** * Basic introduction tactics *)
Local Tactic Notation "iIntro" "(" simple_intropattern(x) ")" :=
382
383
384
385
386
387
388
389
390
391
392
393
394
395
  (* 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).
396
397
398
399
400

Local Tactic Notation "iIntro" constr(H) :=
  iStartProof;
  first
  [ (* (?Q → _) *)
401
402
403
    eapply tac_impl_intro with _ H _ _ _; (* (i:=H) *)
      [apply _
      |env_cbv; apply _ ||
404
       let P := lazymatch goal with |- Persistent ?P => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
405
406
       fail 1 "iIntro: introducing non-persistent" H ":" P
              "into non-empty spatial context"
Robbert Krebbers's avatar
Robbert Krebbers committed
407
      |env_reflexivity || fail 1 "iIntro:" H "not fresh"
408
      |apply _
Robbert Krebbers's avatar
Robbert Krebbers committed
409
      |]
410
  | (* (_ -∗ _) *)
411
412
413
    eapply tac_wand_intro with _ H _ _; (* (i:=H) *)
      [apply _
      | env_reflexivity || fail 1 "iIntro:" H "not fresh"
Robbert Krebbers's avatar
Robbert Krebbers committed
414
      |]
415
  | fail "iIntro: nothing to introduce" ].
416
417
418
419
420

Local Tactic Notation "iIntro" "#" constr(H) :=
  iStartProof;
  first
  [ (* (?P → _) *)
421
422
423
    eapply tac_impl_intro_persistent with _ H _ _ _; (* (i:=H) *)
      [apply _
      |apply _ ||
424
       let P := match goal with |- IntoPersistent _ ?P _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
425
       fail 1 "iIntro:" P "not persistent"
Robbert Krebbers's avatar
Robbert Krebbers committed
426
427
      |env_reflexivity || fail 1 "iIntro:" H "not fresh"
      |]
428
  | (* (?P -∗ _) *)
429
430
431
    eapply tac_wand_intro_persistent with _ H _ _ _; (* (i:=H) *)
      [ apply _
      | apply _ ||
432
       let P := match goal with |- IntoPersistent _ ?P _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
433
434
       fail 1 "iIntro:" P "not persistent"
      |apply _ ||
435
436
       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
437
438
      |env_reflexivity || fail 1 "iIntro:" H "not fresh"
      |]
439
  | fail "iIntro: nothing to introduce" ].
440
441
442

Local Tactic Notation "iIntro" "_" :=
  first
443
444
445
  [ (* (?Q → _) *)
    iStartProof; eapply tac_impl_intro_drop;
    [ apply _ | ]
Robbert Krebbers's avatar
Robbert Krebbers committed
446
  | (* (_ -∗ _) *)
447
448
449
    iStartProof; eapply tac_wand_intro_drop;
      [ apply _
      | apply _ ||
Robbert Krebbers's avatar
Robbert Krebbers committed
450
451
452
       let P := match goal with |- TCOr (Affine ?P) _ => P end in
       fail 1 "iIntro:" P "not affine and the goal not absorbing"
      |]
453
454
455
456
457
  | (* (∀ _, _) *) iIntro (_)
  | fail 1 "iIntro: nothing to introduce" ].

Local Tactic Notation "iIntroForall" :=
  lazymatch goal with
Robbert Krebbers's avatar
Robbert Krebbers committed
458
  | |-  _, ?P => fail (* actually an →, this is handled by iIntro below *)
459
  | |-  _, _ => intro
460
461
462
463
464
465
  | |- let _ := _ in _ => intro
  | |- _ =>
    iStartProof;
    lazymatch goal with
    | |- envs_entails _ ( x : _, _) => let x' := fresh x in iIntro (x')
    end
466
467
468
469
  end.
Local Tactic Notation "iIntro" :=
  lazymatch goal with
  | |- _  ?P => intro
470
471
472
473
474
475
  | |- _ =>
    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
476
477
  end.

Robbert Krebbers's avatar
Robbert Krebbers committed
478
(** * Specialize *)
479
480
481
Record iTrm {X As S} :=
  ITrm { itrm : X ; itrm_vars : hlist As ; itrm_hyps : S }.
Arguments ITrm {_ _ _} _ _ _.
482
483

Notation "( H $! x1 .. xn )" :=
484
  (ITrm H (hcons x1 .. (hcons xn hnil) ..) "") (at level 0, x1, xn at level 9).
485
Notation "( H $! x1 .. xn 'with' pat )" :=
486
  (ITrm H (hcons x1 .. (hcons xn hnil) ..) pat) (at level 0, x1, xn at level 9).
487
488
Notation "( H 'with' pat )" := (ITrm H hnil pat) (at level 0).

489
(** There is some hacky stuff going on here: because of Coq bug #6583, unresolved
Robbert Krebbers's avatar
Robbert Krebbers committed
490
491
492
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`
493
at most places instead of `apply`. *)
494
Local Tactic Notation "iSpecializeArgs" constr(H) open_constr(xs) :=
495
  let rec go xs :=
496
    lazymatch xs with
497
    | hnil => idtac
498
    | hcons ?x ?xs =>
499
       notypeclasses refine (tac_forall_specialize _ _ H _ _ _ _ _ _ _);
500
         [env_reflexivity || fail "iSpecialize:" H "not found"
501
         |iSolveTC ||
Robbert Krebbers's avatar
Robbert Krebbers committed
502
          let P := match goal with |- IntoForall ?P _ => P end in
503
          fail "iSpecialize: cannot instantiate" P "with" x
504
505
506
507
         |lazymatch goal with (* Force [A] in [ex_intro] to deal with coercions. *)
          | |-  _ : ?A, _ =>
            notypeclasses refine (@ex_intro A _ x (conj _ _))
          end; [shelve..|env_reflexivity|go xs]]
508
509
    end in
  go xs.
Robbert Krebbers's avatar
Robbert Krebbers committed
510

511
Local Tactic Notation "iSpecializePat" open_constr(H) constr(pat) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
512
  let solve_to_wand H1 :=
513
    iSolveTC ||
Robbert Krebbers's avatar
Robbert Krebbers committed
514
    let P := match goal with |- IntoWand _ _ ?P _ _ => P end in
Robbert Krebbers's avatar
Robbert Krebbers committed
515
    fail "iSpecialize:" P "not an implication/wand" in
516
517
518
519
520
521
522
523
  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
524
525
526
  let rec go H1 pats :=
    lazymatch pats with
    | [] => idtac
527
    | SForall :: ?pats =>
Ralf Jung's avatar
Ralf Jung committed
528
       idtac "[IPM] The * specialization pattern is deprecated because it is applied implicitly.";
529
       go H1 pats
530
    | SIdent ?H2 :: ?pats =>
531
       notypeclasses refine (tac_specialize _ _ _ H2 _ H1 _ _ _ _ _ _ _ _ _ _);
532
533
         [env_reflexivity || fail "iSpecialize:" H2 "not found"
         |env_reflexivity || fail "iSpecialize:" H1 "not found"
534
         |iSolveTC ||
Robbert Krebbers's avatar
Robbert Krebbers committed
535
536
          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
537
          fail "iSpecialize: cannot instantiate" P "with" Q
538
         |env_reflexivity|go H1 pats]
539
    | SPureGoal ?d :: ?pats =>
540
       notypeclasses refine (tac_specialize_assert_pure _ _ H1 _ _ _ _ _ _ _ _ _ _ _ _);
541
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
542
         |solve_to_wand H1
543
         |iSolveTC ||
544
          let Q := match goal with |- FromPure _ ?Q _ => Q end in
Robbert Krebbers's avatar
Robbert Krebbers committed
545
          fail "iSpecialize:" Q "not pure"
546
         |env_reflexivity
547
         |solve_done d (*goal*)
548
         |go H1 pats]
549
    | SGoal (SpecGoal GPersistent false ?Hs_frame [] ?d) :: ?pats =>
550
       notypeclasses refine (tac_specialize_assert_persistent _ _ _ H1 _ _ _ _ _ _ _ _ _ _ _ _ _);
551
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
552
         |solve_to_wand H1
553
         |iSolveTC ||
554
          let Q := match goal with |- Persistent ?Q => Q end in
Robbert Krebbers's avatar
Robbert Krebbers committed
555
          fail "iSpecialize:" Q "not persistent"
556
         |iSolveTC
557
         |env_reflexivity
558
         |iFrame Hs_frame; solve_done d (*goal*)
559
         |go H1 pats]
560
561
562
    | SGoal (SpecGoal GPersistent _ _ _ _) :: ?pats =>
       fail "iSpecialize: cannot select hypotheses for persistent premise"
    | SGoal (SpecGoal ?m ?lr ?Hs_frame ?Hs ?d) :: ?pats =>
563
       let Hs' := eval cbv in (if lr then Hs else Hs_frame ++ Hs) in
564
       notypeclasses refine (tac_specialize_assert _ _ _ _ H1 _ lr Hs' _ _ _ _ _ _ _ _ _ _ _);
565
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
Robbert Krebbers's avatar
Robbert Krebbers committed
566
         |solve_to_wand H1
567
         |lazymatch m with
568
569
          | GSpatial => notypeclasses refine (add_modal_id _ _)
          | GModal => iSolveTC || fail "iSpecialize: goal not a modality"
570
          end
571
572
         |env_reflexivity ||
          let Hs' := iMissingHyps Hs' in
573
          fail "iSpecialize: hypotheses" Hs' "not found"
574
         |iFrame Hs_frame; solve_done d (*goal*)
Robbert Krebbers's avatar
Robbert Krebbers committed
575
         |go H1 pats]
576
    | SAutoFrame GPersistent :: ?pats =>
577
       notypeclasses refine (tac_specialize_assert_persistent _ _ _ H1 _ _ _ _ _ _ _ _ _ _ _ _ _);
578
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
579
         |solve_to_wand H1
580
         |iSolveTC ||
581
          let Q := match goal with |- Persistent ?Q => Q end in
Robbert Krebbers's avatar
Robbert Krebbers committed
582
          fail "iSpecialize:" Q "not persistent"
583
         |env_reflexivity
584
585
586
         |solve [iFrame "∗ #"]
         |go H1 pats]
    | SAutoFrame ?m :: ?pats =>
587
       notypeclasses refine (tac_specialize_frame _ _ H1 _ _ _ _ _ _ _ _ _ _ _ _);
588
         [env_reflexivity || fail "iSpecialize:" H1 "not found"
589
590
         |solve_to_wand H1
         |lazymatch m with
591
592
          | GSpatial => notypeclasses refine (add_modal_id _ _)
          | GModal => iSolveTC || fail "iSpecialize: goal not a modality"
593
          end
594
         |first
595
596
597
            [notypeclasses refine (tac_unlock_emp _ _ _)
            |notypeclasses refine (tac_unlock_True _ _ _)
            |iFrame "∗ #"; notypeclasses refine (tac_unlock _ _ _)
598
            |fail "iSpecialize: premise cannot be solved by framing"]
599
         |exact eq_refl]; iIntro H1; go H1 pats
600
601
    end in let pats := spec_pat.parse pat in go H pats.

Robbert Krebbers's avatar
Robbert Krebbers committed
602
(* The argument [p] denotes whether the conclusion of the specialized term is
603
604
605
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
606
607
608
609
610
`#` 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). *)
611
612
Tactic Notation "iSpecializeCore" open_constr(H)
    "with" open_constr(xs) open_constr(pat) "as" constr(p) :=
Robbert Krebbers's avatar
Robbert Krebbers committed
613
  let p := intro_pat_persistent p in
614
615
616
617
618
  let pat := spec_pat.parse pat in
  let H :=
    lazymatch type of H with
    | string => constr:(INamed H)
    | _ => H
619
    end in
620
  iSpecializeArgs H xs; [..|
621
622
623
624
625
626
627
628
  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. *)
629
    let pat := spec_pat.parse pat in
630
631
632
633
    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 *)
634
       notypeclasses refine (tac_specialize_persistent_helper _ _ H _ _ _ _ _ _ _ _ _ _ _);
635
         [env_reflexivity || fail "iSpecialize:" H "not found"
636
637
         |iSpecializePat H pat;
           [..
638
639
640
           |refine (tac_specialize_persistent_helper_done _ H _ _ _);
            env_reflexivity]
         |iSolveTC ||
641
642
          let Q := match goal with |- IntoPersistent _ ?Q _ => Q end in
          fail "iSpecialize:" Q "not persistent"
643
         |env_cbv; iSolveTC ||
644
645
646
647
648
649
650
          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"
651
  end].
652
653
654
655
656
657
658
659
660

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"
661
    end
662
  end.
Robbert Krebbers's avatar
Robbert Krebbers committed
663

664
Tactic Notation "iSpecialize" open_constr(t) :=
665
666
667
  iSpecializeCore t as false.
Tactic Notation "iSpecialize" open_constr(t) "as" "#" :=
  iSpecializeCore t as true.
668

Robbert Krebbers's avatar
Robbert Krebbers committed
669
(** * Pose proof *)
Ralf Jung's avatar
Ralf Jung committed
670
671
(* The tactic [iIntoEmpValid] tactic solves a goal [bi_emp_valid Q]. The
argument [t] must be a Coq term whose type is of the following shape:
672

Ralf Jung's avatar
Ralf Jung committed
673
674
675
676
677
678
679
680
681
[∀ (x_1 : A_1) .. (x_n : A_n), φ]

and so that we have an instance `AsValid φ Q`.

Examples of such [φ]s are

- [bi_emp_valid P], in which case [Q] should be [P]
- [P1 ⊢ P2], in which case [Q] should be [P1 -∗ P2]
- [P1 ⊣⊢ P2], in which case [Q] should be [P1 ↔ P2]
682
683

The tactic instantiates each dependent argument [x_i] with an evar and generates
Ralf Jung's avatar
Ralf Jung committed
684
685
686
a goal [R] for each non-dependent argument [x_i : R].  For example, if the
original goal was [Q] and [t] has type [∀ x, P x → Q], then it generates an evar
[?x] for [x] and a subgoal [P ?x]. *)
Ralf Jung's avatar
Ralf Jung committed
687
Tactic Notation "iIntoEmpValid" open_constr(t) :=
688
  let rec go t :=
689
690
691
692
693
694
695
    (* 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]
Ralf Jung's avatar
Ralf Jung committed
696
       in order to make sure we do not unfold [bi_emp_valid]. *)
697
    let tT := type of t in
698
    first
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
699
700
      [ let tT' := eval hnf in tT in go_specialize t tT'
      | let tT' := eval cbv zeta in tT in go_specialize t tT'
701
      | let tT' := eval cbv zeta in tT in
Ralf Jung's avatar
Ralf Jung committed
702
        notypeclasses refine (as_emp_valid_1 tT _ _);
703
704
          [iSolveTC || fail "iPoseProof: not a BI assertion"
          |exact t]]
Jacques-Henri Jourdan's avatar
Jacques-Henri Jourdan committed
705
  with go_specialize t tT :=
706
707
708
    lazymatch tT with                (* We do not use hnf of tT, because, if
                                        entailment is not opaque, then it would
                                        unfold it. *)
709
710
711
    | ?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
712
      (* This is a workarround for Coq bug #6583. *)
713
714
      let e := fresh in evar (e:id T);
      let e' := eval unfold e in e in clear e; go (t e')
715
716
    end
  in
717
  go t.
718

719
720
(* 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
721
722
723
724
725
726
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.
*)
727
728
Tactic Notation "iPoseProofCore" open_constr(lem)
    "as" constr(p) constr(lazy_tc) tactic(tac) :=
729
  iStartProof;
730
  let Htmp := iFresh in
731
732
  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
733
734
735
736
737
738
  let spec_tac _ :=
    lazymatch lem with
    | ITrm ?t ?xs ?pat => iSpecializeCore (ITrm Htmp xs pat) as p
    | _ => idtac
    end in
  let go goal_tac :=
739
    lazymatch type of t with
740
    | ident =>
741
       eapply tac_pose_proof_hyp with _ _ t _ Htmp _;
742
743
         [env_reflexivity || fail "iPoseProof:" t "not found"
         |env_reflexivity || fail "iPoseProof:" Htmp "not fresh"
744
         |goal_tac ()]
745
746
    | _ =>
       eapply tac_pose_proof with _ Htmp _; (* (j:=H) *)
Ralf Jung's avatar
Ralf Jung committed
747
         [iIntoEmpValid t
748
         |env_reflexivity || fail "iPoseProof:" Htmp "not fresh"
749
         |goal_tac ()]
750
    end;
751
    try iSolveTC in
752
753
754
  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
755
756
757
  end.

(** * Apply *)
758
Tactic Notation "iApplyHyp" constr(H) :=
759
760
  let rec go H := first
    [eapply tac_apply with _ H _ _ _;
761
      [env_reflexivity
762
      |iSolveTC
763
      |lazy beta (* reduce betas created by instantiation *)]
764
    |iSpecializePat H "[]"; last go H] in
765
766
767
768
769
770
771
772
  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
773
774

(** * Revert *)
775
Local Tactic Notation "iForallRevert" ident(x) :=
776
777
778
779
780
781
  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
782
  iStartProof;
783
784
  let A := type of x in
  lazymatch type of A with
785
786
787
  | 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
788
789

Tactic Notation "iRevert" constr(Hs) :=
790
791
  let rec go Hs :=
    lazymatch Hs with
792
    | [] => idtac
793
794
795
    | ESelPure :: ?Hs =>
       repeat match goal with x : _ |- _ => revert x end;
       go Hs
796
    | ESelIdent _ ?H :: ?Hs =>
797
       eapply tac_revert with _ H _ _; (* (i:=H2) *)
798
         [env_reflexivity || fail "iRevert:" H "not found"