wenzelm@548
|
1 |
(* Title: Pure/Syntax/syn_trans.ML
|
wenzelm@548
|
2 |
Author: Tobias Nipkow and Markus Wenzel, TU Muenchen
|
wenzelm@548
|
3 |
|
wenzelm@548
|
4 |
Syntax translation functions.
|
wenzelm@548
|
5 |
*)
|
wenzelm@548
|
6 |
|
wenzelm@548
|
7 |
signature SYN_TRANS0 =
|
wenzelm@2698
|
8 |
sig
|
wenzelm@32738
|
9 |
val eta_contract: bool Unsynchronized.ref
|
nipkow@13762
|
10 |
val atomic_abs_tr': string * typ * term -> term * term
|
haftmann@32098
|
11 |
val preserve_binder_abs_tr': string -> string -> string * (term list -> term)
|
haftmann@32098
|
12 |
val preserve_binder_abs2_tr': string -> string -> string * (term list -> term)
|
wenzelm@548
|
13 |
val mk_binder_tr: string * string -> string * (term list -> term)
|
wenzelm@548
|
14 |
val mk_binder_tr': string * string -> string * (term list -> term)
|
wenzelm@548
|
15 |
val dependent_tr': string * string -> term list -> term
|
wenzelm@8577
|
16 |
val antiquote_tr: string -> term -> term
|
wenzelm@8577
|
17 |
val quote_tr: string -> term -> term
|
wenzelm@5084
|
18 |
val quote_antiquote_tr: string -> string -> string -> string * (term list -> term)
|
wenzelm@8577
|
19 |
val antiquote_tr': string -> term -> term
|
wenzelm@8577
|
20 |
val quote_tr': string -> term -> term
|
wenzelm@5084
|
21 |
val quote_antiquote_tr': string -> string -> string -> string * (term list -> term)
|
wenzelm@2698
|
22 |
val mark_bound: string -> term
|
wenzelm@2698
|
23 |
val mark_boundT: string * typ -> term
|
wenzelm@18958
|
24 |
val bound_vars: (string * typ) list -> term -> term
|
wenzelm@20202
|
25 |
val variant_abs: string * typ * term -> string * term
|
wenzelm@2698
|
26 |
val variant_abs': string * typ * term -> string * term
|
wenzelm@2698
|
27 |
end;
|
wenzelm@548
|
28 |
|
wenzelm@548
|
29 |
signature SYN_TRANS1 =
|
wenzelm@2698
|
30 |
sig
|
wenzelm@548
|
31 |
include SYN_TRANS0
|
wenzelm@14647
|
32 |
val non_typed_tr': (term list -> term) -> bool -> typ -> term list -> term
|
wenzelm@14647
|
33 |
val non_typed_tr'': ('a -> term list -> term) -> 'a -> bool -> typ -> term list -> term
|
paulson@1511
|
34 |
val constrainAbsC: string
|
paulson@1511
|
35 |
val pure_trfuns:
|
paulson@1511
|
36 |
(string * (Ast.ast list -> Ast.ast)) list *
|
wenzelm@548
|
37 |
(string * (term list -> term)) list *
|
wenzelm@548
|
38 |
(string * (term list -> term)) list *
|
paulson@1511
|
39 |
(string * (Ast.ast list -> Ast.ast)) list
|
wenzelm@4148
|
40 |
val pure_trfunsT: (string * (bool -> typ -> term list -> term)) list
|
wenzelm@14697
|
41 |
val struct_trfuns: string list ->
|
wenzelm@14697
|
42 |
(string * (Ast.ast list -> Ast.ast)) list *
|
wenzelm@14697
|
43 |
(string * (term list -> term)) list *
|
wenzelm@14697
|
44 |
(string * (bool -> typ -> term list -> term)) list *
|
wenzelm@14697
|
45 |
(string * (Ast.ast list -> Ast.ast)) list
|
wenzelm@2698
|
46 |
end;
|
wenzelm@548
|
47 |
|
wenzelm@548
|
48 |
signature SYN_TRANS =
|
wenzelm@2698
|
49 |
sig
|
wenzelm@548
|
50 |
include SYN_TRANS1
|
paulson@1511
|
51 |
val abs_tr': term -> term
|
wenzelm@4148
|
52 |
val prop_tr': term -> term
|
paulson@1511
|
53 |
val appl_ast_tr': Ast.ast * Ast.ast list -> Ast.ast
|
paulson@1511
|
54 |
val applC_ast_tr': Ast.ast * Ast.ast list -> Ast.ast
|
wenzelm@21773
|
55 |
val pts_to_asts: Proof.context ->
|
wenzelm@21773
|
56 |
(string -> (Proof.context -> Ast.ast list -> Ast.ast) option) ->
|
wenzelm@16612
|
57 |
Parser.parsetree list -> Ast.ast list
|
wenzelm@21773
|
58 |
val asts_to_terms: Proof.context ->
|
wenzelm@21773
|
59 |
(string -> (Proof.context -> term list -> term) option) -> Ast.ast list -> term list
|
wenzelm@2698
|
60 |
end;
|
wenzelm@548
|
61 |
|
wenzelm@2698
|
62 |
structure SynTrans: SYN_TRANS =
|
wenzelm@548
|
63 |
struct
|
wenzelm@2698
|
64 |
|
wenzelm@2698
|
65 |
|
wenzelm@548
|
66 |
(** parse (ast) translations **)
|
wenzelm@548
|
67 |
|
wenzelm@11491
|
68 |
(* constify *)
|
wenzelm@11491
|
69 |
|
wenzelm@11491
|
70 |
fun constify_ast_tr [Ast.Variable c] = Ast.Constant c
|
wenzelm@11491
|
71 |
| constify_ast_tr asts = raise Ast.AST ("constify_ast_tr", asts);
|
wenzelm@11491
|
72 |
|
wenzelm@11491
|
73 |
|
wenzelm@548
|
74 |
(* application *)
|
wenzelm@548
|
75 |
|
wenzelm@5690
|
76 |
fun appl_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_args" args)
|
wenzelm@5690
|
77 |
| appl_ast_tr asts = raise Ast.AST ("appl_ast_tr", asts);
|
clasohm@922
|
78 |
|
wenzelm@5690
|
79 |
fun applC_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_cargs" args)
|
wenzelm@5690
|
80 |
| applC_ast_tr asts = raise Ast.AST ("applC_ast_tr", asts);
|
wenzelm@548
|
81 |
|
wenzelm@548
|
82 |
|
wenzelm@548
|
83 |
(* abstraction *)
|
wenzelm@548
|
84 |
|
wenzelm@17788
|
85 |
fun idtyp_ast_tr (*"_idtyp"*) [x, ty] = Ast.Appl [Ast.Constant "_constrain", x, ty]
|
wenzelm@5690
|
86 |
| idtyp_ast_tr (*"_idtyp"*) asts = raise Ast.AST ("idtyp_ast_tr", asts);
|
wenzelm@548
|
87 |
|
wenzelm@17788
|
88 |
fun idtypdummy_ast_tr (*"_idtypdummy"*) [ty] =
|
wenzelm@17788
|
89 |
Ast.Appl [Ast.Constant "_constrain", Ast.Constant "_idtdummy", ty]
|
wenzelm@17788
|
90 |
| idtypdummy_ast_tr (*"_idtypdummy"*) asts = raise Ast.AST ("idtyp_ast_tr", asts);
|
wenzelm@17788
|
91 |
|
wenzelm@3691
|
92 |
fun lambda_ast_tr (*"_lambda"*) [pats, body] =
|
wenzelm@5690
|
93 |
Ast.fold_ast_p "_abs" (Ast.unfold_ast "_pttrns" pats, body)
|
wenzelm@5690
|
94 |
| lambda_ast_tr (*"_lambda"*) asts = raise Ast.AST ("lambda_ast_tr", asts);
|
wenzelm@548
|
95 |
|
wenzelm@548
|
96 |
val constrainAbsC = "_constrainAbs";
|
wenzelm@548
|
97 |
|
wenzelm@21773
|
98 |
fun absfree_proper (x, T, t) =
|
wenzelm@21773
|
99 |
if can Name.dest_internal x then error ("Illegal internal variable in abstraction: " ^ quote x)
|
wenzelm@21773
|
100 |
else Term.absfree (x, T, t);
|
wenzelm@21773
|
101 |
|
wenzelm@21773
|
102 |
fun abs_tr (*"_abs"*) [Free (x, T), t] = absfree_proper (x, T, t)
|
wenzelm@17788
|
103 |
| abs_tr (*"_abs"*) [Const ("_idtdummy", T), t] = Term.absdummy (T, t)
|
wenzelm@17788
|
104 |
| abs_tr (*"_abs"*) [Const ("_constrain", _) $ Free (x, T) $ tT, t] =
|
wenzelm@21773
|
105 |
Lexicon.const constrainAbsC $ absfree_proper (x, T, t) $ tT
|
wenzelm@17788
|
106 |
| abs_tr (*"_abs"*) [Const ("_constrain", _) $ Const ("_idtdummy", T) $ tT, t] =
|
wenzelm@17788
|
107 |
Lexicon.const constrainAbsC $ Term.absdummy (T, t) $ tT
|
wenzelm@3777
|
108 |
| abs_tr (*"_abs"*) ts = raise TERM ("abs_tr", ts);
|
wenzelm@548
|
109 |
|
wenzelm@548
|
110 |
|
wenzelm@548
|
111 |
(* binder *)
|
wenzelm@548
|
112 |
|
wenzelm@21535
|
113 |
fun mk_binder_tr (syn, name) =
|
wenzelm@548
|
114 |
let
|
wenzelm@21773
|
115 |
fun tr (Free (x, T), t) = Lexicon.const name $ absfree_proper (x, T, t)
|
wenzelm@17788
|
116 |
| tr (Const ("_idtdummy", T), t) = Lexicon.const name $ Term.absdummy (T, t)
|
wenzelm@17788
|
117 |
| tr (Const ("_constrain", _) $ Free (x, T) $ tT, t) =
|
wenzelm@21773
|
118 |
Lexicon.const name $ (Lexicon.const constrainAbsC $ absfree_proper (x, T, t) $ tT)
|
wenzelm@17788
|
119 |
| tr (Const ("_constrain", _) $ Const ("_idtdummy", T) $ tT, t) =
|
wenzelm@18342
|
120 |
Lexicon.const name $ (Lexicon.const constrainAbsC $ Term.absdummy (T, t) $ tT)
|
wenzelm@548
|
121 |
| tr (Const ("_idts", _) $ idt $ idts, t) = tr (idt, tr (idts, t))
|
wenzelm@3777
|
122 |
| tr (t1, t2) = raise TERM ("binder_tr", [t1, t2]);
|
wenzelm@548
|
123 |
|
wenzelm@21535
|
124 |
fun binder_tr [idts, body] = tr (idts, body)
|
wenzelm@21535
|
125 |
| binder_tr ts = raise TERM ("binder_tr", ts);
|
wenzelm@21535
|
126 |
in (syn, binder_tr) end;
|
wenzelm@548
|
127 |
|
wenzelm@548
|
128 |
|
wenzelm@28628
|
129 |
(* type propositions *)
|
wenzelm@28628
|
130 |
|
wenzelm@28628
|
131 |
fun mk_type ty = Lexicon.const "_constrain" $ Lexicon.const "TYPE" $ (Lexicon.const "itself" $ ty);
|
wenzelm@28628
|
132 |
|
wenzelm@28628
|
133 |
fun ofclass_tr (*"_ofclass"*) [ty, cls] = cls $ mk_type ty
|
wenzelm@28628
|
134 |
| ofclass_tr (*"_ofclass"*) ts = raise TERM ("ofclass_tr", ts);
|
wenzelm@28628
|
135 |
|
wenzelm@28628
|
136 |
fun sort_constraint_tr (*"_sort_constraint"*) [ty] =
|
wenzelm@28628
|
137 |
Lexicon.const "Pure.sort_constraint" $ mk_type ty
|
wenzelm@28628
|
138 |
| sort_constraint_tr (*"_sort_constraint"*) ts = raise TERM ("sort_constraint_tr", ts);
|
wenzelm@28628
|
139 |
|
wenzelm@28628
|
140 |
|
wenzelm@548
|
141 |
(* meta propositions *)
|
wenzelm@548
|
142 |
|
wenzelm@17788
|
143 |
fun aprop_tr (*"_aprop"*) [t] = Lexicon.const "_constrain" $ t $ Lexicon.const "prop"
|
wenzelm@3777
|
144 |
| aprop_tr (*"_aprop"*) ts = raise TERM ("aprop_tr", ts);
|
wenzelm@548
|
145 |
|
wenzelm@548
|
146 |
|
wenzelm@548
|
147 |
(* meta implication *)
|
wenzelm@548
|
148 |
|
wenzelm@16612
|
149 |
fun bigimpl_ast_tr (*"_bigimpl"*) (asts as [asms, concl]) =
|
wenzelm@16612
|
150 |
let val prems =
|
wenzelm@16612
|
151 |
(case Ast.unfold_ast_p "_asms" asms of
|
wenzelm@16612
|
152 |
(asms', Ast.Appl [Ast.Constant "_asm", asm']) => asms' @ [asm']
|
wenzelm@16612
|
153 |
| _ => raise Ast.AST ("bigimpl_ast_tr", asts))
|
wenzelm@16612
|
154 |
in Ast.fold_ast_p "==>" (prems, concl) end
|
schirmer@15421
|
155 |
| bigimpl_ast_tr (*"_bigimpl"*) asts = raise Ast.AST ("bigimpl_ast_tr", asts);
|
schirmer@15421
|
156 |
|
wenzelm@548
|
157 |
|
wenzelm@23824
|
158 |
(* type/term reflection *)
|
wenzelm@4148
|
159 |
|
wenzelm@28628
|
160 |
fun type_tr (*"_TYPE"*) [ty] = mk_type ty
|
wenzelm@4148
|
161 |
| type_tr (*"_TYPE"*) ts = raise TERM ("type_tr", ts);
|
wenzelm@4148
|
162 |
|
wenzelm@548
|
163 |
|
wenzelm@6761
|
164 |
(* dddot *)
|
wenzelm@6761
|
165 |
|
wenzelm@8595
|
166 |
fun dddot_tr (*"_DDDOT"*) ts = Term.list_comb (Lexicon.var SynExt.dddot_indexname, ts);
|
wenzelm@6761
|
167 |
|
wenzelm@6761
|
168 |
|
wenzelm@5084
|
169 |
(* quote / antiquote *)
|
wenzelm@5084
|
170 |
|
wenzelm@8577
|
171 |
fun antiquote_tr name =
|
wenzelm@8577
|
172 |
let
|
wenzelm@8577
|
173 |
fun tr i ((t as Const (c, _)) $ u) =
|
wenzelm@8577
|
174 |
if c = name then tr i u $ Bound i
|
wenzelm@8577
|
175 |
else tr i t $ tr i u
|
wenzelm@8577
|
176 |
| tr i (t $ u) = tr i t $ tr i u
|
wenzelm@8577
|
177 |
| tr i (Abs (x, T, t)) = Abs (x, T, tr (i + 1) t)
|
wenzelm@8577
|
178 |
| tr _ a = a;
|
wenzelm@8577
|
179 |
in tr 0 end;
|
wenzelm@8577
|
180 |
|
wenzelm@8577
|
181 |
fun quote_tr name t = Abs ("s", dummyT, antiquote_tr name (Term.incr_boundvars 1 t));
|
wenzelm@8577
|
182 |
|
wenzelm@5084
|
183 |
fun quote_antiquote_tr quoteN antiquoteN name =
|
wenzelm@5084
|
184 |
let
|
wenzelm@8577
|
185 |
fun tr [t] = Lexicon.const name $ quote_tr antiquoteN t
|
wenzelm@8577
|
186 |
| tr ts = raise TERM ("quote_tr", ts);
|
wenzelm@8577
|
187 |
in (quoteN, tr) end;
|
wenzelm@5084
|
188 |
|
wenzelm@5084
|
189 |
|
wenzelm@14697
|
190 |
(* indexed syntax *)
|
wenzelm@12122
|
191 |
|
wenzelm@14697
|
192 |
fun struct_ast_tr (*"_struct"*) [Ast.Appl [Ast.Constant "_index", ast]] = ast
|
wenzelm@14697
|
193 |
| struct_ast_tr (*"_struct"*) asts = Ast.mk_appl (Ast.Constant "_struct") asts;
|
wenzelm@14697
|
194 |
|
wenzelm@14697
|
195 |
fun index_ast_tr ast =
|
wenzelm@14697
|
196 |
Ast.mk_appl (Ast.Constant "_index") [Ast.mk_appl (Ast.Constant "_struct") [ast]];
|
wenzelm@14697
|
197 |
|
wenzelm@14697
|
198 |
fun indexdefault_ast_tr (*"_indexdefault"*) [] =
|
wenzelm@14697
|
199 |
index_ast_tr (Ast.Constant "_indexdefault")
|
wenzelm@14697
|
200 |
| indexdefault_ast_tr (*"_indexdefault"*) asts =
|
wenzelm@14697
|
201 |
raise Ast.AST ("indexdefault_ast_tr", asts);
|
wenzelm@14697
|
202 |
|
wenzelm@14697
|
203 |
fun indexnum_ast_tr (*"_indexnum"*) [ast] =
|
wenzelm@14697
|
204 |
index_ast_tr (Ast.mk_appl (Ast.Constant "_indexnum") [ast])
|
wenzelm@14697
|
205 |
| indexnum_ast_tr (*"_indexnum"*) asts = raise Ast.AST ("indexnum_ast_tr", asts);
|
wenzelm@14697
|
206 |
|
wenzelm@14697
|
207 |
fun indexvar_ast_tr (*"_indexvar"*) [] =
|
wenzelm@14697
|
208 |
Ast.mk_appl (Ast.Constant "_index") [Ast.Variable "some_index"]
|
wenzelm@14697
|
209 |
| indexvar_ast_tr (*"_indexvar"*) asts = raise Ast.AST ("indexvar_ast_tr", asts);
|
wenzelm@14697
|
210 |
|
wenzelm@14697
|
211 |
fun index_tr (*"_index"*) [t] = t
|
wenzelm@14697
|
212 |
| index_tr (*"_index"*) ts = raise TERM ("index_tr", ts);
|
wenzelm@14697
|
213 |
|
wenzelm@14697
|
214 |
|
wenzelm@14697
|
215 |
(* implicit structures *)
|
wenzelm@14697
|
216 |
|
wenzelm@14697
|
217 |
fun the_struct structs i =
|
wenzelm@30146
|
218 |
if 1 <= i andalso i <= length structs then nth structs (i - 1)
|
wenzelm@31545
|
219 |
else error ("Illegal reference to implicit structure #" ^ string_of_int i);
|
wenzelm@14697
|
220 |
|
wenzelm@14697
|
221 |
fun struct_tr structs (*"_struct"*) [Const ("_indexdefault", _)] =
|
wenzelm@14697
|
222 |
Lexicon.free (the_struct structs 1)
|
wenzelm@14697
|
223 |
| struct_tr structs (*"_struct"*) [t as (Const ("_indexnum", _) $ Const (s, _))] =
|
wenzelm@14697
|
224 |
Lexicon.free (the_struct structs
|
skalberg@15531
|
225 |
(case Lexicon.read_nat s of SOME n => n | NONE => raise TERM ("struct_tr", [t])))
|
wenzelm@14697
|
226 |
| struct_tr _ (*"_struct"*) ts = raise TERM ("struct_tr", ts);
|
wenzelm@12122
|
227 |
|
wenzelm@12122
|
228 |
|
wenzelm@5084
|
229 |
|
wenzelm@548
|
230 |
(** print (ast) translations **)
|
wenzelm@548
|
231 |
|
wenzelm@14647
|
232 |
(* types *)
|
wenzelm@14647
|
233 |
|
wenzelm@14647
|
234 |
fun non_typed_tr' f _ _ ts = f ts;
|
wenzelm@14647
|
235 |
fun non_typed_tr'' f x _ _ ts = f x ts;
|
wenzelm@14647
|
236 |
|
wenzelm@14647
|
237 |
|
wenzelm@548
|
238 |
(* application *)
|
wenzelm@548
|
239 |
|
wenzelm@5690
|
240 |
fun appl_ast_tr' (f, []) = raise Ast.AST ("appl_ast_tr'", [f])
|
wenzelm@5690
|
241 |
| appl_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_appl", f, Ast.fold_ast "_args" args];
|
wenzelm@548
|
242 |
|
wenzelm@5690
|
243 |
fun applC_ast_tr' (f, []) = raise Ast.AST ("applC_ast_tr'", [f])
|
wenzelm@5690
|
244 |
| applC_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_applC", f, Ast.fold_ast "_cargs" args];
|
clasohm@922
|
245 |
|
wenzelm@548
|
246 |
|
wenzelm@548
|
247 |
(* abstraction *)
|
wenzelm@548
|
248 |
|
wenzelm@19311
|
249 |
fun mark_boundT (x, T) = Const ("_bound", T --> T) $ Free (x, T);
|
wenzelm@2698
|
250 |
fun mark_bound x = mark_boundT (x, dummyT);
|
wenzelm@2698
|
251 |
|
wenzelm@18958
|
252 |
fun bound_vars vars body =
|
wenzelm@18958
|
253 |
subst_bounds (map mark_boundT (Term.rename_wrt_term body vars), body);
|
wenzelm@18958
|
254 |
|
wenzelm@548
|
255 |
fun strip_abss vars_of body_of tm =
|
wenzelm@548
|
256 |
let
|
wenzelm@548
|
257 |
val vars = vars_of tm;
|
wenzelm@548
|
258 |
val body = body_of tm;
|
wenzelm@29276
|
259 |
val rev_new_vars = Term.rename_wrt_term body vars;
|
wenzelm@21750
|
260 |
fun subst (x, T) b =
|
wenzelm@21750
|
261 |
if can Name.dest_internal x andalso not (Term.loose_bvar1 (b, 0))
|
wenzelm@21750
|
262 |
then (Const ("_idtdummy", T), incr_boundvars ~1 b)
|
wenzelm@21750
|
263 |
else (mark_boundT (x, T), Term.subst_bound (mark_bound x, b));
|
wenzelm@21750
|
264 |
val (rev_vars', body') = fold_map subst rev_new_vars body;
|
wenzelm@21750
|
265 |
in (rev rev_vars', body') end;
|
wenzelm@548
|
266 |
|
wenzelm@3928
|
267 |
|
wenzelm@548
|
268 |
(*do (partial) eta-contraction before printing*)
|
wenzelm@548
|
269 |
|
wenzelm@32738
|
270 |
val eta_contract = Unsynchronized.ref true;
|
wenzelm@548
|
271 |
|
wenzelm@548
|
272 |
fun eta_contr tm =
|
wenzelm@548
|
273 |
let
|
wenzelm@3928
|
274 |
fun is_aprop (Const ("_aprop", _)) = true
|
wenzelm@3928
|
275 |
| is_aprop _ = false;
|
wenzelm@3928
|
276 |
|
wenzelm@548
|
277 |
fun eta_abs (Abs (a, T, t)) =
|
wenzelm@548
|
278 |
(case eta_abs t of
|
wenzelm@548
|
279 |
t' as f $ u =>
|
wenzelm@548
|
280 |
(case eta_abs u of
|
wenzelm@548
|
281 |
Bound 0 =>
|
wenzelm@5084
|
282 |
if Term.loose_bvar1 (f, 0) orelse is_aprop f then Abs (a, T, t')
|
wenzelm@3928
|
283 |
else incr_boundvars ~1 f
|
wenzelm@548
|
284 |
| _ => Abs (a, T, t'))
|
wenzelm@548
|
285 |
| t' => Abs (a, T, t'))
|
wenzelm@548
|
286 |
| eta_abs t = t;
|
wenzelm@548
|
287 |
in
|
wenzelm@548
|
288 |
if ! eta_contract then eta_abs tm else tm
|
wenzelm@548
|
289 |
end;
|
wenzelm@548
|
290 |
|
wenzelm@548
|
291 |
|
wenzelm@548
|
292 |
fun abs_tr' tm =
|
wenzelm@19473
|
293 |
uncurry (fold_rev (fn x => fn t => Lexicon.const "_abs" $ x $ t))
|
wenzelm@548
|
294 |
(strip_abss strip_abs_vars strip_abs_body (eta_contr tm));
|
wenzelm@548
|
295 |
|
wenzelm@14697
|
296 |
fun atomic_abs_tr' (x, T, t) =
|
wenzelm@29276
|
297 |
let val [xT] = Term.rename_wrt_term t [(x, T)]
|
wenzelm@14697
|
298 |
in (mark_boundT xT, subst_bound (mark_bound (fst xT), t)) end;
|
nipkow@13762
|
299 |
|
wenzelm@548
|
300 |
fun abs_ast_tr' (*"_abs"*) asts =
|
wenzelm@5690
|
301 |
(case Ast.unfold_ast_p "_abs" (Ast.Appl (Ast.Constant "_abs" :: asts)) of
|
wenzelm@5690
|
302 |
([], _) => raise Ast.AST ("abs_ast_tr'", asts)
|
wenzelm@5690
|
303 |
| (xs, body) => Ast.Appl [Ast.Constant "_lambda", Ast.fold_ast "_pttrns" xs, body]);
|
wenzelm@548
|
304 |
|
haftmann@32098
|
305 |
fun preserve_binder_abs_tr' name syn = (name, fn (Abs abs :: ts) =>
|
haftmann@32098
|
306 |
let val (x, t) = atomic_abs_tr' abs
|
haftmann@32098
|
307 |
in list_comb (Lexicon.const syn $ x $ t, ts) end);
|
haftmann@32098
|
308 |
|
haftmann@32098
|
309 |
fun preserve_binder_abs2_tr' name syn = (name, fn (A :: Abs abs :: ts) =>
|
haftmann@32098
|
310 |
let val (x, t) = atomic_abs_tr' abs
|
haftmann@32098
|
311 |
in list_comb (Lexicon.const syn $ x $ A $ t, ts) end);
|
haftmann@32098
|
312 |
|
wenzelm@548
|
313 |
|
wenzelm@548
|
314 |
(* binder *)
|
wenzelm@548
|
315 |
|
wenzelm@21535
|
316 |
fun mk_binder_tr' (name, syn) =
|
wenzelm@548
|
317 |
let
|
wenzelm@548
|
318 |
fun mk_idts [] = raise Match (*abort translation*)
|
wenzelm@548
|
319 |
| mk_idts [idt] = idt
|
wenzelm@5690
|
320 |
| mk_idts (idt :: idts) = Lexicon.const "_idts" $ idt $ mk_idts idts;
|
wenzelm@548
|
321 |
|
wenzelm@548
|
322 |
fun tr' t =
|
wenzelm@548
|
323 |
let
|
wenzelm@548
|
324 |
val (xs, bd) = strip_abss (strip_qnt_vars name) (strip_qnt_body name) t;
|
wenzelm@21535
|
325 |
in Lexicon.const syn $ mk_idts xs $ bd end;
|
wenzelm@548
|
326 |
|
wenzelm@21535
|
327 |
fun binder_tr' (t :: ts) = Term.list_comb (tr' (Lexicon.const name $ t), ts)
|
wenzelm@21535
|
328 |
| binder_tr' [] = raise Match;
|
wenzelm@21535
|
329 |
in (name, binder_tr') end;
|
wenzelm@548
|
330 |
|
wenzelm@548
|
331 |
|
wenzelm@3691
|
332 |
(* idtyp constraints *)
|
wenzelm@548
|
333 |
|
wenzelm@5690
|
334 |
fun idtyp_ast_tr' a [Ast.Appl [Ast.Constant c, x, ty], xs] =
|
wenzelm@17788
|
335 |
if c = "_constrain" then
|
wenzelm@28628
|
336 |
Ast.Appl [Ast.Constant a, Ast.Appl [Ast.Constant "_idtyp", x, ty], xs]
|
wenzelm@548
|
337 |
else raise Match
|
wenzelm@3691
|
338 |
| idtyp_ast_tr' _ _ = raise Match;
|
wenzelm@548
|
339 |
|
wenzelm@548
|
340 |
|
wenzelm@28628
|
341 |
(* type propositions *)
|
wenzelm@28628
|
342 |
|
wenzelm@28628
|
343 |
fun type_prop_tr' _ (*"_type_prop"*) T [Const ("Pure.sort_constraint", _)] =
|
wenzelm@28628
|
344 |
Lexicon.const "_sort_constraint" $ TypeExt.term_of_typ true T
|
wenzelm@28628
|
345 |
| type_prop_tr' show_sorts (*"_type_prop"*) T [t] =
|
wenzelm@28628
|
346 |
Lexicon.const "_ofclass" $ TypeExt.term_of_typ show_sorts T $ t
|
wenzelm@28628
|
347 |
| type_prop_tr' _ (*"_type_prop"*) T ts = raise TYPE ("type_prop_tr'", [T], ts);
|
wenzelm@28628
|
348 |
|
wenzelm@28628
|
349 |
|
wenzelm@548
|
350 |
(* meta propositions *)
|
wenzelm@548
|
351 |
|
wenzelm@4148
|
352 |
fun prop_tr' tm =
|
wenzelm@548
|
353 |
let
|
wenzelm@5690
|
354 |
fun aprop t = Lexicon.const "_aprop" $ t;
|
wenzelm@548
|
355 |
|
wenzelm@2698
|
356 |
fun is_prop Ts t =
|
wenzelm@2698
|
357 |
fastype_of1 (Ts, t) = propT handle TERM _ => false;
|
wenzelm@548
|
358 |
|
wenzelm@26424
|
359 |
fun is_term (Const ("Pure.term", _) $ _) = true
|
wenzelm@19848
|
360 |
| is_term _ = false;
|
wenzelm@19848
|
361 |
|
wenzelm@548
|
362 |
fun tr' _ (t as Const _) = t
|
wenzelm@18478
|
363 |
| tr' Ts (t as Const ("_bound", _) $ u) =
|
wenzelm@18478
|
364 |
if is_prop Ts u then aprop t else t
|
wenzelm@2698
|
365 |
| tr' _ (t as Free (x, T)) =
|
wenzelm@5690
|
366 |
if T = propT then aprop (Lexicon.free x) else t
|
wenzelm@2698
|
367 |
| tr' _ (t as Var (xi, T)) =
|
wenzelm@5690
|
368 |
if T = propT then aprop (Lexicon.var xi) else t
|
wenzelm@2698
|
369 |
| tr' Ts (t as Bound _) =
|
wenzelm@2698
|
370 |
if is_prop Ts t then aprop t else t
|
wenzelm@2698
|
371 |
| tr' Ts (Abs (x, T, t)) = Abs (x, T, tr' (T :: Ts) t)
|
wenzelm@2698
|
372 |
| tr' Ts (t as t1 $ (t2 as Const ("TYPE", Type ("itself", [T])))) =
|
wenzelm@28628
|
373 |
if is_prop Ts t andalso not (is_term t) then Const ("_type_prop", T) $ tr' Ts t1
|
wenzelm@2698
|
374 |
else tr' Ts t1 $ tr' Ts t2
|
wenzelm@2698
|
375 |
| tr' Ts (t as t1 $ t2) =
|
wenzelm@5690
|
376 |
(if is_Const (Term.head_of t) orelse not (is_prop Ts t)
|
wenzelm@2698
|
377 |
then I else aprop) (tr' Ts t1 $ tr' Ts t2);
|
wenzelm@16612
|
378 |
in tr' [] tm end;
|
wenzelm@548
|
379 |
|
wenzelm@2698
|
380 |
|
wenzelm@548
|
381 |
(* meta implication *)
|
wenzelm@548
|
382 |
|
wenzelm@548
|
383 |
fun impl_ast_tr' (*"==>"*) asts =
|
wenzelm@10572
|
384 |
if TypeExt.no_brackets () then raise Match
|
wenzelm@10572
|
385 |
else
|
wenzelm@10572
|
386 |
(case Ast.unfold_ast_p "==>" (Ast.Appl (Ast.Constant "==>" :: asts)) of
|
wenzelm@16612
|
387 |
(prems as _ :: _ :: _, concl) =>
|
wenzelm@16612
|
388 |
let
|
wenzelm@16612
|
389 |
val (asms, asm) = split_last prems;
|
wenzelm@16612
|
390 |
val asms' = Ast.fold_ast_p "_asms" (asms, Ast.Appl [Ast.Constant "_asm", asm]);
|
wenzelm@16612
|
391 |
in Ast.Appl [Ast.Constant "_bigimpl", asms', concl] end
|
schirmer@15421
|
392 |
| _ => raise Match);
|
schirmer@15421
|
393 |
|
wenzelm@548
|
394 |
|
wenzelm@4148
|
395 |
(* type reflection *)
|
wenzelm@4148
|
396 |
|
wenzelm@4148
|
397 |
fun type_tr' show_sorts (*"TYPE"*) (Type ("itself", [T])) ts =
|
wenzelm@5690
|
398 |
Term.list_comb (Lexicon.const "_TYPE" $ TypeExt.term_of_typ show_sorts T, ts)
|
wenzelm@4148
|
399 |
| type_tr' _ _ _ = raise Match;
|
wenzelm@4148
|
400 |
|
wenzelm@4148
|
401 |
|
wenzelm@19577
|
402 |
(* type constraints *)
|
wenzelm@19577
|
403 |
|
wenzelm@19577
|
404 |
fun type_constraint_tr' show_sorts (*"_type_constraint_"*) (Type ("fun", [T, _])) (t :: ts) =
|
wenzelm@19577
|
405 |
Term.list_comb (Lexicon.const SynExt.constrainC $ t $ TypeExt.term_of_typ show_sorts T, ts)
|
wenzelm@19577
|
406 |
| type_constraint_tr' _ _ _ = raise Match;
|
wenzelm@19577
|
407 |
|
wenzelm@19577
|
408 |
|
wenzelm@548
|
409 |
(* dependent / nondependent quantifiers *)
|
wenzelm@548
|
410 |
|
wenzelm@20202
|
411 |
fun var_abs mark (x, T, b) =
|
wenzelm@20202
|
412 |
let val ([x'], _) = Name.variants [x] (Term.declare_term_names b Name.context)
|
wenzelm@20202
|
413 |
in (x', subst_bound (mark (x', T), b)) end;
|
wenzelm@20202
|
414 |
|
wenzelm@20202
|
415 |
val variant_abs = var_abs Free;
|
wenzelm@20202
|
416 |
val variant_abs' = var_abs mark_boundT;
|
wenzelm@2698
|
417 |
|
wenzelm@548
|
418 |
fun dependent_tr' (q, r) (A :: Abs (x, T, B) :: ts) =
|
wenzelm@5084
|
419 |
if Term.loose_bvar1 (B, 0) then
|
wenzelm@2698
|
420 |
let val (x', B') = variant_abs' (x, dummyT, B);
|
wenzelm@5690
|
421 |
in Term.list_comb (Lexicon.const q $ mark_boundT (x', T) $ A $ B', ts) end
|
wenzelm@5690
|
422 |
else Term.list_comb (Lexicon.const r $ A $ B, ts)
|
wenzelm@548
|
423 |
| dependent_tr' _ _ = raise Match;
|
wenzelm@548
|
424 |
|
wenzelm@548
|
425 |
|
wenzelm@5084
|
426 |
(* quote / antiquote *)
|
wenzelm@5084
|
427 |
|
wenzelm@8577
|
428 |
fun antiquote_tr' name =
|
wenzelm@8577
|
429 |
let
|
wenzelm@8577
|
430 |
fun tr' i (t $ u) =
|
wenzelm@18139
|
431 |
if u aconv Bound i then Lexicon.const name $ tr' i t
|
wenzelm@8577
|
432 |
else tr' i t $ tr' i u
|
wenzelm@8577
|
433 |
| tr' i (Abs (x, T, t)) = Abs (x, T, tr' (i + 1) t)
|
wenzelm@18139
|
434 |
| tr' i a = if a aconv Bound i then raise Match else a;
|
wenzelm@8577
|
435 |
in tr' 0 end;
|
wenzelm@8577
|
436 |
|
wenzelm@8577
|
437 |
fun quote_tr' name (Abs (_, _, t)) = Term.incr_boundvars ~1 (antiquote_tr' name t)
|
wenzelm@8577
|
438 |
| quote_tr' _ _ = raise Match;
|
wenzelm@8577
|
439 |
|
wenzelm@5084
|
440 |
fun quote_antiquote_tr' quoteN antiquoteN name =
|
wenzelm@5084
|
441 |
let
|
wenzelm@8577
|
442 |
fun tr' (t :: ts) = Term.list_comb (Lexicon.const quoteN $ quote_tr' antiquoteN t, ts)
|
wenzelm@8577
|
443 |
| tr' _ = raise Match;
|
wenzelm@8577
|
444 |
in (name, tr') end;
|
wenzelm@5084
|
445 |
|
wenzelm@5084
|
446 |
|
wenzelm@14697
|
447 |
(* indexed syntax *)
|
wenzelm@548
|
448 |
|
wenzelm@14697
|
449 |
fun index_ast_tr' (*"_index"*) [Ast.Appl [Ast.Constant "_struct", ast]] = ast
|
wenzelm@14697
|
450 |
| index_ast_tr' _ = raise Match;
|
wenzelm@14697
|
451 |
|
wenzelm@14697
|
452 |
|
wenzelm@14697
|
453 |
(* implicit structures *)
|
wenzelm@14697
|
454 |
|
wenzelm@14697
|
455 |
fun the_struct' structs s =
|
wenzelm@14697
|
456 |
[(case Lexicon.read_nat s of
|
wenzelm@18678
|
457 |
SOME i => Ast.Variable (the_struct structs i handle ERROR _ => raise Match)
|
skalberg@15531
|
458 |
| NONE => raise Match)] |> Ast.mk_appl (Ast.Constant "_free");
|
wenzelm@14697
|
459 |
|
wenzelm@14697
|
460 |
fun struct_ast_tr' structs (*"_struct"*) [Ast.Constant "_indexdefault"] =
|
wenzelm@14697
|
461 |
the_struct' structs "1"
|
wenzelm@14697
|
462 |
| struct_ast_tr' structs (*"_struct"*) [Ast.Appl [Ast.Constant "_indexnum", Ast.Constant s]] =
|
wenzelm@14697
|
463 |
the_struct' structs s
|
wenzelm@14697
|
464 |
| struct_ast_tr' _ _ = raise Match;
|
wenzelm@14697
|
465 |
|
wenzelm@14697
|
466 |
|
wenzelm@14697
|
467 |
|
wenzelm@14697
|
468 |
(** Pure translations **)
|
wenzelm@548
|
469 |
|
wenzelm@548
|
470 |
val pure_trfuns =
|
wenzelm@11491
|
471 |
([("_constify", constify_ast_tr), ("_appl", appl_ast_tr), ("_applC", applC_ast_tr),
|
wenzelm@17788
|
472 |
("_lambda", lambda_ast_tr), ("_idtyp", idtyp_ast_tr), ("_idtypdummy", idtypdummy_ast_tr),
|
wenzelm@17788
|
473 |
("_bigimpl", bigimpl_ast_tr), ("_indexdefault", indexdefault_ast_tr),
|
wenzelm@17788
|
474 |
("_indexnum", indexnum_ast_tr), ("_indexvar", indexvar_ast_tr), ("_struct", struct_ast_tr)],
|
clasohm@922
|
475 |
[("_abs", abs_tr), ("_aprop", aprop_tr), ("_ofclass", ofclass_tr),
|
wenzelm@28856
|
476 |
("_sort_constraint", sort_constraint_tr), ("_TYPE", type_tr),
|
wenzelm@28856
|
477 |
("_DDDOT", dddot_tr), ("_index", index_tr)],
|
wenzelm@19131
|
478 |
([]: (string * (term list -> term)) list),
|
wenzelm@3691
|
479 |
[("_abs", abs_ast_tr'), ("_idts", idtyp_ast_tr' "_idts"),
|
wenzelm@14697
|
480 |
("_pttrns", idtyp_ast_tr' "_pttrns"), ("==>", impl_ast_tr'),
|
wenzelm@14697
|
481 |
("_index", index_ast_tr')]);
|
wenzelm@548
|
482 |
|
wenzelm@2698
|
483 |
val pure_trfunsT =
|
wenzelm@28628
|
484 |
[("_type_prop", type_prop_tr'), ("TYPE", type_tr'), ("_type_constraint_", type_constraint_tr')];
|
wenzelm@2698
|
485 |
|
wenzelm@14697
|
486 |
fun struct_trfuns structs =
|
wenzelm@14697
|
487 |
([], [("_struct", struct_tr structs)], [], [("_struct", struct_ast_tr' structs)]);
|
wenzelm@14697
|
488 |
|
wenzelm@548
|
489 |
|
wenzelm@548
|
490 |
|
wenzelm@14868
|
491 |
(** pts_to_asts **)
|
wenzelm@548
|
492 |
|
wenzelm@21773
|
493 |
fun pts_to_asts ctxt trf pts =
|
wenzelm@548
|
494 |
let
|
wenzelm@548
|
495 |
fun trans a args =
|
wenzelm@548
|
496 |
(case trf a of
|
skalberg@15531
|
497 |
NONE => Ast.mk_appl (Ast.Constant a) args
|
wenzelm@23937
|
498 |
| SOME f => f ctxt args);
|
wenzelm@548
|
499 |
|
clasohm@987
|
500 |
(*translate pt bottom-up*)
|
wenzelm@5690
|
501 |
fun ast_of (Parser.Node (a, pts)) = trans a (map ast_of pts)
|
wenzelm@5690
|
502 |
| ast_of (Parser.Tip tok) = Ast.Variable (Lexicon.str_of_token tok);
|
berghofe@14798
|
503 |
|
wenzelm@23963
|
504 |
val exn_results = map (Exn.capture ast_of) pts;
|
wenzelm@23963
|
505 |
val exns = map_filter Exn.get_exn exn_results;
|
wenzelm@23963
|
506 |
val results = map_filter Exn.get_result exn_results
|
wenzelm@31545
|
507 |
in (case (results, exns) of ([], exn :: _) => reraise exn | _ => results) end;
|
wenzelm@548
|
508 |
|
wenzelm@548
|
509 |
|
wenzelm@548
|
510 |
|
berghofe@14798
|
511 |
(** asts_to_terms **)
|
wenzelm@548
|
512 |
|
wenzelm@21773
|
513 |
fun asts_to_terms ctxt trf asts =
|
wenzelm@548
|
514 |
let
|
wenzelm@548
|
515 |
fun trans a args =
|
wenzelm@548
|
516 |
(case trf a of
|
skalberg@15531
|
517 |
NONE => Term.list_comb (Lexicon.const a, args)
|
wenzelm@23937
|
518 |
| SOME f => f ctxt args);
|
wenzelm@548
|
519 |
|
wenzelm@5690
|
520 |
fun term_of (Ast.Constant a) = trans a []
|
wenzelm@5690
|
521 |
| term_of (Ast.Variable x) = Lexicon.read_var x
|
wenzelm@5690
|
522 |
| term_of (Ast.Appl (Ast.Constant a :: (asts as _ :: _))) =
|
wenzelm@548
|
523 |
trans a (map term_of asts)
|
wenzelm@5690
|
524 |
| term_of (Ast.Appl (ast :: (asts as _ :: _))) =
|
wenzelm@5690
|
525 |
Term.list_comb (term_of ast, map term_of asts)
|
wenzelm@5690
|
526 |
| term_of (ast as Ast.Appl _) = raise Ast.AST ("ast_to_term: malformed ast", [ast]);
|
berghofe@14798
|
527 |
|
wenzelm@19005
|
528 |
val free_fixed = Term.map_aterms
|
wenzelm@19005
|
529 |
(fn t as Const (c, T) =>
|
wenzelm@19005
|
530 |
(case try (unprefix Lexicon.fixedN) c of
|
wenzelm@19005
|
531 |
NONE => t
|
wenzelm@18342
|
532 |
| SOME x => Free (x, T))
|
wenzelm@19005
|
533 |
| t => t);
|
wenzelm@18342
|
534 |
|
wenzelm@23963
|
535 |
val exn_results = map (Exn.capture (term_of #> free_fixed)) asts;
|
wenzelm@23963
|
536 |
val exns = map_filter Exn.get_exn exn_results;
|
wenzelm@23963
|
537 |
val results = map_filter Exn.get_result exn_results
|
wenzelm@31545
|
538 |
in (case (results, exns) of ([], exn :: _) => reraise exn | _ => results) end;
|
wenzelm@548
|
539 |
|
wenzelm@548
|
540 |
end;
|