X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Flambda-delta%2Fbasic_rg%2Fbrg.ml;h=baa83afed3741ca6f94637fec132262d7294a851;hb=89e21dbecca75a5320f50ecb53a39699f8ace8f1;hp=17532c970f32f234a4f5d5654e852a36834b63a4;hpb=41bf338d7e638ebb5d97e525055bff05b1f0f045;p=helm.git

diff --git a/helm/software/lambda-delta/basic_rg/brg.ml b/helm/software/lambda-delta/basic_rg/brg.ml
index 17532c970..baa83afed 100644
--- a/helm/software/lambda-delta/basic_rg/brg.ml
+++ b/helm/software/lambda-delta/basic_rg/brg.ml
@@ -9,61 +9,78 @@
      \ /   This software is distributed as is, NO WARRANTY.              
       V_______________________________________________________________ *)
 
-type uri = NUri.uri
-type id = Aut.id
+(* kernel version: basic, relative, global *)
+(* note          : ufficial basic lambda-delta *) 
 
-type bind = Void         (* exclusion *)
-          | Abst of term (* abstraction *)
-          | Abbr of term (* abbreviation *)
+type uri = Entity.uri
+type id = Entity.id
+type attrs = Entity.attrs
 
-and term = Sort of int              (* hierarchy index *)
-         | LRef of int              (* reverse de Bruijn index *)
-         | GRef of uri              (* reference *)
-         | Cast of term * term      (* type, term *)
-         | Appl of term * term      (* argument, function *)
-         | Bind of id * bind * term (* name, binder, scope *)
+type bind = Void of attrs        (* attrs       *)
+          | Abst of attrs * term (* attrs, type *)
+          | Abbr of attrs * term (* attrs, body *)
 
-type obj = int * uri * bind (* age, uri, binder, contents *)
+and term = Sort of attrs * int         (* attrs, hierarchy index *)
+         | LRef of attrs * int         (* attrs, position index *)
+         | GRef of attrs * uri         (* attrs, reference *)
+         | Cast of attrs * term * term (* attrs, type, term *)
+         | Appl of attrs * term * term (* attrs, argument, function *)
+         | Bind of bind * term         (* binder, scope *)
 
-type item = obj option
+type entity = term Entity.entity (* attrs, uri, binder *)
 
-type context = int * (id * bind) list
+type lenv = Null
+(* Cons: tail, relative local environment, binder *) 
+             | Cons of lenv * lenv option * bind 
 
-type message = (context, term) Log.item list
+(* helpers ******************************************************************)
 
-type hierarchy = int -> int
+let mk_uri root s =
+   String.concat "/" ["ld:"; "brg"; root; s ^ ".ld"]
 
 (* Currified constructors ***************************************************)
 
-let abst w = Abst w
+let abst a w = Abst (a, w)
 
-let abbr v = Abbr v
+let abbr a v = Abbr (a, v)
 
-let cast u t = Cast (u, t)
+let lref a i = LRef (a, i)
 
-let appl u t = Appl (u, t)
+let cast a u t = Cast (a, u, t)
 
-let bind id b t = Bind (id, b, t)
+let appl a u t = Appl (a, u, t)
 
-(* context handling functions ***********************************************)
+let bind b t = Bind (b, t)
 
-let empty_context = 0, []
+let bind_abst a u t = Bind (Abst (a, u), t)
 
-let push f (l, es) id b =
-   let c = succ l, (id, b) :: es in 
-   f c
+let bind_abbr a v t = Bind (Abbr (a, v), t)
 
-let append f (l1, es1) (l2, es2) =
-   f (l2 + l1, List.append es2 es1)
+(* local environment handling functions *************************************)
 
-let map f map (l, es) =
-   let f es = f (l, es) in
-   Cps.list_map f map es
+let empty_lenv = Null
 
-let contents f (l, es) = f l es
+let push f es ?c b =
+   let es = Cons (es, c, b) in f es
 
-let get f (l, es) i =
-   if i < 0 || i >= l then f None else 
-   let result = List.nth es (l - succ i) in
-   f (Some result)
+let get err f es i =
+   let rec aux j = function
+      | Null                            -> err ()
+      | Cons (tl, None, b)   when j = 0 -> f tl b
+      | Cons (_, Some c, b) when j = 0  -> f c b
+      | Cons (tl, _, _)                 -> aux (pred j) tl
+   in
+   aux i es
 
+let rec rev_iter f map = function   
+   | Null                 -> f ()
+   | Cons (tl, None, b)   -> 
+      let f _ = map f tl b in rev_iter f map tl
+   | Cons (tl, Some c, b) -> 
+      let f _ = map f c b in rev_iter f map tl
+
+let rec fold_left f map x = function
+   | Null            -> f x
+   | Cons (tl, _, b) ->
+      let f x = fold_left f map x tl in
+      map f x b