1 (* Copyright (C) 2004-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://helm.cs.unibo.it/
30 module Ast = CicNotationPt
31 module Env = CicNotationEnv
34 let debug_print s = if debug then prerr_endline (Lazy.force s) else ()
37 type pretty_printer_id = pattern_id
39 let resolve_binder = function
40 | `Lambda -> "\\lambda"
42 | `Forall -> "\\forall"
43 | `Exists -> "\\exists"
45 let add_level_info prec t = Ast.AttributedTerm (`Level prec, t)
47 let rec top_pos t = add_level_info ~-1 t
49 let rec remove_level_info =
51 | Ast.AttributedTerm (`Level _, t) -> remove_level_info t
52 | Ast.AttributedTerm (a, t) -> Ast.AttributedTerm (a, remove_level_info t)
55 let add_xml_attrs attrs t =
56 if attrs = [] then t else Ast.AttributedTerm (`XmlAttrs attrs, t)
58 let add_keyword_attrs =
59 add_xml_attrs (RenderingAttrs.keyword_attributes `MathML)
61 let box kind spacing indent content =
62 Ast.Layout (Ast.Box ((kind, spacing, indent), content))
66 let hvbox = box Ast.HV
67 let hovbox = box Ast.HOV
68 let break = Ast.Layout Ast.Break
69 let space = Ast.Literal (`Symbol " ")
70 let builtin_symbol s = Ast.Literal (`Symbol s)
71 let keyword k = add_keyword_attrs (Ast.Literal (`Keyword k))
74 add_xml_attrs (RenderingAttrs.number_attributes `MathML)
75 (Ast.Literal (`Number s))
78 add_xml_attrs (RenderingAttrs.ident_attributes `MathML) (Ast.Ident (i, None))
80 let ident_w_href href i =
84 let href = UriManager.string_of_uri href in
85 add_xml_attrs [Some "xlink", "href", href] (ident i)
88 add_xml_attrs (RenderingAttrs.builtin_symbol_attributes `MathML)
91 let string_of_sort_kind = function
96 | `NType s -> "Type[" ^ s ^ "]"
97 | `NCProp s -> "CProp[" ^ s ^ "]"
101 ~sep:[space] (List.map (fun x -> [f x]) l)
108 let rec aux_args level =
112 [ Ast.AttributedTerm (`Level level,k last) ]
114 (Ast.AttributedTerm (`Level level, k hd)) :: aux_args 71 tl
116 add_level_info Ast.apply_prec
117 (hovbox true true (CicNotationUtil.dress break (aux_args 70 ts)))
118 | Ast.Binder (binder_kind, (id, ty), body) ->
119 add_level_info Ast.binder_prec
121 [ binder_symbol (resolve_binder binder_kind);
122 k id; builtin_symbol ":"; aux_ty ty; break;
123 builtin_symbol "."; k body ])
124 | Ast.Case (what, indty_opt, outty_opt, patterns) ->
129 [ space; keyword "return"; space; break; remove_level_info (k outty)]
134 | Some (indty, href) -> [ space; keyword "in"; space; break; ident_w_href href indty ]
139 hvbox false true [keyword "match"; space; break; top_pos (k what)];
141 hvbox false true indty_box;
143 hvbox false true outty_box
151 let mk_case_pattern =
153 Ast.Pattern (head, href, vars) ->
154 hvbox true true (ident_w_href href head ::
155 List.flatten (List.map (fun x -> [break;x]) (map_space aux_var vars)))
156 | Ast.Wildcard -> builtin_symbol "_"
163 mk_case_pattern lhs; break; builtin_symbol "\\Rightarrow";
164 break; top_pos (k rhs) ]))
168 let rec aux_patterns = function
174 last; builtin_symbol "]" ] ]
176 [ break; hbox false false [ builtin_symbol "|"; hd ] ]
181 [ hbox false false [ builtin_symbol "["; builtin_symbol "]" ] ]
184 builtin_symbol "["; one; builtin_symbol "]" ] ]
186 hbox false false [ builtin_symbol "["; hd ]
189 add_level_info Ast.simple_prec
191 hvbox false false ([match_box]); break;
192 hbox false false [ hvbox false false patterns'' ] ])
193 | Ast.Cast (bo, ty) ->
194 add_level_info Ast.simple_prec
196 builtin_symbol "("; top_pos (k bo); break; builtin_symbol ":";
197 top_pos (k ty); builtin_symbol ")"])
198 | Ast.LetIn (var, s, t) ->
199 add_level_info Ast.let_in_prec
202 keyword "let"; space;
205 builtin_symbol "\\def"; break; top_pos (k s) ];
206 break; space; keyword "in"; space ];
209 | Ast.LetRec (rec_kind, funs, where) ->
211 match rec_kind with `Inductive -> "rec" | `CoInductive -> "corec"
213 let mk_fun (args, (name,ty), body, rec_param) =
214 List.flatten (List.map (fun x -> [aux_var x; space]) args),
215 k name, HExtlib.map_option k ty, k body, fst (List.nth args rec_param)
217 let mk_funs = List.map mk_fun in
218 let fst_fun, tl_funs =
219 match mk_funs funs with hd :: tl -> hd, tl | [] -> assert false
222 let (params, name, ty, body, rec_param) = fst_fun in
231 [keyword "on" ; space ; rec_param ;space ] @
232 (match ty with None -> [] | Some ty -> [builtin_symbol ":"; ty]) @
233 [ builtin_symbol "\\def";
239 (fun (params, name, ty, body, rec_param) ->
242 keyword "and"; space;
245 [space; keyword "on" ; space; rec_param ;space ] @
248 | Some ty -> [builtin_symbol ":"; ty]) @
249 [ builtin_symbol "\\def"; break; body ])])
252 add_level_info Ast.let_in_prec
254 (fst_row :: List.flatten tl_rows
255 @ [ break; keyword "in"; break; k where ])))
256 | Ast.Implicit `JustOne -> builtin_symbol "?"
257 | Ast.Implicit `Vector -> builtin_symbol "…"
259 let local_context l =
260 List.map (function None -> None | Some t -> Some (k t)) l
262 Ast.Meta(n, local_context l)
263 | Ast.Sort sort -> aux_sort sort
266 | Ast.Ident (_, None) | Ast.Ident (_, Some [])
267 | Ast.Uri (_, None) | Ast.Uri (_, Some [])
269 | Ast.UserInput as leaf -> leaf
270 | t -> CicNotationUtil.visit_ast ~special_k k t
271 and aux_sort sort_kind =
272 add_xml_attrs (RenderingAttrs.keyword_attributes `MathML)
273 (Ast.Ident (string_of_sort_kind sort_kind, None))
274 and aux_ty = function
275 | None -> builtin_symbol "?"
277 and aux_var = function
280 builtin_symbol "("; name; builtin_symbol ":"; break; k ty;
283 and special_k = function
284 | Ast.AttributedTerm (attrs, t) -> Ast.AttributedTerm (attrs, k t)
286 prerr_endline ("unexpected special: " ^ CicNotationPp.pp_term t);
291 (* persistent state *)
293 let initial_level1_patterns21 () = Hashtbl.create 211
294 let level1_patterns21 = ref (initial_level1_patterns21 ())
295 let compiled21 = ref None
296 let pattern21_matrix = ref []
297 let counter = ref ~-1
302 stack := (!counter,!level1_patterns21,!compiled21,!pattern21_matrix)::!stack;
304 level1_patterns21 := initial_level1_patterns21 ();
306 pattern21_matrix := []
312 | (ocounter,olevel1_patterns21,ocompiled21,opatterns21_matrix)::old ->
315 level1_patterns21 := olevel1_patterns21;
316 compiled21 := ocompiled21;
317 pattern21_matrix := opatterns21_matrix
320 let get_compiled21 () =
321 match !compiled21 with
322 | None -> assert false
323 | Some f -> Lazy.force f
325 let set_compiled21 f = compiled21 := Some f
328 List.fold_right (fun idref t -> Ast.AttributedTerm (`IdRef idref, t))
330 let instantiate21 idrefs env l1 =
331 let rec subst_singleton pos env =
333 Ast.AttributedTerm (attr, t) ->
334 Ast.AttributedTerm (attr, subst_singleton pos env t)
335 | t -> CicNotationUtil.group (subst pos env t)
336 and subst pos env = function
337 | Ast.AttributedTerm (attr, t) ->
338 (* prerr_endline ("loosing attribute " ^ CicNotationPp.pp_attribute attr); *)
340 | Ast.Variable var ->
341 let name, expected_ty = CicNotationEnv.declaration_of_var var in
346 prerr_endline ("name " ^ name ^ " not found in environment");
349 assert (CicNotationEnv.well_typed ty value); (* INVARIANT *)
350 (* following assertion should be a conditional that makes this
351 * instantiation fail *)
352 if not (CicNotationEnv.well_typed expected_ty value) then
354 prerr_endline ("The variable " ^ name ^ " is used with the wrong type in the notation declaration");
357 let value = CicNotationEnv.term_of_value value in
359 match expected_ty with
360 | Env.TermType l -> Ast.AttributedTerm (`Level l,value)
364 | Ast.Magic m -> subst_magic pos env m
365 | Ast.Literal l as t ->
366 let t = add_idrefs idrefs t in
368 | `Keyword k -> [ add_keyword_attrs t ]
370 | Ast.Layout l -> [ Ast.Layout (subst_layout pos env l) ]
371 | t -> [ CicNotationUtil.visit_ast (subst_singleton pos env) t ]
372 and subst_magic pos env = function
373 | Ast.List0 (p, sep_opt)
374 | Ast.List1 (p, sep_opt) ->
375 let rec_decls = CicNotationEnv.declarations_of_term p in
377 List.map (fun (n, _) -> CicNotationEnv.lookup_list env n) rec_decls
379 let values = CicNotationUtil.ncombine rec_values in
383 | Some l -> [ Ast.Literal l; break; space ]
385 let rec instantiate_list acc = function
388 let env = CicNotationEnv.combine rec_decls value_set in
389 instantiate_list (CicNotationUtil.group (subst pos env p) :: acc)
392 let env = CicNotationEnv.combine rec_decls value_set in
393 let terms = subst pos env p in
394 instantiate_list (CicNotationUtil.group (terms @ sep) :: acc) tl
396 if values = [] then []
397 else [hovbox false false (instantiate_list [] values)]
399 let opt_decls = CicNotationEnv.declarations_of_term p in
401 let rec build_env = function
403 | (name, ty) :: tl ->
404 (* assumption: if one of the value is None then all are *)
405 (match CicNotationEnv.lookup_opt env name with
407 | Some v -> (name, (ty, v)) :: build_env tl)
409 try build_env opt_decls with Exit -> []
414 | _ -> subst pos env p
416 | _ -> assert false (* impossible *)
417 and subst_layout pos env = function
418 | Ast.Box (kind, tl) ->
419 let tl' = subst_children pos env tl in
420 Ast.Box (kind, List.concat tl')
421 | l -> CicNotationUtil.visit_layout (subst_singleton pos env) l
422 and subst_children pos env =
430 (* | `None -> assert false *)
433 [ subst pos' env child ]
439 (* | `None -> assert false *)
442 (subst pos env hd) :: subst_children pos' env tl
444 subst_singleton `Left env l1
446 let rec pp_ast1 term =
447 let rec pp_value = function
448 | CicNotationEnv.NumValue _ as v -> v
449 | CicNotationEnv.StringValue _ as v -> v
450 (* | CicNotationEnv.TermValue t when t == term -> CicNotationEnv.TermValue (pp_ast0 t pp_ast1) *)
451 | CicNotationEnv.TermValue t -> CicNotationEnv.TermValue (pp_ast1 t)
452 | CicNotationEnv.OptValue None as v -> v
453 | CicNotationEnv.OptValue (Some v) ->
454 CicNotationEnv.OptValue (Some (pp_value v))
455 | CicNotationEnv.ListValue vl ->
456 CicNotationEnv.ListValue (List.map pp_value vl)
458 let ast_env_of_env env =
459 List.map (fun (var, (ty, value)) -> (var, (ty, pp_value value))) env
461 (* prerr_endline ("pattern matching from 2 to 1 on term " ^ CicNotationPp.pp_term term); *)
463 | Ast.AttributedTerm (attrs, term') ->
464 Ast.AttributedTerm (attrs, pp_ast1 term')
466 (match (get_compiled21 ()) term with
467 | None -> pp_ast0 term pp_ast1
468 | Some (env, ctors, pid) ->
470 List.flatten (List.map CicNotationUtil.get_idrefs ctors)
474 Hashtbl.find !level1_patterns21 pid
475 with Not_found -> assert false
477 instantiate21 idrefs (ast_env_of_env env) l1)
479 let load_patterns21 t =
480 set_compiled21 (lazy (Content2presMatcher.Matcher21.compiler t))
483 debug_print (lazy "pp_ast <-");
484 let ast' = pp_ast1 ast in
485 debug_print (lazy ("pp_ast -> " ^ CicNotationPp.pp_term ast'));
488 exception Pretty_printer_not_found
490 let fill_pos_info l1_pattern = l1_pattern
491 (* let rec aux toplevel pos =
498 | Ast.Variable _ as t -> add_pos_info pos t
501 aux true l1_pattern *)
508 let add_pretty_printer l2 (CicNotationParser.CL1P (l1,precedence)) =
509 let id = fresh_id () in
510 let l1' = add_level_info precedence (fill_pos_info l1) in
511 let l2' = CicNotationUtil.strip_attributes l2 in
512 Hashtbl.add !level1_patterns21 id l1';
513 pattern21_matrix := (l2', id) :: !pattern21_matrix;
514 load_patterns21 !pattern21_matrix;
517 let remove_pretty_printer id =
519 Hashtbl.remove !level1_patterns21 id;
520 with Not_found -> raise Pretty_printer_not_found);
521 pattern21_matrix := List.filter (fun (_, id') -> id <> id') !pattern21_matrix;
522 load_patterns21 !pattern21_matrix
524 (* presentation -> content *)
526 let unopt_names names env =
527 let rec aux acc = function
528 | (name, (ty, v)) :: tl when List.mem name names ->
530 | Env.OptType ty, Env.OptValue (Some v) ->
531 aux ((name, (ty, v)) :: acc) tl
533 | hd :: tl -> aux (hd :: acc) tl
538 let head_names names env =
539 let rec aux acc = function
540 | (name, (ty, v)) :: tl when List.mem name names ->
542 | Env.ListType ty, Env.ListValue (v :: _) ->
543 aux ((name, (ty, v)) :: acc) tl
544 | Env.TermType _, Env.TermValue _ ->
545 aux ((name, (ty, v)) :: acc) tl
546 | Env.OptType _, Env.OptValue _ ->
547 aux ((name, (ty, v)) :: acc) tl
549 | _ :: tl -> aux acc tl
550 (* base pattern may contain only meta names, thus we trash all others *)
555 let tail_names names env =
556 let rec aux acc = function
557 | (name, (ty, v)) :: tl when List.mem name names ->
559 | Env.ListType ty, Env.ListValue (_ :: vtl) ->
560 aux ((name, (Env.ListType ty, Env.ListValue vtl)) :: acc) tl
561 | Env.TermType _, Env.TermValue _ ->
562 aux ((name, (ty, v)) :: acc) tl
563 | Env.OptType _, Env.OptValue _ ->
564 aux ((name, (ty, v)) :: acc) tl
566 | binding :: tl -> aux (binding :: acc) tl
571 let instantiate_level2 env term =
572 (* prerr_endline ("istanzio: " ^ CicNotationPp.pp_term term); *)
573 let fresh_env = ref [] in
574 let lookup_fresh_name n =
576 List.assoc n !fresh_env
578 let new_name = CicNotationUtil.fresh_name () in
579 fresh_env := (n, new_name) :: !fresh_env;
582 let rec aux env term =
583 (* prerr_endline ("ENV " ^ CicNotationPp.pp_env env); *)
585 | Ast.AttributedTerm (a, term) -> (*Ast.AttributedTerm (a, *)aux env term
586 | Ast.Appl terms -> Ast.Appl (List.map (aux env) terms)
587 | Ast.Binder (binder, var, body) ->
588 Ast.Binder (binder, aux_capture_var env var, aux env body)
589 | Ast.Case (term, indty, outty_opt, patterns) ->
590 Ast.Case (aux env term, indty, aux_opt env outty_opt,
591 List.map (aux_branch env) patterns)
592 | Ast.LetIn (var, t1, t3) ->
593 Ast.LetIn (aux_capture_var env var, aux env t1, aux env t3)
594 | Ast.LetRec (kind, definitions, body) ->
595 Ast.LetRec (kind, List.map (aux_definition env) definitions,
597 | Ast.Uri (name, None) -> Ast.Uri (name, None)
598 | Ast.Uri (name, Some substs) ->
599 Ast.Uri (name, Some (aux_substs env substs))
600 | Ast.Ident (name, Some substs) ->
601 Ast.Ident (name, Some (aux_substs env substs))
602 | Ast.Meta (index, substs) -> Ast.Meta (index, aux_meta_substs env substs)
609 | Ast.UserInput -> term
611 | Ast.Magic magic -> aux_magic env magic
612 | Ast.Variable var -> aux_variable env var
614 | Ast.Cast (t, ty) -> Ast.Cast (aux env t, aux env ty)
617 and aux_opt env = function
618 | Some term -> Some (aux env term)
620 and aux_capture_var env (name, ty_opt) = (aux env name, aux_opt env ty_opt)
621 and aux_branch env (pattern, term) =
622 (aux_pattern env pattern, aux env term)
623 and aux_pattern env =
625 Ast.Pattern (head, hrefs, vars) ->
626 Ast.Pattern (head, hrefs, List.map (aux_capture_var env) vars)
627 | Ast.Wildcard -> Ast.Wildcard
628 and aux_definition env (params, var, term, i) =
629 (List.map (aux_capture_var env) params, aux_capture_var env var, aux env term, i)
630 and aux_substs env substs =
631 List.map (fun (name, term) -> (name, aux env term)) substs
632 and aux_meta_substs env meta_substs = List.map (aux_opt env) meta_substs
633 and aux_variable env = function
634 | Ast.NumVar name -> Ast.Num (Env.lookup_num env name, 0)
635 | Ast.IdentVar name -> Ast.Ident (Env.lookup_string env name, None)
636 | Ast.TermVar (name,(Ast.Level l|Ast.Self l)) ->
637 Ast.AttributedTerm (`Level l,Env.lookup_term env name)
638 | Ast.FreshVar name -> Ast.Ident (lookup_fresh_name name, None)
639 | Ast.Ascription (term, name) -> assert false
640 and aux_magic env = function
641 | Ast.Default (some_pattern, none_pattern) ->
642 let some_pattern_names = CicNotationUtil.names_of_term some_pattern in
643 let none_pattern_names = CicNotationUtil.names_of_term none_pattern in
646 (fun name -> not (List.mem name none_pattern_names))
649 (match opt_names with
650 | [] -> assert false (* some pattern must contain at least 1 name *)
651 | (name :: _) as names ->
652 (match Env.lookup_value env name with
653 | Env.OptValue (Some _) ->
654 (* assumption: if "name" above is bound to Some _, then all
655 * names returned by "meta_names_of" are bound to Some _ as well
657 aux (unopt_names names env) some_pattern
658 | Env.OptValue None -> aux env none_pattern
660 prerr_endline (sprintf
661 "lookup of %s in env %s did not return an optional value"
662 name (CicNotationPp.pp_env env));
664 | Ast.Fold (`Left, base_pattern, names, rec_pattern) ->
665 let acc_name = List.hd names in (* names can't be empty, cfr. parser *)
667 List.filter ((<>) acc_name)
668 (CicNotationUtil.names_of_term rec_pattern)
670 (match meta_names with
671 | [] -> assert false (* as above *)
672 | (name :: _) as names ->
673 let rec instantiate_fold_left acc env' =
674 match Env.lookup_value env' name with
675 | Env.ListValue (_ :: _) ->
676 instantiate_fold_left
678 acc_name, (Env.TermType 0, Env.TermValue acc)
680 aux (acc_binding :: head_names names env') rec_pattern)
681 (tail_names names env')
682 | Env.ListValue [] -> acc
685 instantiate_fold_left (aux env base_pattern) env)
686 | Ast.Fold (`Right, base_pattern, names, rec_pattern) ->
687 let acc_name = List.hd names in (* names can't be empty, cfr. parser *)
689 List.filter ((<>) acc_name)
690 (CicNotationUtil.names_of_term rec_pattern)
692 (match meta_names with
693 | [] -> assert false (* as above *)
694 | (name :: _) as names ->
695 let rec instantiate_fold_right env' =
696 match Env.lookup_value env' name with
697 | Env.ListValue (_ :: _) ->
698 let acc = instantiate_fold_right (tail_names names env') in
700 acc_name, (Env.TermType 0, Env.TermValue acc)
702 aux (acc_binding :: head_names names env') rec_pattern
703 | Env.ListValue [] -> aux env base_pattern
706 instantiate_fold_right env)
707 | Ast.If (_, p_true, p_false) as t ->
708 aux env (CicNotationUtil.find_branch (Ast.Magic t))
709 | Ast.Fail -> assert false
716 let _ = load_patterns21 []