- (* "envl" is a list of triples:
- * <name environment, term environment, pattern id>, where
- * name environment: (string * string) list
- * term environment: (string * Cic.annterm) list *)
-let return_closure success_k =
- (fun term_info terms envl ->
-(* prerr_endline "return_closure"; *)
- match terms with
- | [] ->
- (try
- success_k term_info (List.hd envl)
- with Failure _ -> assert false)
- | _ -> assert false)
-
-let variable_closure names k =
- (fun term_info terms envl ->
-(* prerr_endline "variable_closure"; *)
- match terms with
- | hd :: tl ->
- let envl' =
- List.map2
- (fun arg (name_env, term_env, pid) ->
- let rec aux name_env term_env pid arg term =
- match arg, term with
- Ast.IdentArg name, _ ->
- (name_env, (name, term) :: term_env, pid)
- | Ast.EtaArg (Some name, arg'),
- Cic.ALambda (id, name', ty, body) ->
- aux
- ((name, (string_of_name name', Some (ty, id))) :: name_env)
- term_env pid arg' body
- | Ast.EtaArg (Some name, arg'), _ ->
- let name' = CicNotationUtil.fresh_name () in
- aux ((name, (name', None)) :: name_env)
- term_env pid arg' term
- | Ast.EtaArg (None, arg'), Cic.ALambda (id, name, ty, body) ->
- assert false
- | Ast.EtaArg (None, arg'), _ ->
- assert false
- in
- aux name_env term_env pid arg hd)
- names envl
- in
- k term_info tl envl'
- | _ -> assert false)
-
-let appl_closure ks k =
- (fun term_info terms envl ->
-(* prerr_endline "appl_closure"; *)
- (match terms with
- | Cic.AAppl (_, args) :: tl ->
- (try
- let k' = List.assoc (List.length args) ks in
- k' term_info (args @ tl) envl
- with Not_found -> k term_info terms envl)
- | [] -> assert false
- | _ -> k term_info terms envl))
-
-let uri_of_term t = CicUtil.uri_of_term (Deannotate.deannotate_term t)
-
-let uri_closure ks k =
- (fun term_info terms envl ->
-(* prerr_endline "uri_closure"; *)
- (match terms with
- | [] -> assert false
- | hd :: tl ->
-(* prerr_endline (sprintf "uri_of_term = %s" (uri_of_term hd)); *)
- begin
- try
- let k' = List.assoc (uri_of_term hd) ks in
- k' term_info tl envl
- with
- | Invalid_argument _ (* raised by uri_of_term *)
- | Not_found -> k term_info terms envl
- end))
-
- (* compiler from level 3 to level 2 *)
-let compiler32 (t: Patterns32.t) success_k fail_k =
- let rec aux t k = (* k is a continuation *)
- if t = [] then
- k
- else if Patterns32.are_empty t then begin
- (match t with
- | _::_::_ ->
- (* XXX optimization possible here: throw away all except one of the
- * rules which lead to ambiguity *)
- warning "ambiguous interpretation"
- | _ -> ());
- return_closure success_k
- end else
- match Patterns32.horizontal_split t with
- | t', [] ->
- (match t' with
- | []
- | ([], _) :: _ -> assert false
- | (Ast.ArgPattern (Ast.IdentArg _) :: _, _) :: _
- | (Ast.ArgPattern (Ast.EtaArg _) :: _, _) :: _ ->
- let first_column, t'' = Patterns32.vertical_split t' in
- let names =
- List.map
- (function
- | Ast.ArgPattern arg -> arg
- | _ -> assert false)
- first_column
- in
- variable_closure names (aux t'' k)
- | (Ast.ApplPattern _ :: _, _) :: _ ->
- let pidl =
- List.map
- (function
- | (Ast.ApplPattern args) :: _, _ -> List.length args
- | _ -> assert false)
- t'
- in
- (* arity partitioning *)
- let clusters = Patterns32.partition t' pidl in
- let ks = (* k continuation list *)
- List.map
- (fun (len, cluster) ->
- let cluster' =
- List.map (* add args as patterns heads *)
- (function
- | (Ast.ApplPattern args) :: tl, pid ->
- (* let's throw away "teste di cluster" *)
- args @ tl, pid
- | _ -> assert false)
- cluster
- in
- len, aux cluster' k)
- clusters
- in
- appl_closure ks k
- | (Ast.UriPattern _ :: _, _) :: _ ->
- let uidmap, pidl =
- let urimap = ref [] in
- let uidmap = ref [] in
- let get_uri_id uri =
- try
- List.assoc uri !urimap
- with
- Not_found ->
- let uid = List.length !urimap in
- urimap := (uri, uid) :: !urimap ;
- uidmap := (uid, uri) :: !uidmap ;
- uid
- in
- let uidl =
- List.map
- (function
- | (Ast.UriPattern uri) :: _, _ -> get_uri_id uri
- | _ -> assert false)
- t'
- in
- !uidmap, uidl
- in
- let clusters = Patterns32.partition t' pidl in
- let ks =
- List.map
- (fun (uid, cluster) ->
- let cluster' =
- List.map
- (function
- | (Ast.UriPattern uri) :: tl, pid -> tl, pid
- | _ -> assert false)
- cluster
- in
- List.assoc uid uidmap, aux cluster' k)
- clusters
- in
- uri_closure ks k)
- | t', tl -> aux t' (aux tl k)
- in
- let matcher = aux t (fun _ _ -> raise No_match) in
- (fun term_info annterm ->
- try
- matcher term_info [annterm] (List.map (fun (_, pid) -> [], [], pid) t)
- with No_match -> fail_k term_info annterm)
-
-let return_closure21 success_k =
- (fun terms envl ->
- prerr_endline "return_closure21";
- match terms with
- | [] ->
- (try
- success_k (List.hd envl)
- with Failure _ -> assert false)
- | _ -> assert false)
-
-let variable_closure21 vars k =
- (fun terms envl ->
- prerr_endline "variable_closure21";
- match terms with
- | hd :: tl ->
- let envl' =
- List.map2
- (fun (name, ty) (env, pid) ->
- (name, (ty, CicNotationEnv.value_of_term hd)) :: env, pid)
- vars envl
- in
- k tl envl'
- | _ -> assert false)
-
-let constructor_closure21 ks k =
- (fun terms envl ->
- prerr_endline "constructor_closure21";
- (match terms with
- | p :: tl ->
- prerr_endline (sprintf "on term %s" (CicNotationPp.pp_term p));
- (try
- let tag, subterms = CicNotationTag.get_tag p in
- let k' = List.assoc tag ks in
- k' (subterms @ tl) envl
- with Not_found -> k terms envl)
- | [] -> assert false))
-
-let compiler21 (t: Patterns21.t) success_k fail_k =
- let rec aux t k =
- if t = [] then
- k
- else if Patterns21.are_empty t then begin
- (match t with
- | _::_::_ ->
- (* XXX optimization possible here: throw away all except one of the
- * rules which lead to ambiguity *)
- warning "ambiguous notation"
- | _ -> ());
- return_closure21 success_k
- end else
- match Patterns21.horizontal_split t with
- | t', [] ->
- (match t' with
- | []
- | ([], _) :: _ -> assert false
- | (Ast.Variable _ :: _, _) :: _ ->
- let first_column, t'' = Patterns21.vertical_split t' in
- let vars =
- List.map
- (function
- | Ast.Variable v -> CicNotationEnv.declaration_of_var v
- | _ -> assert false)
- first_column
- in
- variable_closure21 vars (aux t'' k)
- | _ ->
- let pidl =
- List.map
- (function
- | p :: _, _ -> fst (CicNotationTag.get_tag p)
- | [], _ -> assert false)
- t'
- in
- let clusters = Patterns21.partition t' pidl in
- let ks =
- List.map
- (fun (pid, cluster) ->
- let cluster' =
- List.map (* add args as patterns heads *)
- (function
- | p :: tl, pid ->
- let _, subpatterns = CicNotationTag.get_tag p in
- subpatterns @ tl, pid
- | _ -> assert false)
- cluster
- in
- pid, aux cluster' k)
- clusters
- in
- constructor_closure21 ks k)
- | t', tl -> aux t' (aux tl k)
- in
- let matcher = aux t (fun _ _ -> raise No_match) in
- (fun ast ->
- try
- matcher [ast] (List.map (fun (_, pid) -> [], pid) t)
- with No_match -> fail_k ast)
-
-let ast_of_acic1 term_info annterm = (get_compiled32 ()) term_info annterm
-
-let pp_ast1 term = (get_compiled21 ()) term
-
-let instantiate21 env pid =
- prerr_endline "instantiate21";
- let precedence, associativity, l1 =
- try
- Hashtbl.find level1_patterns21 pid
- with Not_found -> assert false
- in
- let rec subst = function
- | Ast.AttributedTerm (_, t) -> subst t