2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
12 (* $Id: terms.mli 9822 2009-06-03 15:37:06Z tassi $ *)
14 let eqPref = ref (fun _ -> assert false);;
15 let set_eqP t = eqPref := fun _ -> t;;
18 let uri = NUri.uri_of_string "cic:/matita/ng/Plogic/equality/peq.ind" in
19 let ref = NReference.reference_of_spec uri (NReference.Ind(true,0,2)) in
22 let set_default_eqP() = eqPref := default_eqP
24 let set_reference_of_oxuri f =
27 let r = f(UriManager.uri_of_string
28 "cic:/matita/logic/equality/eq.ind#xpointer(1/1)")
36 module type NCicContext =
38 val metasenv : NCic.metasenv
39 val subst : NCic.substitution
40 val context : NCic.context
43 module NCicBlob(C : NCicContext) : Terms.Blob
44 with type t = NCic.term and type input = NCic.term = struct
48 let eq x y = NCicReduction.alpha_eq C.metasenv C.subst C.context x y;;
52 | NCic.Rel i, NCic.Rel j -> j-i
53 | NCic.Meta (i,_), NCic.Meta (j,_) -> i-j
54 | NCic.Const r1, NCic.Const r2 -> NReference.compare r1 r2
55 | NCic.Appl l1, NCic.Appl l2 -> FoUtils.lexicograph compare l1 l2
56 | NCic.Rel _, ( NCic.Meta _ | NCic.Const _ | NCic.Appl _ ) -> ~-1
57 | ( NCic.Meta _ | NCic.Const _ | NCic.Appl _ ), NCic.Rel _ -> 1
58 | NCic.Const _, ( NCic.Meta _ | NCic.Appl _ ) -> ~-1
59 | ( NCic.Meta _ | NCic.Appl _ ), NCic.Const _ -> 1
60 | NCic.Appl _, NCic.Meta _ -> ~-1
61 | NCic.Meta _, NCic.Appl _ -> 1
66 if NCicReduction.alpha_eq C.metasenv C.subst C.context x y then 0
71 NCicPp.ppterm ~context:C.context ~metasenv:C.metasenv ~subst:C.subst t;;
73 type input = NCic.term
75 let rec embed = function
76 | NCic.Meta (i,_) -> Terms.Var i, [i]
78 let rec aux acc l = function
80 |hd::tl -> if List.mem hd l then aux acc l tl else aux (hd::acc) l tl
82 let res,vars = List.fold_left
83 (fun (r,v) t -> let r1,v1 = embed t in (r1::r),aux [] v v1) ([],[]) l
84 in (Terms.Node (List.rev res)), vars
85 | t -> Terms.Leaf t, []
88 let embed t = fst (embed t) ;;
92 NCicMetaSubst.saturate ~delta:max_int C.metasenv C.subst C.context
96 if args = [] then Terms.Leaf t
97 else Terms.Node (Terms.Leaf t :: List.map embed args)
99 let sty = embed sty in
103 let eqP = (!eqPref)()