interpreter.v 29.6 KB
Newer Older
Michael Sammler's avatar
Michael Sammler committed
1
2
3
4
5
6
7
8
9
10
11
12
13
From iris.proofmode Require Import coq_tactics reduction.
From refinedc.lithium Require Import base infrastructure classes simpl_classes tactics_extend.

(** * Definitions of markers for controling the state *)
Notation "'HIDDEN'" := (Envs _ _ _) (only printing).

Definition LET_ID {A} (x : A) : A := x.
Arguments LET_ID : simpl never.
Notation "'HIDDEN'" := (LET_ID _) (only printing).

Definition EVAR_ID {A} (x : A) : A := x.
Arguments EVAR_ID : simpl never.

14
15
16
Definition SHELVED_SIDECOND (P : Prop) : Prop := P.
Arguments SHELVED_SIDECOND : simpl never.

Michael Sammler's avatar
Michael Sammler committed
17
18
19
20
(** * Lemmas used by tactics *)
Section coq_tactics.
  Context {Σ : gFunctors}.

Michael Sammler's avatar
Michael Sammler committed
21
22
23
24
25
  (* For some reason, replacing tac_fast_apply with more specialized
  versions gives a 1-2% performance boost, see
  https://coq-speed.mpi-sws.org/d/1QE_dqjiz/coq-compare?orgId=1&var-project=refinedc&var-branch1=master&var-commit1=05a3e8862ae4ab0041af67d1c02c552f99c4f35c&var-config1=build-coq.8.14.0-timing&var-branch2=master&var-commit2=998704f2a571385c65edfdd36332f6c3d014ec59&var-config2=build-coq.8.14.0-timing&var-metric=instructions&var-group=().*
  TODO: investigate this more
*)
Michael Sammler's avatar
Michael Sammler committed
26
27
28
29
30
31
32
33
  Lemma tac_fast_apply {Δ} {P1 P2 : iProp Σ} :
    (P1 - P2)  envs_entails Δ P1  envs_entails Δ P2.
  Proof. by rewrite envs_entails_eq => -> HP. Qed.

  Lemma tac_fast_apply_below_sep {Δ} {P1 P2 T : iProp Σ} :
    (P1 - P2)  envs_entails Δ (P1  T)  envs_entails Δ (P2  T).
  Proof. by rewrite envs_entails_eq => -> HP. Qed.

34
35
36
37
38
39
40
41
  Lemma tac_apply_i2p {Δ} {P : iProp Σ} (P' : iProp_to_Prop P) :
    envs_entails Δ P'.(i2p_P)  envs_entails Δ P.
  Proof. rewrite envs_entails_eq. etrans; [done|]. apply i2p_proof. Qed.

  Lemma tac_apply_i2p_below_sep {Δ} {P T : iProp Σ} (P' : iProp_to_Prop P) :
    envs_entails Δ (P'.(i2p_P)  T)  envs_entails Δ (P  T).
  Proof. rewrite envs_entails_eq. etrans; [done|]. apply bi.sep_mono_l. apply i2p_proof. Qed.

Michael Sammler's avatar
Michael Sammler committed
42
43
44
45
46
47
48
49
  Lemma tac_protected_eq_app {A} (f : A  Prop) a :
    f a  f (protected a).
  Proof. by rewrite protected_eq. Qed.

  Lemma tac_protected_eq_app_rev {A} (f : A  Prop) a :
    f (protected a)  f a.
  Proof. by rewrite protected_eq. Qed.

50
51
52
53
54
  Lemma tac_tactic_hint {A} Δ t (th : TacticHint t) (Q : A  iProp Σ):
    envs_entails Δ (th.(tactic_hint_P) Q) 
    envs_entails Δ (tactic_hint t Q).
  Proof.  rewrite envs_entails_eq => ?. etrans; [done|]. apply tactic_hint_proof. Qed.

Michael Sammler's avatar
Michael Sammler committed
55
56
57
58
59
60
61
62
  Lemma tac_exist_prod A B (P : _  Prop):
    ( x1 x2, P (x1, x2))  @ex (A * B) P.
  Proof. move => [?[??]]. eauto. Qed.

  Lemma tac_exist_sigT A f (P : _  Prop):
    ( (a : A) (x : f a), P (existT a x))  @ex (sigT f) P.
  Proof. move => [?[??]]. eauto. Qed.

Michael Sammler's avatar
Michael Sammler committed
63
64
65
66
  Lemma tac_find_in_context {Δ} {fic} {T : _  iProp Σ} key (F : FindInContext fic key) :
    envs_entails Δ (F T).(i2p_P)  envs_entails Δ (find_in_context fic T).
  Proof. rewrite envs_entails_eq. etrans; [done|]. apply i2p_proof. Qed.

67
68
69
70
  Lemma tac_find_hyp_equal key (Q P P' R : iProp Σ) Δ `{!FindHypEqual key Q P P'}:
    envs_entails Δ (P'  R) 
    envs_entails Δ (P  R).
  Proof. by revert select (FindHypEqual _ _ _ _) => ->. Qed.
Michael Sammler's avatar
Michael Sammler committed
71

72
73
  Lemma tac_find_hyp Δ i p R (P : iProp Σ) :
    envs_lookup i Δ = Some (p, P) 
Michael Sammler's avatar
Michael Sammler committed
74
75
    envs_entails (envs_delete false i p Δ) R  envs_entails Δ (P  R).
  Proof.
76
    rewrite envs_entails_eq. intros ? HQ.
Michael Sammler's avatar
Michael Sammler committed
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
    rewrite (envs_lookup_sound' _ false) // bi.intuitionistically_if_elim.
      by apply bi.sep_mono_r.
  Qed.

  Lemma tac_do_exist A Δ (P : A  iProp Σ) :
    ( x, envs_entails Δ (P x))  envs_entails Δ ( x : A, P x).
  Proof.
    rewrite envs_entails_eq. intros [x HP]. by rewrite -(bi.exist_intro x).
  Qed.

  Lemma tac_do_forall A Δ (P : A  iProp Σ) :
    ( x, envs_entails Δ (P x))  envs_entails Δ ( x : A, P x).
  Proof.
    rewrite envs_entails_eq. intros HP. by apply bi.forall_intro.
  Qed.
  Lemma tac_do_exist_wand A Δ (P : A  iProp Σ) Q :
    ( x, envs_entails Δ (P x - Q))  envs_entails Δ (( x : A, P x) - Q).
  Proof.
    rewrite envs_entails_eq. iIntros (HP) "Henv". iDestruct 1 as (x) "HP".
    by iApply (HP with "Henv HP").
  Qed.

  Lemma tac_do_intro_pure Δ (P : Prop) (Q : iProp Σ) :
    (P  envs_entails Δ Q)  envs_entails Δ (P - Q).
  Proof.
    rewrite envs_entails_eq => HP. iIntros "HΔ %".  by iApply HP.
  Qed.

  Lemma tac_do_intro_pure_and Δ (P : Prop) (Q : iProp Σ) :
    (P  (envs_entails Δ Q))  envs_entails Δ (P  Q).
  Proof.
    rewrite envs_entails_eq => [[HP HΔ]].
    iIntros "HΔ".  iSplit => //. by iApply HΔ.
  Qed.

112
113
114
115
116
117
118
119
120
121
  Lemma tac_do_intro_intuit_sep Δ (P Q : iProp Σ) :
    envs_entails (envs_clear_spatial Δ) (P  True)  envs_entails Δ Q  envs_entails Δ ( P  Q).
  Proof.
    rewrite envs_entails_eq => HP HQ. iIntros "Henv".
    iSplit.
    - iDestruct (envs_clear_spatial_sound with "Henv") as "[#Henv _]".
      iModIntro. iDestruct (HP with "Henv") as "[$ _]".
    - by iApply HQ.
  Qed.

Michael Sammler's avatar
Michael Sammler committed
122
123
  Lemma tac_do_simplify_hyp (P : iProp Σ) (SH: SimplifyHyp P (Some 0%N)) Δ T :
    envs_entails Δ (SH T).(i2p_P) 
Michael Sammler's avatar
Michael Sammler committed
124
125
126
    envs_entails Δ (P - T).
  Proof.
    rewrite envs_entails_eq => HP. iIntros "Henv Hl".
Michael Sammler's avatar
Michael Sammler committed
127
128
    iDestruct (HP with "Henv") as "HP".
    iDestruct (i2p_proof with "HP Hl") as "$".
Michael Sammler's avatar
Michael Sammler committed
129
130
  Qed.

Michael Sammler's avatar
Michael Sammler committed
131
132
133
134
135
  Lemma tac_do_intro i n' (P : iProp Σ) n Γs Γp T :
    env_lookup i Γs = None 
    env_lookup i Γp = None 
    envs_entails (Envs Γp (Esnoc Γs i P) n') T 
    envs_entails (Envs Γp Γs n) (P - T).
Michael Sammler's avatar
Michael Sammler committed
136
  Proof.
Michael Sammler's avatar
Michael Sammler committed
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
    rewrite envs_entails_eq => Hs Hp HP. iIntros "Henv Hl".
    rewrite (envs_app_sound (Envs Γp Γs n) (Envs Γp (Esnoc Γs i P) n) false (Esnoc Enil i P)) //; simplify_option_eq => //.
    iApply HP. iApply "Henv". iFrame.
  Qed.

  Lemma tac_do_intro_intuit i n' (P P' : iProp Σ) T n Γs Γp (Hpers : IntroPersistent P P') :
    env_lookup i Γs = None 
    env_lookup i Γp = None 
    envs_entails (Envs (Esnoc Γp i P') Γs n') T 
    envs_entails (Envs Γp Γs n) (P - T).
  Proof.
    rewrite envs_entails_eq => Hs Hp HP. iIntros "Henv HP".
    iDestruct (@ip_persistent _ _ _ Hpers with "HP") as "#HP'".
    rewrite (envs_app_sound (Envs Γp Γs n) (Envs (Esnoc Γp i P') Γs n) true (Esnoc Enil i P')) //; simplify_option_eq => //.
    iApply HP. iApply "Henv".
    iModIntro. by iSplit.
Michael Sammler's avatar
Michael Sammler committed
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
  Qed.

  Lemma tac_true Δ :
    envs_entails Δ (True%I : iProp Σ).
  Proof. rewrite envs_entails_eq. by iIntros "_". Qed.

  Lemma tac_sep_true Δ (P : iProp Σ) :
    envs_entails Δ P  envs_entails Δ (True  P).
  Proof. apply tac_fast_apply. by apply bi.True_sep_2. Qed.

  Lemma tac_sep_emp Δ (P : iProp Σ) :
    envs_entails Δ P  envs_entails Δ (emp  P).
  Proof. apply tac_fast_apply. by apply bi.emp_sep_1. Qed.

  Lemma tac_wand_emp Δ (P : iProp Σ) :
    envs_entails Δ P  envs_entails Δ (emp - P).
  Proof. apply tac_fast_apply. by iIntros "$". Qed.

  Lemma tac_sep_sep_assoc Δ (P Q R : iProp Σ) :
    envs_entails Δ (P  Q  R)  envs_entails Δ ((P  Q)  R).
  Proof. apply tac_fast_apply. iIntros "($&$&$)". Qed.

  Lemma tac_wand_sep_assoc Δ (P Q R : iProp Σ) :
    envs_entails Δ (P - Q - R)  envs_entails Δ ((P  Q) - R).
  Proof. by rewrite bi.wand_curry. Qed.

  Lemma tac_sep_exist_assoc {A} Δ (Φ : A  iProp Σ) (Q : iProp Σ):
    envs_entails Δ ( a : A, Φ a  Q)  envs_entails Δ (( a : A, Φ a)  Q).
  Proof. by rewrite bi.sep_exist_r. Qed.

183
  Lemma tac_do_simplify_goal (n : N) (P : iProp Σ) T {SG : SimplifyGoal P (Some n)} :
Michael Sammler's avatar
Michael Sammler committed
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
    (SG (λ P, P  T)%I).(i2p_P) - P  T.
  Proof. iIntros "HP". iDestruct (i2p_proof with "HP") as (?) "(H&?&$)". by iApply "H". Qed.

  Lemma tac_intro_subsume_related P T {Hrel : RelatedTo P}:
    find_in_context Hrel.(rt_fic) (λ x, subsume (Σ:=Σ) (Hrel.(rt_fic).(fic_Prop) x) P T) - P  T.
  Proof. iDestruct 1 as (x) "[HP HT]". by iApply "HT". Qed.

  Lemma tac_remove_inuit (P T : iProp Σ) `{!Persistent P} :
    P  T -  P  T.
  Proof. by iIntros "[#? $]". Qed.

  Lemma tac_do_accu Δ (f : iProp Σ  iProp Σ):
    envs_entails (envs_clear_spatial Δ) (f (env_to_prop (env_spatial Δ))) 
    envs_entails Δ (accu f).
  Proof.
    rewrite envs_entails_eq => Henv. iIntros "Henv".
    iDestruct (envs_clear_spatial_sound with "Henv") as "[#Henv Hs]". iExists (env_to_prop (env_spatial Δ)).
    rewrite -env_to_prop_sound. iFrame. iModIntro. by iApply (Henv with "Henv").
  Qed.

  Lemma tac_do_split Δ (P1 P2 : iProp Σ):
    envs_entails Δ P1  envs_entails Δ P2 
    envs_entails Δ (P1  P2).
  Proof. rewrite envs_entails_eq => HP1 HP2. by apply bi.and_intro. Qed.

  Lemma tac_split_big_sepM {K A} `{!EqDecision K} `{!Countable K} (m : gmap K A) i x Φ (P : iProp Σ):
    m !! i = None 
    (Φ i x - ([ map] k xm, Φ k x) - P) -
    ([ map] k x<[i := x]>m, Φ k x) - P.
  Proof.
    move => Hin. rewrite big_sepM_insert //.
    iIntros "HP [? Hm]". by iApply ("HP" with "[$]").
  Qed.

  Lemma tac_big_andM_insert {A B} `{Countable A} (m : gmap A B) i n (Φ : _  _→ iProp Σ) :
    m !! i = None  (Φ i n  [ map] kvm, Φ k v) -
    [ map] kv<[i:=n]>m, Φ k v.
  Proof. iIntros "[% HT]". by rewrite big_andM_insert. Qed.

  Lemma tac_big_andM_empty {A B} `{Countable A} (Φ : _  _→ iProp Σ) :
    True - [ map] kv( : gmap A B), Φ k v.
  Proof. iIntros "_". by rewrite big_andM_empty. Qed.

End coq_tactics.

(** * Optimization: Introduce let-bindings for environment *)
(** Extension point for custom reduction *)
Ltac li_pm_reduce_tac H := H.
232
233
234
Ltac li_pm_reduce_val v :=
  let v := li_pm_reduce_tac v in
  let v := reduction.pm_eval v in v.
Michael Sammler's avatar
Michael Sammler committed
235
236
Ltac li_pm_reduce :=
  match goal with
Michael Sammler's avatar
Michael Sammler committed
237
238
239
240
  | H := Envs _ _ _ |- ?u =>
       let u := eval cbv [H] in u in
       let u := li_pm_reduce_val u in
       change u
Michael Sammler's avatar
Michael Sammler committed
241
  | |- ?u =>
242
243
    let u := li_pm_reduce_val u in
    change u
Michael Sammler's avatar
Michael Sammler committed
244
245
246
247
248
249
250
251
252
253
254
255
  end.
Ltac li_pm_reflexivity := li_pm_reduce; exact eq_refl.

Local Tactic Notation "liChangeState" hyp(H) constr(Δ) :=
  match Δ with
  | @Envs ?PROP _ _ ?n =>
    let H' := fresh "IPM_JANNO" in
    pose (H' := Δ);
    clear H;
    rename H' into H
  end.

256
Ltac liEnforceInvariant :=
Michael Sammler's avatar
Michael Sammler committed
257
258
259
260
  lazymatch goal with
  | |- @envs_entails ?PROP ?Δ ?P =>
    let with_H tac :=
    match goal with
Michael Sammler's avatar
Michael Sammler committed
261
    | [ H := Envs _ _ _ |- _] =>
Michael Sammler's avatar
Michael Sammler committed
262
      lazymatch Δ with H => tac H | _ => unify Δ (H); tac H end
Michael Sammler's avatar
Michael Sammler committed
263
    | [ H := Envs _ _ _ |- _] =>
Michael Sammler's avatar
Michael Sammler committed
264
265
266
267
268
269
270
271
272
273
274
      liChangeState H Δ; tac H
    | _ =>
      match Δ with
      | Envs _ _ ?c =>
        let H := fresh "IPM_JANNO" in
        pose (H := Δ);
        hnf in (value of H);
        tac H
  end
  end in
    with_H ltac:(fun H =>
275
                   change_no_check (envs_entails H P)
Michael Sammler's avatar
Michael Sammler committed
276
277
                )
  end.
278

Michael Sammler's avatar
Michael Sammler committed
279
280
Ltac liFresh :=
  lazymatch goal with
Michael Sammler's avatar
Michael Sammler committed
281
  | [ H := Envs _ _ ?n |- _ ] =>
Michael Sammler's avatar
Michael Sammler committed
282
283
284
285
286
287
288
  let do_incr :=
    lazymatch goal with
    | H := @Envs ?PROP ?p1 ?p2 ?c |- envs_entails ?H' ?Q =>
      match H' with | H =>
      let c' := eval vm_compute in (Pos.succ c) in
      let H2 := fresh "IPM_INTERNAL" in
      pose (H2 := @Envs PROP p1 p2 c');
289
      change_no_check (@envs_entails PROP H2 Q);
Michael Sammler's avatar
Michael Sammler committed
290
291
292
293
294
295
296
297
298
299
300
301
302
303
      clear H; rename H2 into H
      end
  end in
    constr:(IAnon n)
  end.

Ltac liUnfoldLetGoal :=
  match goal with
  | |- envs_entails _ ?P =>
    let rec go P tac :=
        match P with
        | ?Q ?R => go Q tac
        | _ => is_var P; tac P
        end in
304
    go P ltac:(fun P => unfold LET_ID in P; unfold P; try clear P)
Michael Sammler's avatar
Michael Sammler committed
305
306
307
308
309
  end.

Ltac liUnfoldLetsInContext :=
  repeat match goal with
  | H := LET_ID _ |- _ => unfold LET_ID in H; unfold H; clear H
Michael Sammler's avatar
Michael Sammler committed
310
  | H := Envs _ _ _ |- _  => unfold H; clear H
Michael Sammler's avatar
Michael Sammler committed
311
312
313
  end.

(** * Management of evars *)
Michael Sammler's avatar
Michael Sammler committed
314
315
316
317
318
319
Ltac liUnfoldAllEvars :=
  repeat rewrite protected_eq;
  repeat match goal with
         | He := EVAR_ID _ |- _ => unfold He, EVAR_ID; clear He
         end.

Michael Sammler's avatar
Michael Sammler committed
320
321
322
323
324
325
326
Ltac create_protected_evar A :=
  (* necessary, otherwise pattern might not find all occurences later, see also instantiate protected *)
  let A := eval cbn in A in
  let Hevar := fresh "Hevar" in
  (* see https://stackoverflow.com/a/46178884*)
  let c :=
      match goal with
Michael Sammler's avatar
Michael Sammler committed
327
328
329
330
      | _ =>
        let x := fresh "x" in
        unshelve evar (x : A); [ liUnfoldAllEvars; liUnfoldLetsInContext; shelve |];
        pose (Hevar := EVAR_ID x : A); unfold x in Hevar; clear x
Michael Sammler's avatar
Michael Sammler committed
331
332
333
      end in
  Hevar.

Michael Sammler's avatar
Michael Sammler committed
334
335
Ltac unfold_instantiated_evar_hook H := idtac.

Michael Sammler's avatar
Michael Sammler committed
336
Ltac unfold_instantiated_evar H :=
Michael Sammler's avatar
Michael Sammler committed
337
  unfold_instantiated_evar_hook H;
Michael Sammler's avatar
Michael Sammler committed
338
  revert H;
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
  repeat match goal with
        | |- let _ := EVAR_ID ?body in _ =>
          match goal with
          | He := EVAR_ID ?var |- _ => is_evar var;
          lazymatch body with
          | context [ var ] => pattern var;
          lazymatch goal with
          | |- ?G ?E =>
            change (G He);
            simple refine (tac_protected_eq_app_rev _ _ _);
            cbv beta
          end
          end
          end
        end;
Michael Sammler's avatar
Michael Sammler committed
354
  (* This is copied from the end of instantiate_protected *)
Michael Sammler's avatar
Michael Sammler committed
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
  let tmp := fresh "tmp" in
  intros tmp;
  pattern (protected tmp);
  simple refine (tac_protected_eq_app _ _ _);
  unfold tmp, EVAR_ID; clear tmp.

(*
  H should be (protected Hevar) where Hevar is the letbinding of an evar
  tac_with should be something like
  ltac:(fun H => instantiate (1:= (protected (EVAR_ID _) + protected (EVAR_ID _))%nat) in (Value of H)
  it should use instantiate (1:= ...) in (Value of H) to instantiate the first evar in the supplied parameter which will be Hevar
  It can use _ to create new evars, but they should be surrounded by [protected (EVAR_ID _)] such that instantiate_protected can find them and create the right let bindings afterwards.
*)
Ltac instantiate_protected H' tac_with :=
  lazymatch H' with
  | protected ?H =>
    unfold EVAR_ID in H;
    (* we have to be vary careful how we instantiate the evar, as it
    may not rely on things introduced later (even let bindings),
    otherwise unification fails *)
    tac_with H;
    revert H;
    repeat lazymatch goal with
    | |- let _ := ?body in _  =>
      lazymatch body with
      | context [EVAR_ID ?x] =>
        let Hevar := fresh "Hevar" in
        set (Hevar := (EVAR_ID x));
        (* necessary, otherwise pattern might not find all occurences later, see also create_protected_evar *)
        cbn in (type of Hevar)
      end
    end;
Michael Sammler's avatar
Michael Sammler committed
387
    (* This is copied from the end of unfold_instantiated_evar *)
Michael Sammler's avatar
Michael Sammler committed
388
389
    let tmp := fresh "tmp" in
    intros tmp;
Michael Sammler's avatar
Michael Sammler committed
390
391
392
    pattern (protected tmp);
    simple refine (tac_protected_eq_app _ _ _);
    unfold tmp, EVAR_ID; clear tmp
Michael Sammler's avatar
Michael Sammler committed
393
394
395
396
397
398
399
400
401
  end.
Tactic Notation "liInst" hyp(H) open_constr(c) :=
  instantiate_protected (protected H) ltac:(fun H => instantiate (1:=c) in (Value of H)).

Ltac unfold_instantiated_evars :=
  repeat match goal with
         | H := EVAR_ID ?x |- _ => assert_fails (is_evar x); unfold_instantiated_evar H
         end.

402
Create HintDb solve_protected_eq_db discriminated.
Michael Sammler's avatar
Michael Sammler committed
403
Global Hint Constants Opaque : solve_protected_eq_db.
404
405

Ltac solve_protected_eq_unfold_tac := idtac.
Michael Sammler's avatar
Michael Sammler committed
406
407
Ltac solve_protected_eq :=
  (* intros because it is less aggressive than move => * *)
408
409
410
411
412
  intros;
  solve_protected_eq_unfold_tac;
  repeat rewrite protected_eq;
  liUnfoldAllEvars;
  lazymatch goal with |- ?a = ?b => unify a b with solve_protected_eq_db end;
Michael Sammler's avatar
Michael Sammler committed
413
414
  exact: eq_refl.

415
416
417
Ltac liEnforceInvariantAndUnfoldInstantiatedEvars :=
  unfold_instantiated_evars; try liEnforceInvariant.

Michael Sammler's avatar
Michael Sammler committed
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
(** * Checking if the context contains ownership of a certain assertion

  Note that this implementation requires that liEnforceInvariant has been called
  previously when there was a envs_entails goal.
 *)
Ltac liCheckOwnInContext P :=
  let rec go Hs :=
      lazymatch Hs with
      | Esnoc ?Hs2 ?id ?Q =>
        first [ unify Q P with typeclass_instances | go Hs2 ]
      end in
  match goal with
  | H := Envs ?Δi ?Δs _ |- _ =>
      first [ go Δs | go Δi ]
  end.
Michael Sammler's avatar
Michael Sammler committed
433
Global Hint Extern 1 (CheckOwnInContext ?P) => (liCheckOwnInContext P; constructor; exact: I) : typeclass_instances.
Michael Sammler's avatar
Michael Sammler committed
434

Michael Sammler's avatar
Michael Sammler committed
435
436
437
438
(** * Main lithium tactics *)
Ltac convert_to_i2p_tac P := fail "No convert_to_i2p_tac provided!".
Ltac convert_to_i2p P cont :=
  lazymatch P with
439
440
  | subsume ?P1 ?P2 ?T => cont uconstr:(((_ : Subsume _ _) _))
  | subsume_list ?A ?ig ?l1 ?l2 ?f ?T => cont uconstr:(((_ : SubsumeList _ _ _ _ _) _))
Michael Sammler's avatar
Michael Sammler committed
441
442
  | _ => let converted := convert_to_i2p_tac P in cont converted
  end.
Michael Sammler's avatar
Michael Sammler committed
443
Ltac extensible_judgment_hook := idtac.
Michael Sammler's avatar
Michael Sammler committed
444
445
446
447
Ltac liExtensibleJudgement :=
  lazymatch goal with
  | |- envs_entails _ ?P =>
    convert_to_i2p P ltac:(fun converted =>
448
    simple notypeclasses refine (tac_apply_i2p converted _); [solve [refine _] |]; extensible_judgment_hook
Michael Sammler's avatar
Michael Sammler committed
449
450
451
  )end.

Ltac liSimpl :=
452
453
454
  (* simpl inserts a cast even if it does not do anything (see https://coq.zulipchat.com/#narrow/stream/237656-Coq-devs.20.26.20plugin.20devs/topic/exact_no_check.2C.20repeated.20casts.20in.20proof.20terms/near/259371220
   TODO: maybe the try progress can be removed after https://github.com/coq/coq/pull/15104 is merged? *)
  try progress simpl.
Michael Sammler's avatar
Michael Sammler committed
455
456
457

Ltac liShow := liUnfoldLetsInContext.

458
Ltac liFindHyp key :=
Michael Sammler's avatar
Michael Sammler committed
459
460
461
462
  let rec go P Hs :=
      lazymatch Hs with
      | Esnoc ?Hs2 ?id ?Q =>
        first [
463
464
            lazymatch key with
            | FICSyntactic =>
465
466
467
468
469
470
471
           (* we first try to unify using the opaquenes hints of
              typeclass_instances. Directly doing exact: eq_refl
              sometimes takes 30 seconds to fail (e.g. when trying
              to unify GetMemberLoc for the same struct but with
              different names. ) TODO: investigate if constr_eq
              could help even more
              https://coq.inria.fr/distrib/current/refman/proof-engine/tactics.html#coq:tacn.constr-eq*)
472
473
474
475
476
477
478
479
              unify Q P with typeclass_instances
            | _ =>
              notypeclasses refine (tac_find_hyp_equal key Q _ _ _ _ _); [solve [refine _] | ];
              lazymatch goal with
              | |- envs_entails _ (?P'  _) =>
                unify Q P' with typeclass_instances
              end
            end;
480
            notypeclasses refine (tac_find_hyp _ id _ _ _ _ _); [li_pm_reflexivity | li_pm_reduce]
Michael Sammler's avatar
Michael Sammler committed
481
482
483
484
485
486
487
488
489
490
          | go P Hs2 ]
      end in
  lazymatch goal with
  | |- envs_entails _ (?P  _) =>
    (* we don't want to try to unify if the goal contains protected
    evars as this can take very long to fail *)
    lazymatch P with
    | context [protected _] => fail "cannot find hyp if it contains protected"
    | _ => idtac
    end;
491
    let P := li_pm_reduce_val P in
Michael Sammler's avatar
Michael Sammler committed
492
493
494
495
496
497
498
    let run_go P Hs Hi := first [ go P Hs | go P Hi] in
    lazymatch goal with
    | |- envs_entails (Envs ?Hi ?Hs _) _ => run_go P Hs Hi
    | H := (Envs ?Hi ?Hs _) |- _ => run_go P Hs Hi
    end
  end.

499
Ltac liFindHypOrTrue key :=
Michael Sammler's avatar
Michael Sammler committed
500
501
  first [
      notypeclasses refine (tac_sep_true _ _ _)
502
    | progress liFindHyp key
Michael Sammler's avatar
Michael Sammler committed
503
504
505
506
507
508
509
510
511
  ].

Ltac custom_exist_tac A protect := fail "No custom_exist_tac provided.".
Ltac liExist protect :=
  lazymatch goal with
  | |- envs_entails _ (bi_exist _) => notypeclasses refine (tac_do_exist _ _ _ _)
  | _ => idtac
  end;
  lazymatch goal with
512
  | |- @ex ?A ?P =>
Michael Sammler's avatar
Michael Sammler committed
513
514
515
516
    first [
        custom_exist_tac A protect
      | lazymatch A with
        | TCForall2 _ _ _ => eexists _
517
        (* | Type => eexists _ *)
Michael Sammler's avatar
Michael Sammler committed
518
519
520
521
522
        | @eq ?B ?x _ => exists (@eq_refl B x)
        | prod _ _ => apply: tac_exist_prod
        | sigT _ => apply: tac_exist_sigT
        | unit => exists tt
        | ?A =>
523
524
525
526
527
528
529
530
531
            first [
                let p := constr:(_ : SimplExist A P _) in
                refine (@simpl_exist_proof _ _ _ p _)
              |
                lazymatch protect with
                | true => let Hevar := create_protected_evar A in exists (protected Hevar)
                | false => eexists _
                end
              ]
Michael Sammler's avatar
Michael Sammler committed
532
533
534
535
536
537
538
        end ]
  | _ => fail "do_exist: unknown goal"
  end.

Ltac liFindInContext :=
  lazymatch goal with
  | |- envs_entails _ (find_in_context ?fic ?T) =>
539
540
541
542
543
    let key := open_constr:(_) in
    (* We exploit that [typeclasses eauto] is multi-success to enable
    multiple implementations of [FindInContext]. They are tried in the
    order of their priorities.
    See https://coq.zulipchat.com/#narrow/stream/237977-Coq-users/topic/Multi-success.20TC.20resolution.20from.20ltac.3F/near/242759123 *)
Michael Sammler's avatar
Michael Sammler committed
544
    once (simple notypeclasses refine (tac_find_in_context key _ _);
545
      [ shelve | typeclasses eauto | simpl; repeat liExist false; liFindHypOrTrue key ])
Michael Sammler's avatar
Michael Sammler committed
546
547
548
549
550
551
552
  end.

Ltac liTrue :=
  lazymatch goal with
  | |- envs_entails _ True => notypeclasses refine (tac_true _)
  end.

553
554
555
556
557
558
559
560
561
562
563
564
565
Ltac li_shelve_sidecond :=
  idtac;
  lazymatch goal with
  | |- ?G => change_no_check (SHELVED_SIDECOND G); shelve
  end.

Ltac li_unshelve_sidecond :=
  idtac;
  lazymatch goal with
  | |- SHELVED_SIDECOND ?G => change_no_check G
  | |- _ => shelve
  end.

Michael Sammler's avatar
Michael Sammler committed
566
567
Ltac liFalse :=
  lazymatch goal with
568
569
  | |- envs_entails _ False => exfalso; li_shelve_sidecond
  | |- False => li_shelve_sidecond
Michael Sammler's avatar
Michael Sammler committed
570
571
  end.

Michael Sammler's avatar
Michael Sammler committed
572
573
574
575
576
577
578
Ltac liImpl :=
  lazymatch goal with
  (* relying on the fact that unification variables cannot contain
  dependent variables to distinguish between dependent and non dependent forall *)
  | |- ?P -> ?Q =>
    lazymatch type of P with
    | Prop => first [
579
              (* first check if the hyp is trivial *)
Michael Sammler's avatar
cleanup    
Michael Sammler committed
580
              assert_is_trivial P; intros _
581
            |
Michael Sammler's avatar
Michael Sammler committed
582
              progress normalize_goal_impl; simpl
583
584
585
586
587
588
589
590
591
            |
            (*
              one could also try getting rid of the equality in the goal with something like the
              following, but it does not seem to be much faster:
              let inst := eval unfold li_this_is_a_dummy_definition in (_ : SimplImplUnsafe _ P _) in
              lazymatch (type of inst) with
              | SimplImplUnsafe false _ _ =>
             *)
            apply: apply_simpl_impl; simpl;
Michael Sammler's avatar
Michael Sammler committed
592
593
594
595
596
              match goal with
              | |- true = true -> _ => move => _
              | |- false = false -> ?P  _ => move => _;
                match P with
                |  _, _ => fail 1 "handled by do_forall"
597
598
599
                | _ = _ =>
                    check_injection_tac;
                    let Hi := fresh "Hi" in move => Hi; injection Hi; clear Hi
Michael Sammler's avatar
cleanup    
Michael Sammler committed
600
                | _ => assert_is_not_trivial P; intros ?; subst
Michael Sammler's avatar
Michael Sammler committed
601
602
603
604
605
606
607
608
609
610
                | _ => move => _
                end
              end
            ]
    (* just some unused variable, forget it *)
    | _ => move => _
    end
  end.

Ltac liForall :=
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
  (* n tells us how many quantifiers we should introduce with this name *)
  let rec do_intro n name :=
    lazymatch n with
    | S ?n' =>
      lazymatch goal with
      (* relying on the fact that unification variables cannot contain
         dependent variables to distinguish between dependent and non dependent forall *)
      | |- ?P -> ?Q =>
          lazymatch type of P with
          | Prop => fail "implication, not forall"
          | _ => (* just some unused variable, discard *) move => _
          end
      | |- forall _ : ?A, _ =>
        (* When changing this, also change [prepare_initial_coq_context] in automation.v *)
        lazymatch A with
        | (prod _ _) => case; do_intro (S (S O)) name
        | unit => case
        | _ =>
            first [
                (* We match again since having e in the context when calling fresh can mess up names. *)
                lazymatch goal with
                | |- forall e : ?A, @?P e =>
                    let sn := open_constr:(_ : nat) in
                    let p := constr:(_ : SimplForall A sn P _) in
                    refine (@simpl_forall_proof _ _ _ _ p _);
                    do_intro sn name
                end
              | let H := fresh name in intro H
              ]
        end
      end; do_intro n' name
    | O => idtac
Michael Sammler's avatar
Michael Sammler committed
643
644
645
    end
  in
  lazymatch goal with
646
  | |- envs_entails _ (bi_forall (λ name, _)) => notypeclasses refine (tac_do_forall _ _ _ _); do_intro (S O) name
Michael Sammler's avatar
Michael Sammler committed
647
  | |- envs_entails _ (bi_wand (bi_exist (λ name, _)) _) =>
648
649
650
    notypeclasses refine (tac_do_exist_wand _ _ _ _ _); do_intro (S O) name
  | |- ( name, _)  _ => case; do_intro (S O) name
  | |- forall name, _ => do_intro (S O) name
Michael Sammler's avatar
Michael Sammler committed
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
  | _ => fail "do_forall: unknown goal"
  end.

(* This tactic checks if destructing x would lead to multiple
non-trivial subgoals. The main reason for it is that we don't want to
destruct constructors like true as this would not be useful. *)
Ltac non_trivial_destruct x :=
  first [
      have : (const False x); [ clear; case_eq x; intros => //; (*
      check if there is only one goal remaining *) [ idtac ]; fail 1 "trivial destruct" |]
    | idtac
  ].

Ltac record_destruct_hint hint info := idtac.
Ltac liDestructHint :=
  lazymatch goal with
  | |- @envs_entails ?PROP ?Δ (destruct_hint ?hint ?info ?T) =>
668
    change_no_check (@envs_entails PROP Δ T);
Michael Sammler's avatar
Michael Sammler committed
669
670
671
672
673
    lazymatch hint with
    | DHintInfo =>
       record_destruct_hint hint info
    | DHintDestruct _ (@bool_decide ?P ?b) =>
      let H := fresh "H" in destruct_decide (@bool_decide_reflect P b) as H; revert H; [
Michael Sammler's avatar
Michael Sammler committed
674
675
      record_destruct_hint hint (info, true) |
      record_destruct_hint hint (info, false) ]
Michael Sammler's avatar
Michael Sammler committed
676
677
678
679
680
    | DHintDestruct _ ?x =>
      tryif (non_trivial_destruct x) then
        case_eq x; repeat liForall;
        lazymatch goal with
        | |- _ = ?res  _ =>
Michael Sammler's avatar
Michael Sammler committed
681
          record_destruct_hint hint (info, res)
Michael Sammler's avatar
Michael Sammler committed
682
683
684
685
686
687
        end
      else (
          idtac
        )
    | @DHintDecide ?P ?b =>
       let H := fresh "H" in destruct_decide (@decide P b) as H; revert H; [
Michael Sammler's avatar
Michael Sammler committed
688
689
      record_destruct_hint hint (info, true) |
      record_destruct_hint hint (info, false) ]
Michael Sammler's avatar
Michael Sammler committed
690
691
692
    end
  end; repeat (liForall || liImpl); try by [exfalso; can_solve_tac].

Michael Sammler's avatar
Michael Sammler committed
693
Ltac liTacticHint :=
Michael Sammler's avatar
Michael Sammler committed
694
  lazymatch goal with
695
696
  | |- envs_entails _ (tactic_hint _ _) =>
      simple notypeclasses refine (tac_tactic_hint _ _ _ _ _); [ solve [refine _] |]
Michael Sammler's avatar
Michael Sammler committed
697
698
  end.

Michael Sammler's avatar
Michael Sammler committed
699
700
701
702
703
704
705
706
Ltac liAccu :=
  lazymatch goal with
  | |- envs_entails _ (accu _) =>
    notypeclasses refine (tac_do_accu _ _ _); li_pm_reduce
  end.

Ltac liSideCond :=
  lazymatch goal with
707
  | |- ?P  ?Q =>
Michael Sammler's avatar
Michael Sammler committed
708
    lazymatch P with
709
    | shelve_hint _ => split; [ unfold shelve_hint; li_shelve_sidecond |]
Michael Sammler's avatar
Michael Sammler committed
710
    | _ => first [
711
712
713
714
      lazymatch P with
      | context [protected _] => fail
      | _ => split; [splitting_fast_done|]
      end |
Michael Sammler's avatar
Michael Sammler committed
715
      progress normalize_goal_and |
Michael Sammler's avatar
Michael Sammler committed
716
717
718
719
720
721
722
723
724
    lazymatch P with
    | context [protected _] => first [
        split; [ solve_protected_eq |]; unfold_instantiated_evars
      | notypeclasses refine (apply_simpl_and _ _ _ _ _); [ solve [refine _] |]; simpl;
        lazymatch goal with
        | |- true = true -> _ => move => _
        | _ => fail "could not simplify goal with evar"
        end
      ]
725
726
727
     (* We use done instead of fast_done here because solving more
     sideconditions here is a bigger performance win than the overhead
     of done. *)
728
    | _ => split; [ first [ done | li_shelve_sidecond ] | ]
Michael Sammler's avatar
Michael Sammler committed
729
730
731
732
733
734
735
736
737
738
739
740
741
    end ] end
  | _ => fail "do_side_cond: unknown goal"
  end.

Ltac liSep :=
  lazymatch goal with
  | |- envs_entails _ (bi_sep ?P _) =>
    assert_fails (has_evar P);
    lazymatch P with
    | bi_sep _ _ => notypeclasses refine (tac_sep_sep_assoc _ _ _ _ _)
    | bi_exist _ => notypeclasses refine (tac_sep_exist_assoc _ _ _ _)
    | bi_emp => notypeclasses refine (tac_sep_emp _ _ _)
    | (_)%I => notypeclasses refine (tac_do_intro_pure_and _ _ _ _)
742
    (* TODO: Is this really the right thing to do? *)
Michael Sammler's avatar
Michael Sammler committed
743
    | ( ?P)%I => notypeclasses refine (tac_do_intro_intuit_sep _ _ _ _ _); [li_pm_reduce|]
Michael Sammler's avatar
Michael Sammler committed
744
745
746
    | match ?x with _ => _ end => fail "should not have match in sep"
    | ?P => first [
               convert_to_i2p P ltac:(fun converted =>
747
               simple notypeclasses refine (tac_apply_i2p_below_sep converted _); [solve[refine _] |])
748
             | progress liFindHyp FICSyntactic
749
             | simple notypeclasses refine (tac_fast_apply (tac_do_simplify_goal 0%N _ _) _); [solve [refine _] |]
Michael Sammler's avatar
Michael Sammler committed
750
751
             | simple notypeclasses refine (tac_fast_apply (tac_intro_subsume_related _ _) _); [solve [refine _] |];
               simpl; liFindInContext
752
             | simple notypeclasses refine (tac_fast_apply (tac_do_simplify_goal _ _ _) _); [| solve [refine _] |]
Michael Sammler's avatar
Michael Sammler committed
753
754
755
756
757
758
             | fail "do_sep: unknown sidecondition" P
      ]
    end
  end.

Ltac liWand :=
Michael Sammler's avatar
Michael Sammler committed
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
  let wand_intro P :=
    first [
        let SH := constr:(_ : SimplifyHyp P (Some 0%N)) in
        simple notypeclasses refine (tac_do_simplify_hyp P SH _ _ _)
      |
        let P' := open_constr:(_) in
        let ip := constr:(_ : IntroPersistent P P') in
        let n := lazymatch goal with | [ H := Envs _ _ ?n |- _ ] => constr:(n) end in
        let H := constr:(IAnon n) in
        let n' := eval vm_compute in (Pos.succ n) in
        simple notypeclasses refine (tac_do_intro_intuit H n' P P' _ _ _ _ ip _ _ _); [reduction.pm_reflexivity..|]
      |
        let n := lazymatch goal with | [ H := Envs _ _ ?n |- _ ] => constr:(n) end in
        let H := constr:(IAnon n) in
        let n' := eval vm_compute in (Pos.succ n) in
        simple notypeclasses refine (tac_do_intro H n' P _ _ _ _ _ _ _); [reduction.pm_reflexivity..|]
      ] in
Michael Sammler's avatar
Michael Sammler committed
776
777
778
779
780
781
782
783
  lazymatch goal with
  | |- envs_entails _ (bi_wand ?P _) =>
      lazymatch P with
      | bi_sep _ _ => notypeclasses refine (tac_wand_sep_assoc _ _ _ _ _)
      | bi_exist _ => fail "handled by do_forall"
      | bi_emp => notypeclasses refine (tac_wand_emp _ _ _)
      | bi_pure _ => notypeclasses refine (tac_do_intro_pure _ _ _ _)
      | match ?x with _ => _ end => fail "should not have match in wand "
Michael Sammler's avatar
Michael Sammler committed
784
      | _ => wand_intro P
Michael Sammler's avatar
Michael Sammler committed
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
      end
  end.

Ltac liAnd :=
  lazymatch goal with
  | |- envs_entails _ (bi_and ?P _) =>
    notypeclasses refine (tac_do_split _ _ _ _ _)
  | |- envs_entails _ ([ map] __∈<[_:=_]>_, _) =>
    notypeclasses refine (tac_fast_apply (tac_big_andM_insert _ _ _ _) _)
  | |- envs_entails _ ([ map] __∈, _) =>
    notypeclasses refine (tac_fast_apply (tac_big_andM_empty _) _)
  end.

Ltac liStep :=
  first [
      liExtensibleJudgement
    | liSep
    | liAnd
    | liWand
    | liExist true
    | liImpl
    | liForall
    | liSideCond
    | liFindInContext
    | liDestructHint
Michael Sammler's avatar
Michael Sammler committed
810
    | liTacticHint
Michael Sammler's avatar
Michael Sammler committed
811
    | liTrue
Michael Sammler's avatar
Michael Sammler committed
812
    | liFalse
Michael Sammler's avatar
Michael Sammler committed
813
814
815
    | liAccu
    | liUnfoldLetGoal
    ].