1 (* Copyright (C) 2003-2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
29 module S = CicSubstitution
30 module DTI = DoubleTypeInference
32 module PEH = ProofEngineHelpers
34 module H = ProceduralHelpers
35 module Cl = ProceduralClassify
37 (* term preprocessing: optomization 1 ***************************************)
39 let defined_premise = "DEFINED"
42 let name = C.Name defined_premise in
43 C.LetIn (name, v, C.Rel 1)
46 let rec aux k n = function
47 | C.Lambda (s, v, t) when k > 0 ->
48 C.Lambda (s, v, aux (pred k) n t)
49 | C.Lambda (_, _, t) when n > 0 ->
50 aux 0 (pred n) (S.lift (-1) t)
52 Printf.eprintf "CicPPP clear_absts: %u %s\n" n (Pp.ppterm t);
58 let rec add_abst k = function
59 | C.Lambda (s, v, t) when k > 0 -> C.Lambda (s, v, add_abst (pred k) t)
60 | t when k > 0 -> assert false
61 | t -> C.Lambda (C.Anonymous, C.Implicit None, S.lift 1 t)
63 let rec opt1_letin g es c name v t =
64 let name = H.mk_fresh_name c name in
65 let entry = Some (name, C.Def (v, None)) in
67 if DTI.does_not_occur 1 t then begin
68 let x = S.lift (-1) t in
69 HLog.warn "Optimizer: remove 1"; opt1_proof g true c x
72 | C.LetIn (nname, vv, tt) when H.is_proof c v ->
73 let x = C.LetIn (nname, vv, C.LetIn (name, tt, S.lift_from 2 1 t)) in
74 HLog.warn "Optimizer: swap 1"; opt1_proof g true c x
75 | v when H.is_proof c v && H.is_atomic v ->
76 let x = S.subst v t in
77 HLog.warn "Optimizer: remove 5"; opt1_proof g true c x
79 g (C.LetIn (name, v, t))
81 if es then opt1_term g es c v else g v
83 if es then opt1_proof g es (entry :: c) t else g t
85 and opt1_lambda g es c name w t =
86 let name = H.mk_fresh_name c name in
87 let entry = Some (name, C.Decl w) in
88 let g t = g (C.Lambda (name, w, t)) in
89 if es then opt1_proof g es (entry :: c) t else g t
91 and opt1_appl g es c t vs =
94 | C.LetIn (mame, vv, tt) ->
95 let vs = List.map (S.lift 1) vs in
96 let x = C.LetIn (mame, vv, C.Appl (tt :: vs)) in
97 HLog.warn "Optimizer: swap 2"; opt1_proof g true c x
98 | C.Lambda (name, ww, tt) ->
99 let v, vs = List.hd vs, List.tl vs in
100 let x = C.Appl (C.LetIn (name, v, tt) :: vs) in
101 HLog.warn "Optimizer: remove 2"; opt1_proof g true c x
103 let x = C.Appl (vvs @ vs) in
104 HLog.warn "Optimizer: nested application"; opt1_proof g true c x
106 let rec aux d rvs = function
108 let x = C.Appl (t :: List.rev rvs) in
109 if d then opt1_proof g true c x else g x
110 | v :: vs, (cc, bb) :: cs ->
111 if H.is_not_atomic v && I.S.mem 0 cc && bb then begin
112 HLog.warn "Optimizer: anticipate 1";
113 aux true (define v :: rvs) (vs, cs)
115 aux d (v :: rvs) (vs, cs)
116 | _, [] -> assert false
119 let classes, conclusion = Cl.classify c (H.get_type c t) in
120 let csno, vsno = List.length classes, List.length vs in
122 let vvs, vs = HEL.split_nth csno vs in
123 let x = C.Appl (define (C.Appl (t :: vvs)) :: vs) in
124 HLog.warn "Optimizer: anticipate 2"; opt1_proof g true c x
125 else match conclusion, List.rev vs with
126 | Some _, rv :: rvs when csno = vsno && H.is_not_atomic rv ->
127 let x = C.Appl (t :: List.rev rvs @ [define rv]) in
128 HLog.warn "Optimizer: anticipate 3"; opt1_proof g true c x
129 | _ (* Some _, _ *) ->
132 aux false [] (vs, classes)
134 let rec aux h prev = function
135 | C.LetIn (name, vv, tt) :: vs ->
136 let t = S.lift 1 t in
137 let prev = List.map (S.lift 1) prev in
138 let vs = List.map (S.lift 1) vs in
139 let y = C.Appl (t :: List.rev prev @ tt :: vs) in
140 let x = C.LetIn (name, vv, y) in
141 HLog.warn "Optimizer: swap 3"; opt1_proof g true c x
142 | v :: vs -> aux h (v :: prev) vs
147 if es then opt1_proof g es c t else g t
149 if es then H.list_map_cps g (fun h -> opt1_term h es c) vs else g vs
151 and opt1_mutcase g es c uri tyno outty arg cases =
152 let eliminator = H.get_default_eliminator c uri tyno outty in
153 let lpsno, (_, _, _, constructors) = H.get_ind_type uri tyno in
154 let ps, sort_disp = H.get_ind_parameters c arg in
155 let lps, rps = HEL.split_nth lpsno ps in
156 let rpsno = List.length rps in
157 let predicate = clear_absts rpsno (1 - sort_disp) outty in
159 I.S.mem tyno (I.get_mutinds_of_uri uri t)
161 let map2 case (_, cty) =
162 let map (h, case, k) (_, premise) =
163 if h > 0 then pred h, case, k else
164 if is_recursive premise then
165 0, add_abst k case, k + 2
169 let premises, _ = PEH.split_with_whd (c, cty) in
170 let _, lifted_case, _ =
171 List.fold_left map (lpsno, case, 1) (List.rev (List.tl premises))
175 let lifted_cases = List.map2 map2 cases constructors in
176 let args = eliminator :: lps @ predicate :: lifted_cases @ rps @ [arg] in
177 let x = H.refine c (C.Appl args) in
178 HLog.warn "Optimizer: remove 3"; opt1_proof g es c x
180 and opt1_cast g es c t w =
181 let g t = HLog.warn "Optimizer: remove 4"; g t in
182 if es then opt1_proof g es c t else g t
184 and opt1_other g es c t = g t
186 and opt1_proof g es c = function
187 | C.LetIn (name, v, t) -> opt1_letin g es c name v t
188 | C.Lambda (name, w, t) -> opt1_lambda g es c name w t
189 | C.Appl (t :: v :: vs) -> opt1_appl g es c t (v :: vs)
190 | C.Appl [t] -> opt1_proof g es c t
191 | C.MutCase (u, n, t, v, ws) -> opt1_mutcase g es c u n t v ws
192 | C.Cast (t, w) -> opt1_cast g es c t w
193 | t -> opt1_other g es c t
195 and opt1_term g es c t =
196 if H.is_proof c t then opt1_proof g es c t else g t
198 (* term preprocessing: optomization 2 ***************************************)
200 let expanded_premise = "EXPANDED"
202 let eta_expand g tys t =
204 let name i = Printf.sprintf "%s%u" expanded_premise i in
205 let lambda i ty t = C.Lambda (C.Name (name i), ty, t) in
206 let arg i = C.Rel (succ i) in
207 let rec aux i f a = function
209 | (_, ty) :: tl -> aux (succ i) (H.compose f (lambda i ty)) (arg i :: a) tl
211 let n = List.length tys in
212 let absts, args = aux 0 H.identity [] tys in
213 let t = match S.lift n t with
214 | C.Appl ts -> C.Appl (ts @ args)
215 | t -> C.Appl (t :: args)
219 let rec opt2_letin g c name v t =
220 let entry = Some (name, C.Def (v, None)) in
222 let g v = g (C.LetIn (name, v, t)) in
225 opt2_proof g (entry :: c) t
227 and opt2_lambda g c name w t =
228 let entry = Some (name, C.Decl w) in
229 let g t = g (C.Lambda (name, w, t)) in
230 opt2_proof g (entry :: c) t
232 and opt2_appl g c t vs =
234 let x = C.Appl (t :: vs) in
235 let vsno = List.length vs in
236 let _, csno = PEH.split_with_whd (c, H.get_type c t) in
238 let tys, _ = PEH.split_with_whd (c, H.get_type c x) in
239 let tys = List.rev (List.tl tys) in
240 let tys, _ = HEL.split_nth (csno - vsno) tys in
241 HLog.warn "Optimizer: eta 1"; eta_expand g tys x
244 H.list_map_cps g (fun h -> opt2_term h c) vs
246 and opt2_other g c t =
247 let tys, csno = PEH.split_with_whd (c, H.get_type c t) in
248 if csno > 0 then begin
249 let tys = List.rev (List.tl tys) in
250 HLog.warn "Optimizer: eta 2"; eta_expand g tys t
253 and opt2_proof g c = function
254 | C.LetIn (name, v, t) -> opt2_letin g c name v t
255 | C.Lambda (name, w, t) -> opt2_lambda g c name w t
256 | C.Appl (t :: vs) -> opt2_appl g c t vs
257 | t -> opt2_other g c t
259 and opt2_term g c t =
260 if H.is_proof c t then opt2_proof g c t else g t
262 (* object preprocessing *****************************************************)
264 let optimize_obj = function
265 | C.Constant (name, Some bo, ty, pars, attrs) ->
266 let bo, ty = H.cic_bc [] bo, H.cic_bc [] ty in
268 Printf.eprintf "Optimized : %s\nPost Nodes: %u\n"
269 (Pp.ppterm bo) (I.count_nodes 0 bo);
270 let _ = H.get_type [] (C.Cast (bo, ty)) in
271 C.Constant (name, Some bo, ty, pars, attrs)
273 Printf.eprintf "BEGIN: %s\nPre Nodes : %u\n"
274 name (I.count_nodes 0 bo);
275 begin try opt1_term g (* (opt2_term g []) *) true [] bo
276 with e -> failwith ("PPP: " ^ Printexc.to_string e) end