aboutsummaryrefslogtreecommitdiffhomepage
path: root/pretyping/evarconv.ml
blob: 241e4ec0531ccaf64c6c5e4e20163654b2f1f087 (plain)
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
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
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
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371

(* $Id$ *)

open Util
open Names
open Generic
open Term
open Reduction
open Instantiate
open Environ
open Typing
open Classops
open Recordops 
open Evarutil

(* Pb: Mach cannot type evar in the general case (all Const must be applied
 * to VARs). But evars may be applied to Rels or other terms! This is the
 * difference between type_of_const and type_of_const2.
 *)
(* Fonctions temporaires pour relier la forme castée de la forme jugement *)
let tjudge_of_cast_safe sigma env var =
  match under_casts (fun _ -> nf_ise1) env sigma var with
    | DOP2 (Cast, b, t) ->
	(match whd_betadeltaiota env sigma t with
	   | DOP0 (Sort s) -> make_typed b s
	   | _ -> anomaly "Not a type (tjudge_of_cast)")
    | c -> execute_rec_type env sigma c
(* FIN TMP ***** *)


(* This code (i.e. try_solve_pb, solve_pb, etc.) takes a unification
 * problem, and tries to solve it. If it solves it, then it removes
 * all the conversion problems, and re-runs conversion on each one, in
 * the hopes that the new solution will aid in solving them.
 *
 * The kinds of problems it knows how to solve are those in which
 * the usable arguments of an existential var are all themselves
 * universal variables.
 * The solution to this problem is to do renaming for the Var's,
 * to make them match up with the Var's which are found in the
 * hyps of the existential, to do a "pop" for each Rel which is
 * not an argument of the existential, and a subst1 for each which
 * is, again, with the corresponding variable. This is done by
 * Tradevar.evar_define
 *
 * Thus, we take the arguments of the existential which we are about
 * to assign, and zip them with the identifiers in the hypotheses.
 * Then, we process all the Var's in the arguments, and sort the
 * Rel's into ascending order.  Then, we just march up, doing
 * subst1's and pop's.
 *
 * NOTE: We can do this more efficiently for the relative arguments,
 * by building a long substituend by hand, but this is a pain in the
 * ass.
 *)

let rec evar_apprec env isevars stack c =
  let (t,stack) = Reduction.apprec env !isevars c stack in 
  if ise_defined isevars t then 
    evar_apprec env isevars stack (existential_value !isevars t)
  else 
    (t,stack)

let conversion_problems = ref ([] : (conv_pb * constr * constr) list)

let reset_problems () = conversion_problems := []

let add_conv_pb pb = (conversion_problems := pb::!conversion_problems)

let get_changed_pb lev =
  let (pbs,pbs1) = 
    List.fold_left
      (fun (pbs,pbs1) pb ->
    	 if status_changed lev pb then 
	   (pb::pbs,pbs1)
         else 
	   (pbs,pb::pbs1))
      ([],[])
      !conversion_problems 
  in
  conversion_problems := pbs1;
  pbs

(* Precondition: one of the terms of the pb is an uninstanciated evar,
 * possibly applied to arguments. *)

let rec solve_pb env isevars pb =
  match solve_simple_eqn (evar_conv_x env isevars CONV) isevars pb with
    | Some lsp ->
	let pbs = get_changed_pb lsp in
	List.for_all
 	  (fun (pbty,t1,t2) -> evar_conv_x env isevars pbty t1 t2)
 	  pbs
    | None -> (add_conv_pb pb; true)

and evar_conv_x env isevars pbty term1 term2 =
  let term1 = whd_ise1 !isevars term1 in
  let term2 = whd_ise1 !isevars term2 in
  if eq_constr term1 term2 then 
    true
  else if (not(has_undefined_isevars isevars term1)) &
    not(has_undefined_isevars isevars term2) 
  then 
    is_fconv pbty env !isevars term1 term2
  else if ise_undefined isevars term1 or ise_undefined isevars term2
  then 
    solve_pb env isevars (pbty,term1,term2)
  else 
    let (t1,l1) = evar_apprec env isevars [] term1 in
    let (t2,l2) = evar_apprec env isevars [] term2 in
    if (head_is_embedded_exist isevars t1 & not(is_eliminator t2))
      or (head_is_embedded_exist isevars t2 & not(is_eliminator t1))
    then 
      (add_conv_pb (pbty,applist(t1,l1),applist(t2,l2)); true)
    else 
      evar_eqappr_x env isevars pbty (t1,l1) (t2,l2)

and evar_eqappr_x env isevars pbty appr1 appr2 =
  (* Evar must be undefined since we have whd_ised *)
  match (appr1,appr2) with
    | ((DOPN(Evar sp1,al1) as term1,l1), (DOPN(Evar sp2,al2) as term2,l2)) ->
	let f1 () =
	  if List.length l1 > List.length l2 then 
            let (deb1,rest1) = list_chop (List.length l1-List.length l2) l1 in
            solve_pb env isevars(pbty,applist(term1,deb1),term2)
            & list_for_all2eq (evar_conv_x env isevars CONV) rest1 l2
	  else
	    let (deb2,rest2) = list_chop (List.length l2-List.length l1) l2 in
	    solve_pb env isevars(pbty,term1,applist(term2,deb2))
            & list_for_all2eq (evar_conv_x env isevars CONV) l1 rest2
	and f2 () =
          (sp1 = sp2)
	  & (array_for_all2 (evar_conv_x env isevars CONV) al1 al2)  
	  & (list_for_all2eq (evar_conv_x env isevars CONV) l1 l2)
	in 
	ise_try isevars [f1; f2]

    | ((DOPN(Evar sp1,al1) as term1,l1), (DOPN(Const sp2,al2) as term2,l2)) ->
	let f1 () =
	  (List.length l1 <= List.length l2) &
	  let (deb2,rest2) = list_chop (List.length l2-List.length l1) l2 in
	  solve_pb env isevars(pbty,term1,applist(term2,deb2))
          & list_for_all2eq (evar_conv_x env isevars CONV) l1 rest2
	and f4 () =
          if evaluable_constant env term2 then
            evar_eqappr_x env isevars pbty
              appr1 (evar_apprec env isevars l2 (constant_value env term2))
          else false
	in 
	ise_try isevars [f1; f4]

    | ((DOPN(Const sp1,al1) as term1,l1), (DOPN(Evar sp2,al2) as term2,l2)) ->
	let f1 () =
       	  (List.length l2 <= List.length l1) &
       	  let (deb1,rest1) = list_chop (List.length l1-List.length l2) l1 in
	  solve_pb env isevars(pbty,applist(term1,deb1),term2)
          & list_for_all2eq (evar_conv_x env isevars CONV) rest1 l2
	and f4 () =
          if evaluable_constant env term1 then
            evar_eqappr_x env isevars pbty
              (evar_apprec env isevars l1 (constant_value env term1)) appr2
          else 
	    false
	in 
	ise_try isevars [f1; f4]

    | ((DOPN(Const sp1,al1) as term1,l1), (DOPN(Const sp2,al2) as term2,l2)) ->
	let f2 () =
          (sp1 = sp2)
	  & (array_for_all2 (evar_conv_x env isevars CONV) al1 al2)  
	  & (list_for_all2eq (evar_conv_x env isevars CONV) l1 l2)
	and f3 () =
	  (try conv_record env isevars 
             (try check_conv_record appr1 appr2
	      with Not_found -> check_conv_record appr2 appr1)
           with _ -> false)
	and f4 () =
          if evaluable_constant env term2 then
            evar_eqappr_x env isevars pbty
              appr1 (evar_apprec env isevars l2 (constant_value env term2))
          else if evaluable_constant env term1 then
            evar_eqappr_x env isevars pbty
              (evar_apprec env isevars l1 (constant_value env term1)) appr2
          else 
	    false
	in 
	ise_try isevars [f2; f3; f4]

    | ((DOPN(Evar _,_) as term1,l1),(t2,l2)) ->
       	(List.length l1 <= List.length l2) &
       	let (deb2,rest2) = list_chop (List.length l2-List.length l1) l2 in
	solve_pb env isevars(pbty,term1,applist(t2,deb2))
        & list_for_all2eq (evar_conv_x env isevars CONV) l1 rest2

    | ((t1,l1),(DOPN(Evar _,_) as t2,l2))  -> 
       	(List.length l2 <= List.length l1) &
       	let (deb1,rest1) = list_chop (List.length l1-List.length l2) l1 in
	solve_pb env isevars(pbty,applist(t1,deb1),t2)
        & list_for_all2eq (evar_conv_x env isevars CONV) rest1 l2

    | ((DOPN(Const _,_) as term1,l1),(t2,l2)) ->
	let f3 () =
	  (try conv_record env isevars (check_conv_record appr1 appr2)
           with _ -> false)
	and f4 () = 
	  evaluable_constant env term1 &
 	  evar_eqappr_x env isevars pbty
            (evar_apprec env isevars l1 (constant_value env term1)) appr2
	in 
	ise_try isevars [f3; f4]
	     
    | ((t1,l1),(DOPN(Const _,_) as t2,l2))  -> 
	let f3 () = 
	  (try (conv_record env isevars (check_conv_record appr2 appr1))
           with _ -> false)
	and f4 () =
          evaluable_constant env t2 &
 	  evar_eqappr_x env isevars pbty
            appr1 (evar_apprec env isevars l2 (constant_value env t2))
	in 
	ise_try isevars [f3; f4]

    | ((DOPN(Abst _,_) as term1,l1),(DOPN(Abst _,_) as term2,l2)) ->
	let f1 () =
          (term1=term2) &
 	  (List.length(l1) = List.length(l2)) &
 	  (List.for_all2 (evar_conv_x env isevars CONV) l1 l2)
	and f2 () =
          if evaluable_abst env term2 then 
	    evar_eqappr_x env isevars pbty
              appr1 (evar_apprec env isevars l2 (abst_value env term2))
	  else 
	    evaluable_abst env term1
            & evar_eqappr_x env isevars pbty
              (evar_apprec env isevars l1 (abst_value env term1)) appr2
	in 
	ise_try isevars [f1; f2]

    | ((DOPN(Abst _,_) as term1,l1),_) ->  
        (evaluable_abst env term1)
	& evar_eqappr_x env isevars pbty
          (evar_apprec env isevars l1 (abst_value env term1)) appr2
	  
    | (_,(DOPN(Abst _,_) as term2,l2))  -> 
        (evaluable_abst env term2)
	& evar_eqappr_x env isevars pbty
 	  appr1 (evar_apprec env isevars l2 (abst_value env term2))

    | ((Rel(n),l1),(Rel(m),l2)) ->
	n=m
	  & (List.length(l1) = List.length(l2))
	  & (List.for_all2 (evar_conv_x env isevars CONV) l1 l2)

    | ((DOP2(Cast,c,_),l),_) -> evar_eqappr_x env isevars pbty (c,l) appr2

    | (_,(DOP2(Cast,c,_),l)) -> evar_eqappr_x env isevars pbty appr1 (c,l)

    | ((VAR id1,l1),(VAR id2,l2)) ->
	(id1=id2 & (List.length l1 = List.length l2)
	     & (List.for_all2 (evar_conv_x env isevars CONV) l1 l2))

    | ((DOP0(Meta(n)),l1),(DOP0(Meta(m)),l2)) ->
	(n=m & (List.length(l1) = List.length(l2))
	   & (List.for_all2 (evar_conv_x env isevars CONV) l1 l2))

    | ((DOP0(Sort s1),[]),(DOP0(Sort s2),[])) -> base_sort_cmp pbty s1 s2

    | ((DOP2(Lambda,c1,DLAM(_,c2)),[]), (DOP2(Lambda,c'1,DLAM(_,c'2)),[])) -> 
	evar_conv_x env isevars CONV c1 c'1
	& evar_conv_x env isevars CONV c2 c'2

    | ((DOP2(Prod,c1,DLAM(n,c2)),[]), (DOP2(Prod,c'1,DLAM(_,c'2)),[])) -> 
        evar_conv_x env isevars CONV c1 c'1 
        & evar_conv_x 
	  (push_rel (n,tjudge_of_cast_safe !isevars env c1) env) isevars
	  pbty c2 c'2

    | ((DOPN(MutInd _ as o1,cl1) as ind1,l'1),
       (DOPN(MutInd _ as o2,cl2) as ind2,l'2)) ->
	o1=o2
	   & array_for_all2 (evar_conv_x env isevars CONV) cl1 cl2
           & list_for_all2eq (evar_conv_x env isevars CONV) l'1 l'2
             
    | ((DOPN(MutConstruct _ as o1,cl1) as constr1,l1),
       (DOPN(MutConstruct _ as o2,cl2) as constr2,l2)) ->
	o1=o2
           & array_for_all2 (evar_conv_x env isevars CONV) cl1 cl2
           & list_for_all2eq (evar_conv_x env isevars CONV) l1 l2

    | ((DOPN(MutCase _,_) as constr1,l'1),
       (DOPN(MutCase _,_) as constr2,l'2)) ->
	let (_,p1,c1,cl1) = destCase constr1 in
	let (_,p2,c2,cl2) = destCase constr2 in
	evar_conv_x env isevars CONV p1 p2
	& evar_conv_x env isevars CONV c1 c2
	& (array_for_all2 (evar_conv_x env isevars CONV) cl1 cl2)
	& (list_for_all2eq (evar_conv_x env isevars CONV) l'1 l'2)

    | ((DOPN(Fix _ as o1,cl1),l1),(DOPN(Fix _ as o2,cl2),l2))   ->
	o1=o2 & 
	   (array_for_all2 (evar_conv_x env isevars CONV) cl1 cl2) &
	   (list_for_all2eq (evar_conv_x env isevars CONV) l1 l2)
	     
    | ((DOPN(CoFix(i1),cl1),l1),(DOPN(CoFix(i2),cl2),l2))   ->
	i1=i2 & 
	   (array_for_all2 (evar_conv_x env isevars CONV) cl1 cl2) &
	   (list_for_all2eq (evar_conv_x env isevars CONV) l1 l2)

    (***
    | (DOP0(Implicit),[]),(DOP0(Implicit),[]) -> true
    (* added to compare easily the specification of fixed points
     * But b (optional env) is not updated! *)
    ***)

    | (DLAM(_,c1),[]),(DLAM(_,c2),[]) -> 
	evar_conv_x env isevars pbty c1 c2

    | (DLAMV(_,vc1),[]),(DLAMV(_,vc2),[]) ->
	array_for_all2 (evar_conv_x env isevars pbty) vc1 vc2

    | _ -> false

and conv_record env isevars (c,bs,(xs,xs1),(us,us1),(ts,ts1),t) = 
  let ks =
    List.fold_left
      (fun ks b ->
	 (new_isevar isevars env (substl ks b) CCI)::ks)
      [] bs
  in
  if (list_for_all2eq 
	(fun u1 u -> evar_conv_x env isevars CONV u1 (substl ks u))
	us1 us)
    &
    (list_for_all2eq 
       (fun x1 x -> evar_conv_x env isevars CONV x1 (substl ks x))
       xs1 xs)
    & (list_for_all2eq (evar_conv_x env isevars CONV) ts ts1)
    & (evar_conv_x env isevars CONV t 
	 (if ks=[] then c 
	  else  (DOPN(AppL,Array.of_list(c::(List.rev ks))))))
  then
    (*TR*) (if !compter then (nbstruc:=!nbstruc+1;
                              nbimplstruc:=!nbimplstruc+(List.length ks);true)
            else true)
  else false

and check_conv_record (t1,l1) (t2,l2) = 
  try
    let {o_DEF=c;o_TABS=bs;o_TPARAMS=xs;o_TCOMPS=us} = 
      objdef_info (cte_of_constr t1,cte_of_constr t2) in
    let xs1,t,ts = 
      match list_chop (List.length xs) l1 with 
	| xs1,t::ts -> xs1,t,ts
	| _ -> assert false 
    in
    let us1,ts1 = list_chop (List.length us) l2 in
    c,bs,(xs,xs1),(us,us1),(ts,ts1),t
  with _ -> 
    raise Not_found

let the_conv_x env isevars t1 t2 =
  is_conv env !isevars t1 t2 or evar_conv_x env isevars CONV t1 t2

(* Si conv_x_leq repond true, pourquoi diable est-ce qu'on repasse une couche
 * avec evar_conv_x! Si quelqu'un comprend pourquoi, qu'il remplace ce
 * commentaire. Sinon, il va y avoir un bon coup de balai. B.B.
 *)
let the_conv_x_leq env isevars t1 t2 =
  is_conv_leq env !isevars t1 t2
  or evar_conv_x env isevars CONV_LEQ t1 t2