1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
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
183
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
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
|
(** * PHOAS → Named Representation of Gallina *)
Require Import Crypto.Compilers.Named.Context.
Require Import Crypto.Compilers.Named.Syntax.
Require Import Crypto.Compilers.Named.Wf.
Require Import Crypto.Compilers.Named.ContextDefinitions.
Require Import Crypto.Compilers.Named.ContextProperties.
Require Import Crypto.Compilers.Named.ContextProperties.NameUtil.
Require Import Crypto.Compilers.Named.NameUtil.
Require Import Crypto.Compilers.Named.NameUtilProperties.
Require Import Crypto.Compilers.Syntax.
Require Import Crypto.Compilers.Wf.
Require Import Crypto.Compilers.Named.Compile.
Require Import Crypto.Util.PointedProp.
Require Import Crypto.Util.Option.
Require Import Crypto.Util.Prod.
Require Import Crypto.Util.Decidable.
Require Import Crypto.Util.ListUtil.
Require Import Crypto.Util.Tactics.BreakMatch.
Require Import Crypto.Util.Tactics.SpecializeBy.
Require Import Crypto.Util.Tactics.DestructHead.
Local Open Scope ctype_scope.
Local Open Scope nexpr_scope.
Local Open Scope expr_scope.
Section language.
Context {base_type_code var} {var' : base_type_code -> Type}
{op : flat_type base_type_code -> flat_type base_type_code -> Type}
{Name : Type}
{base_type_dec : DecidableRel (@eq base_type_code)}
{Name_dec : DecidableRel (@eq Name)}
{Context : @Context base_type_code Name var}
{ContextOk : ContextOk Context}
{make_var' : forall t, var t -> var' t} (* probably only needed because I was clumsy in the proof method *).
Local Notation flat_type := (flat_type base_type_code).
Local Notation type := (type base_type_code).
Local Notation exprf := (@exprf base_type_code op (fun _ => Name)).
Local Notation expr := (@expr base_type_code op (fun _ => Name)).
Local Notation wff := (@wff base_type_code op (fun _ => Name) var').
Local Notation wf := (@wf base_type_code op (fun _ => Name) var').
Local Notation nexprf := (@Named.exprf base_type_code op Name).
Local Notation nexpr := (@Named.expr base_type_code op Name).
Local Notation nwff := (@Named.wff base_type_code Name op var Context).
Local Notation nwf := (@Named.wf base_type_code Name op var Context).
Local Notation ocompilef := (@ocompilef base_type_code op Name).
Local Notation ocompile := (@ocompile base_type_code op Name).
Local Notation compilef := (@compilef base_type_code op Name).
Local Notation compile := (@compile base_type_code op Name).
Local Ltac finish_with_var' :=
(* FIXME: clean this up *)
lazymatch goal with
| [ H : find_Name_and_val _ _ ?b ?n ?i ?v None = Some _
|- find_Name_and_val _ _ ?b ?n ?i _ None <> None ]
=> (is_evar v;
let T := type of v in
let H := fresh in
assert (H : { k : T | k = v }));
[
| let H' := fresh in
let H'' := fresh in
intro H';
let T := match type of H with ?T = _ => T end in
assert (H'' : T <> None) by congruence; apply H''; revert H';
rewrite <- !find_Name_and_val_None_iff;
tauto ]
end;
match goal with
| [ v : interp_flat_type _ ?t |- @sig (interp_flat_type _ ?t) _ ]
=> exists (SmartMap.SmartVarfMap make_var' v)
end;
reflexivity.
Lemma wff_ocompilef (ctx : Context) G
(HG : forall t n v,
List.In (existT _ t (n, v)%core) G -> lookupb t ctx n <> None)
{t} (e : exprf t) e' (ls : list (option Name))
(Hwf : wff G e e')
v
(H : ocompilef e ls = Some v)
(Hls : oname_list_unique ls)
(HGls : forall t n x, List.In (existT _ t (n, x)%core) G -> List.In (Some n) ls -> False)
: prop_of_option (nwff ctx v).
Proof using ContextOk Name_dec base_type_dec make_var'.
revert dependent ctx; revert dependent ls; induction Hwf;
repeat first [ progress intros
| progress subst
| progress inversion_option
| solve [ auto ]
| progress simpl in *
| progress unfold option_map in *
| progress break_innermost_match_step
| progress break_match_hyps
| progress autorewrite with push_prop_of_option in *
| progress specialize_by tauto
| progress specialize_by auto using oname_list_unique_nil
| solve [ unfold not in *; eauto using In_skipn, oname_list_unique_firstn, oname_list_unique_skipn ]
| progress destruct_head' or
| match goal with
| [ IH : forall v ls, ocompilef ?e ls = Some v -> _, H : ocompilef ?e ?ls' = Some ?v' |- _ ]
=> specialize (IH _ _ H)
| [ IH : forall x1 x2 v ls, ocompilef (?e2 x1) ls = Some v -> _, H : ocompilef (?e2 ?x1') ?ls' = Some ?v' |- _ ]
=> specialize (fun x2 => IH _ x2 _ _ H)
| [ HG : forall t n v, List.In _ _ -> _ = Some _, H : _ = None |- _ ]
=> erewrite HG in H by eassumption
| [ |- _ /\ _ ] => split
| [ H : context[List.In _ (_ ++ _)] |- _ ]
=> setoid_rewrite List.in_app_iff in H
| [ H : split_onames _ _ = (_, _)%core |- _ ]
=> pose proof (f_equal (@fst _ _) H);
pose proof (f_equal (@snd _ _) H);
clear H
| [ H : context[snd (split_onames _ _)] |- _ ]
=> rewrite snd_split_onames_skipn in H
| [ H : forall a, (forall x y z, _ \/ _ -> _) -> _ |- _ ]
=> specialize (fun a pf1 pf2
=> H a (fun x y z pf
=> match pf with
| or_introl pf' => pf1 x y z pf'
| or_intror pf' => pf2 x y z pf'
end))
| [ H : forall a b, (forall x y z, _ \/ _ -> _) -> _ |- _ ]
=> specialize (fun a b pf1 pf2
=> H a b (fun x y z pf
=> match pf with
| or_introl pf' => pf1 x y z pf'
| or_intror pf' => pf2 x y z pf'
end))
| [ H : forall a b c, (forall x y z, _ \/ _ -> _) -> _ |- _ ]
=> specialize (fun a b c pf1 pf2
=> H a b c (fun x y z pf
=> match pf with
| or_introl pf' => pf1 x y z pf'
| or_intror pf' => pf2 x y z pf'
end))
| [ H : forall a b c d, (forall x y z, _ \/ _ -> _) -> _ |- _ ]
=> specialize (fun a b c d pf1 pf2
=> H a b c d (fun x y z pf
=> match pf with
| or_introl pf' => pf1 x y z pf'
| or_intror pf' => pf2 x y z pf'
end))
| [ H : _ |- _ ]
=> progress rewrite ?firstn_nil, ?skipn_nil, ?skipn_skipn in H
| [ H : List.In ?x (List.firstn ?a (List.skipn ?b ?ls)), H' : List.In ?x (List.skipn (?b + ?a) ?ls) |- False ]
=> rewrite firstn_skipn_add in H; apply In_skipn in H
| [ H : ?T |- prop_of_option (nwff _ ?v) ]
=> eapply H; clear H
end ];
repeat match goal with
| _ => erewrite lookupb_extend by assumption
| [ |- context[find_Name_and_val ?tdec ?ndec ?a ?b ?c ?d ?default] ]
=> lazymatch default with None => fail | _ => idtac end;
rewrite (find_Name_and_val_split tdec ndec (default:=default))
| [ H : _ |- _ ] => erewrite H by eassumption
| _ => progress unfold dec in *
| _ => progress break_innermost_match_step
| _ => progress subst
| _ => progress destruct_head' and
| _ => congruence
| [ H : List.In _ (flatten_binding_list _ _) |- _ ]
=> erewrite <- (flatten_binding_list_find_Name_and_val_unique _ _) in H;
[ | | apply path_prod_uncurried; split; [ eassumption | simpl; reflexivity ] ];
[ | solve [ eauto using oname_list_unique_firstn, oname_list_unique_skipn ] ]
| [ H : _ |- _ ]
=> first [ erewrite find_Name_and_val_wrong_type in H by eassumption
| rewrite find_Name_and_val_different in H by assumption
| rewrite snd_split_onames_skipn in H ]
| _ => solve [ eauto using In_skipn, In_firstn
| eapply split_onames_find_Name_Some_unique; [ | apply path_prod; simpl | ]; eauto ]
| [ H : find_Name_and_val _ _ ?t ?n ?N ?V None = Some _, H' : List.In (Some ?n) (List.skipn _ ?ls) |- False ]
=> eapply find_Name_and_val_find_Name_Some, split_onames_find_Name_Some_unique in H;
[ | | apply path_prod_uncurried; split; [ eassumption | simpl; reflexivity ] ];
[ | solve [ eauto using oname_list_unique_firstn, oname_list_unique_skipn ] ]
| [ H : List.In (existT _ ?t (?n, _)%core) ?G,
H' : List.In (Some ?n) (List.skipn _ ?ls),
IH : forall t' n' x', List.In (existT _ t' (n', x')%core) ?G -> List.In (Some n') ?ls -> False
|- False ]
=> apply (IH _ _ _ H); clear IH H
| [ H : List.In (existT _ ?t (?n, _)%core) ?G,
H' : find_Name _ ?n ?N = Some ?t',
IH : forall t' n' x', List.In (existT _ t' (n', x')%core) ?G -> List.In (Some n') ?ls -> False
|- _ ]
=> exfalso; apply (IH _ _ _ H); clear IH H
end.
finish_with_var'.
Qed.
Lemma wf_ocompile (ctx : Context) {t} (e : expr t) e' (ls : list (option Name))
(Hwf : wf e e')
f
(Hls : oname_list_unique ls)
(H : ocompile e ls = Some f)
: nwf ctx f.
Proof using ContextOk Name_dec base_type_dec make_var'.
revert H; destruct Hwf;
repeat first [ progress simpl in *
| progress unfold option_map, Named.interp in *
| congruence
| progress break_innermost_match
| progress inversion_option
| progress subst
| progress intros ].
intro; simpl.
eapply wff_ocompilef;
[ | solve [ eauto ] | eassumption
| inversion_prod; subst; rewrite snd_split_onames_skipn; eauto using oname_list_unique_skipn
| intros ???; erewrite <- (flatten_binding_list_find_Name_and_val_unique _ _) by eassumption;
let H := fresh in
intro H; apply find_Name_and_val_find_Name_Some in H;
eapply split_onames_find_Name_Some_unique in H; [ | eassumption.. ];
intuition ].
{ intros ???.
repeat first [ solve [ auto ]
| rewrite (lookupb_extend _ _ _)
| progress subst
| progress break_innermost_match
| erewrite <- (flatten_binding_list_find_Name_and_val_unique _ _) by eassumption
| congruence
| eassumption
| match goal with
| [ |- context[find_Name_and_val ?tdec ?ndec ?a ?b ?c ?d ?default] ]
=> lazymatch default with None => fail | _ => idtac end;
rewrite (find_Name_and_val_split tdec ndec (default:=default))
| [ H : _ |- _ ] => first [ erewrite find_Name_and_val_wrong_type in H by eassumption
| erewrite find_Name_and_val_different in H by eassumption ]
end
| progress intros ].
finish_with_var'. }
Qed.
Lemma wff_compilef (ctx : Context) {t} (e : exprf t) e' (ls : list Name)
G
(Hwf : wff G e e')
(HG : forall t n x, List.In (existT _ t (n, x)%core) G -> lookupb t ctx n <> None)
v
(H : compilef e ls = Some v)
(Hls : name_list_unique ls)
(HGls : forall t n x, List.In (existT _ t (n, x)%core) G -> List.In n ls -> False)
: prop_of_option (nwff ctx v).
Proof using ContextOk Name_dec base_type_dec make_var'.
eapply wff_ocompilef; try eassumption.
setoid_rewrite List.in_map_iff; intros; destruct_head' ex; destruct_head' and; inversion_option; subst.
eauto.
Qed.
Lemma wf_compile (ctx : Context) {t} (e : expr t) e' (ls : list Name)
(Hwf : wf e e')
f
(Hls : name_list_unique ls)
(H : compile e ls = Some f)
: nwf ctx f.
Proof using ContextOk Name_dec base_type_dec make_var'. eapply wf_ocompile; eassumption. Qed.
End language.
|
