X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Flambda-delta%2Flib%2Fcps.ml;h=10ec62376b6d84a19e0fe5074f8a15bb8cb9fc08;hb=4efe53bc2098939c255d5b03941212549f89a1bd;hp=199a786cdd1c1ae1b9b770cda229d611c491091d;hpb=973b0b1fd5f44b96a3c367a9756f28b75b9fa30b;p=helm.git

diff --git a/helm/software/lambda-delta/lib/cps.ml b/helm/software/lambda-delta/lib/cps.ml
index 199a786cd..10ec62376 100644
--- a/helm/software/lambda-delta/lib/cps.ml
+++ b/helm/software/lambda-delta/lib/cps.ml
@@ -1,47 +1,47 @@
-(* 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/.
- *)
-
-let id x = x
+(*
+    ||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_______________________________________________________________ *)
+
+let err _ = assert false
+
+let start x = x
+
+let id f x = f x
 
 let rec list_sub_strict f l1 l2 = match l1, l2 with
    | _, []              -> f l1
    | _ :: tl1, _ :: tl2 -> list_sub_strict f tl1 tl2
    | _                  -> assert false
 
+(* this is not tail recursive *)
 let rec list_fold_left f map a = function
    | []       -> f a
    | hd :: tl -> 
       let f a = list_fold_left f map a tl in
       map f a hd
 
+(* this is not tail recursive *)
 let rec list_rev_map_append f map ~tail = function
       | []       -> f tail        
       | hd :: tl ->
          let f hd = list_rev_map_append f map ~tail:(hd :: tail) tl in
          map f hd
 
+(* this is not tail recursive *)
+let rec list_forall2 f map l1 l2 = match l1, l2 with
+   | [], []                 -> f true
+   | hd1 :: tl1, hd2 :: tl2 ->
+      let f b = if b then list_forall2 f map tl1 tl2 else f false in
+      map f hd1 hd2
+   | _                      -> f false
+
 let list_rev_append f =
    list_rev_map_append f (fun f t -> f t)
 
@@ -51,6 +51,33 @@ let list_rev_map =
 let list_rev =
    list_rev_append ~tail:[]
 
-let list_map f =
-   list_rev_map (list_rev f)
-   
+let list_iter f map l =
+   let map f () x = map f x in
+   list_fold_left f map () l
+
+(* this is not tail recursive *)
+let rec list_fold_left2 f map a l1 l2 = match l1, l2 with
+   | [], []                 -> f a
+   | hd1 :: tl1, hd2 :: tl2 -> 
+      let f a = list_fold_left2 f map a tl1 tl2 in
+      map f a hd1 hd2
+   | _                      -> assert false
+
+let list_iter2 f map l1 l2 =
+   let map f () x1 x2 = map f x1 x2 in
+   list_fold_left2 f map () l1 l2
+
+let rec list_fold_right f map l a = match l with
+   | []       -> f a
+   | hd :: tl -> list_fold_right (map f hd) map tl a
+
+let list_map f map l =
+   let map f hd a = 
+      let f hd = f (hd :: a) in map f hd
+   in
+   list_fold_right f map l []
+
+let rec list_mem ?(eq=(=)) a = function
+   | []                   -> false
+   | hd :: _ when eq a hd -> true
+   | _ :: tl              -> list_mem ~eq a tl