X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fcomponents%2Fng_kernel%2FnCicUtils.ml;h=a99ae0407f638b65e2932239b6bafac51f13bc2e;hb=5d0d8107649b9264ebe7d8ff2c69bf777179b0d2;hp=965f1cf2b495dd163f9593b4948958d70e1dcb13;hpb=0ec61cd3d3fe2bf43b75fc94800af0c23cfa8c3b;p=helm.git

diff --git a/helm/software/components/ng_kernel/nCicUtils.ml b/helm/software/components/ng_kernel/nCicUtils.ml
index 965f1cf2b..a99ae0407 100644
--- a/helm/software/components/ng_kernel/nCicUtils.ml
+++ b/helm/software/components/ng_kernel/nCicUtils.ml
@@ -1,44 +1,93 @@
-(* Copyright (C) 2000, HELM Team.
- * 
- * This file is part of HELM, an Hypertextual, Electronic
- * Library of Mathematics, developed at the Computer Science
- * Department, University of Bologna, Italy.
- * 
- * HELM is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
- * 
- * HELM is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with HELM; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
- * MA  02111-1307, USA.
- * 
- * For details, see the HELM World-Wide-Web page,
- * http://cs.unibo.it/helm/.
- *)
-
-(* $Id: nCicSubstitution.ml 8135 2008-02-13 15:35:43Z tassi $ *)
+(*
+    ||M||  This file is part of HELM, an Hypertextual, Electronic        
+    ||A||  Library of Mathematics, developed at the Computer Science     
+    ||T||  Department, University of Bologna, Italy.                     
+    ||I||                                                                
+    ||T||  HELM is free software; you can redistribute it and/or         
+    ||A||  modify it under the terms of the GNU General Public License   
+    \   /  version 2 or (at your option) any later version.      
+     \ /   This software is distributed as is, NO WARRANTY.     
+      V_______________________________________________________________ *)
+
+(* $Id$ *)
+
+module C = NCic
+module Ref = NReference
+
+exception Subst_not_found of int
+exception Meta_not_found of int
+
+let head_beta_reduce = ref (fun ~upto:_ _ -> assert false);;
+let set_head_beta_reduce = (:=) head_beta_reduce;;
 
 let expand_local_context = function
-  | NCic.Irl len -> 
+  | C.Irl len -> 
       let rec aux acc = function 
         | 0 -> acc
-        | n -> aux (NCic.Rel n::acc) (n-1)
+        | n -> aux (C.Rel n::acc) (n-1)
       in
        aux [] len
-  | NCic.Ctx lctx -> lctx
+  | C.Ctx lctx -> lctx
 ;;
 
-exception Subst_not_found of int
-
 let lookup_subst n subst =
   try
     List.assoc n subst
   with Not_found -> raise (Subst_not_found n)
+;;
+
+let lookup_meta n metasenv =
+  try
+    List.assoc n metasenv
+  with Not_found -> raise (Meta_not_found n)
+;;
 
+let fold g k f acc = function
+ | C.Meta _ -> assert false
+ | C.Implicit _
+ | C.Sort _
+ | C.Const _
+ | C.Rel _ -> acc
+ | C.Appl [] | C.Appl [_] -> assert false
+ | C.Appl l -> List.fold_left (f k) acc l
+ | C.Prod (n,s,t)
+ | C.Lambda (n,s,t) -> f (g (n,C.Decl s) k) (f k acc s) t
+ | C.LetIn (n,ty,t,bo) -> f (g (n,C.Def (t,ty)) k) (f k (f k acc ty) t) bo
+ | C.Match (_,oty,t,pl) -> List.fold_left (f k) (f k (f k acc oty) t) pl
+;;
+
+let map g k f = function
+ | C.Meta _ -> assert false
+ | C.Implicit _
+ | C.Sort _
+ | C.Const _
+ | C.Rel _ as t -> t
+ | C.Appl [] | C.Appl [_] -> assert false
+ | C.Appl l as orig ->
+    let fire_beta, upto = 
+      match l with C.Meta _ :: _ -> true, List.length l - 1 | _ -> false, 0 
+    in
+    let l1 = HExtlib.sharing_map (f k) l in
+    if l == l1 then orig else
+    let t =
+      match l1 with
+      | C.Appl l :: tl -> C.Appl (l@tl)
+      | l1 -> C.Appl l1
+    in
+      if fire_beta then !head_beta_reduce ~upto t
+      else t
+ | C.Prod (n,s,t) as orig ->
+     let s1 = f k s in let t1 = f (g (n,C.Decl s) k) t in
+     if t1 == t && s1 == s then orig else C.Prod (n,s1,t1)
+ | C.Lambda (n,s,t) as orig -> 
+     let s1 = f k s in let t1 = f (g (n,C.Decl s) k) t in
+     if t1 == t && s1 == s then orig else C.Lambda (n,s1,t1)
+ | C.LetIn (n,ty,t,b) as orig -> 
+     let ty1 = f k ty in let t1 = f k t in
+     let b1 = f (g (n,C.Def (t,ty)) k) b in
+     if ty1 == ty && t1 == t && b1 == b then orig else C.LetIn (n,ty1,t1,b1)
+ | C.Match (r,oty,t,pl) as orig -> 
+     let oty1 = f k oty in let t1 = f k t in let pl1 = HExtlib.sharing_map (f k) pl in
+     if oty1 == oty && t1 == t && pl1 == pl then orig 
+     else C.Match(r,oty1,t1,pl1)
+;;