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/.
28 module S = CicSubstitution
29 module Rd = CicReduction
30 module TC = CicTypeChecker
31 module DTI = DoubleTypeInference
34 (* helper functions *********************************************************)
38 let comp f g x = f (g x)
41 let ty, _ = TC.type_of_aux' [] c t Un.empty_ugraph in ty
44 match Rd.whd ~delta:true c (get_type c (get_type c t)) with
45 | C.Sort C.Prop -> true
49 let is_not_atomic = function
55 | C.MutConstruct _ -> false
59 let add s v c = Some (s, C.Decl v) :: c in
60 let rec aux whd a n c = function
61 | C.Prod (s, v, t) -> aux false (v :: a) (succ n) (add s v c) t
62 | v when whd -> v :: a, n
63 | v -> aux true a n c (Rd.whd ~delta:true c v)
67 let add g htbl t proof decurry =
68 if proof then C.CicHash.add htbl t decurry;
73 let decurry = C.CicHash.find htbl t in g t true decurry
74 with Not_found -> g t false 0
76 (* term preprocessing *******************************************************)
78 let expanded_premise = "EXPANDED"
80 let defined_premise = "DEFINED"
82 let eta_expand g tys t =
84 let name i = Printf.sprintf "%s%u" expanded_premise i in
85 let lambda i ty t = C.Lambda (C.Name (name i), ty, t) in
86 let arg i = C.Rel (succ i) in
87 let rec aux i f a = function
89 | ty :: tl -> aux (succ i) (comp f (lambda i ty)) (arg i :: a) tl
91 let n = List.length tys in
92 let absts, args = aux 0 identity [] tys in
93 let t = match S.lift n t with
94 | C.Appl ts -> C.Appl (ts @ args)
95 | t -> C.Appl (t :: args)
99 let get_tys c decurry =
100 let rec aux n = function
101 (* | C.Appl (hd :: tl) -> aux (n + List.length tl) hd *)
103 let tys, _ = split c (get_type c t) in
104 let _, tys = HEL.split_nth n (List.rev tys) in
105 let tys, _ = HEL.split_nth decurry tys in
110 let eta_fix c t proof decurry =
111 let rec aux g c = function
112 | C.LetIn (name, v, t) ->
113 let g t = g (C.LetIn (name, v, t)) in
114 let entry = Some (name, C.Def (v, None)) in
116 | t -> eta_expand g (get_tys c decurry t) t
118 if proof && decurry > 0 then aux identity c t else t
120 let rec pp_cast g ht es c t v =
121 if true then pp_proof g ht es c t else find g ht t
123 and pp_lambda g ht es c name v t =
124 let name = if DTI.does_not_occur 1 t then C.Anonymous else name in
125 let entry = Some (name, C.Decl v) in
127 let t = eta_fix (entry :: c) t true decurry in
128 g (C.Lambda (name, v, t)) true 0 in
129 if true then pp_proof g ht es (entry :: c) t else find g ht t
131 and pp_letin g ht es c name v t =
132 let entry = Some (name, C.Def (v, None)) in
134 if DTI.does_not_occur 1 t then g (S.lift (-1) t) true decurry else
135 let g v proof d = match v with
136 | C.LetIn (mame, w, u) when proof ->
137 let x = C.LetIn (mame, w, C.LetIn (name, u, S.lift_from 2 1 t)) in
138 pp_proof g ht false c x
140 let v = eta_fix c v proof d in
141 g (C.LetIn (name, v, t)) true decurry
143 if true then pp_term g ht es c v else find g ht v
145 if true then pp_proof g ht es (entry :: c) t else find g ht t
147 and pp_appl_one g ht es c t v =
151 | t, C.LetIn (mame, w, u) when proof ->
152 let x = C.LetIn (mame, w, C.Appl [S.lift 1 t; u]) in
153 pp_proof g ht false c x
154 | C.LetIn (mame, w, u), v ->
155 let x = C.LetIn (mame, w, C.Appl [u; S.lift 1 v]) in
156 pp_proof g ht false c x
157 | C.Appl ts, v when decurry > 0 ->
158 let v = eta_fix c v proof d in
159 g (C.Appl (List.append ts [v])) true (pred decurry)
160 | t, v when is_not_atomic t ->
161 let mame = C.Name defined_premise in
162 let x = C.LetIn (mame, t, C.Appl [C.Rel 1; S.lift 1 v]) in
163 pp_proof g ht false c x
165 let v = eta_fix c v proof d in
166 g (C.Appl [t; v]) true (pred decurry)
168 if true then pp_term g ht es c v else find g ht v
170 if true then pp_proof g ht es c t else find g ht t
172 and pp_appl g ht es c t = function
173 | [] -> pp_proof g ht es c t
174 | [v] -> pp_appl_one g ht es c t v
176 let x = C.Appl (C.Appl [t; v1] :: v2 :: vs) in
179 and pp_atomic g ht es c t =
180 let _, premsno = split c (get_type c t) in
183 and pp_proof g ht es c t =
184 Printf.eprintf "IN: |- %s\n" (*CicPp.ppcontext c*) (CicPp.ppterm t);
185 let g t proof decurry =
186 Printf.eprintf "OUT: %b %u |- %s\n" proof decurry (CicPp.ppterm t);
189 (* let g t proof decurry = add g ht t proof decurry in *)
191 | C.Cast (t, v) -> pp_cast g ht es c t v
192 | C.Lambda (name, v, t) -> pp_lambda g ht es c name v t
193 | C.LetIn (name, v, t) -> pp_letin g ht es c name v t
194 | C.Appl (t :: vs) -> pp_appl g ht es c t vs
195 | t -> pp_atomic g ht es c t
197 and pp_term g ht es c t =
198 if is_proof c t then pp_proof g ht es c t else g t false 0
200 (* object preprocessing *****************************************************)
202 let pp_obj = function
203 | C.Constant (name, Some bo, ty, pars, attrs) ->
204 let g bo proof decurry =
205 let bo = eta_fix [] bo proof decurry in
206 C.Constant (name, Some bo, ty, pars, attrs)
208 let ht = C.CicHash.create 1 in
209 Printf.eprintf "BEGIN: %s\n" name;
210 begin try pp_term g ht true [] bo
211 with e -> failwith ("PPP: " ^ Printexc.to_string e) end