module A = Ast;;
let floc = HExtlib.dummy_floc;;
+let universe = "Univ" ;;
+
let kw = [
"and","myand"
];;
| (name,nargs)::tl ->
PT.Binder
(binder,
- (mk_ident name,Some (mk_arrow "A" nargs)),
+ (mk_ident name,Some (mk_arrow universe nargs)),
aux tl)
in
aux arities
| A.False -> mk_ident "False"
| A.Eq (l,r)
| A.NotEq (l,r) -> (* removes the negation *)
- PT.Appl [mk_ident "eq";mk_ident "A";convert_term l;convert_term r]
+ PT.Appl [mk_ident "eq";mk_ident universe;convert_term l;convert_term r]
in
build_ctx_for_arities universally
(List.map (fun x -> (x,0)) (collect_fv_from_atom a)) (aux a)
let f =
PT.Binder
(`Forall,
- (mk_ident "A",Some (PT.Sort `Set)),
+ (mk_ident universe,Some (PT.Sort `Set)),
convert_formula fv false context f)
in
let o = PT.Theorem (`Theorem,name,f,None) in