wneuper/isa: src/Pure/Syntax/syn_trans.ML@617e4b19a2e5

     1 (*  Title:      Pure/Syntax/syn_trans.ML

     2     ID:         $Id$

     3     Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen

     4     License:    GPL (GNU GENERAL PUBLIC LICENSE)

     6 Syntax translation functions.

     7 *)

     9 signature SYN_TRANS0 =

    10 sig

    11   val eta_contract: bool ref

    12   val atomic_abs_tr': string * typ * term -> term * term

    13   val mk_binder_tr: string * string -> string * (term list -> term)

    14   val mk_binder_tr': string * string -> string * (term list -> term)

    15   val dependent_tr': string * string -> term list -> term

    16   val antiquote_tr: string -> term -> term

    17   val quote_tr: string -> term -> term

    18   val quote_antiquote_tr: string -> string -> string -> string * (term list -> term)

    19   val antiquote_tr': string -> term -> term

    20   val quote_tr': string -> term -> term

    21   val quote_antiquote_tr': string -> string -> string -> string * (term list -> term)

    22   val mark_bound: string -> term

    23   val mark_boundT: string * typ -> term

    24   val variant_abs': string * typ * term -> string * term

    25 end;

    27 signature SYN_TRANS1 =

    28 sig

    29   include SYN_TRANS0

    30   val non_typed_tr': (term list -> term) -> bool -> typ -> term list -> term

    31   val non_typed_tr'': ('a -> term list -> term) -> 'a -> bool -> typ -> term list -> term

    32   val constrainAbsC: string

    33   val pure_trfuns:

    34       (string * (Ast.ast list -> Ast.ast)) list *

    35       (string * (term list -> term)) list *

    36       (string * (term list -> term)) list *

    37       (string * (Ast.ast list -> Ast.ast)) list

    38   val pure_trfunsT: (string * (bool -> typ -> term list -> term)) list

    39   val struct_trfuns: string list ->

    40       (string * (Ast.ast list -> Ast.ast)) list *

    41       (string * (term list -> term)) list *

    42       (string * (bool -> typ -> term list -> term)) list *

    43       (string * (Ast.ast list -> Ast.ast)) list

    44 end;

    46 signature SYN_TRANS =

    47 sig

    48   include SYN_TRANS1

    49   val abs_tr': term -> term

    50   val prop_tr': term -> term

    51   val appl_ast_tr': Ast.ast * Ast.ast list -> Ast.ast

    52   val applC_ast_tr': Ast.ast * Ast.ast list -> Ast.ast

    53   val pts_to_asts: (string -> (Ast.ast list -> Ast.ast) option) -> Parser.parsetree list -> Ast.ast list

    54   val asts_to_terms: (string -> (term list -> term) option) -> Ast.ast list -> term list

    55 end;

    57 structure SynTrans: SYN_TRANS =

    58 struct

    61 (** parse (ast) translations **)

    63 (* constify *)

    65 fun constify_ast_tr [Ast.Variable c] = Ast.Constant c

    66   | constify_ast_tr asts = raise Ast.AST ("constify_ast_tr", asts);

    69 (* application *)

    71 fun appl_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_args" args)

    72   | appl_ast_tr asts = raise Ast.AST ("appl_ast_tr", asts);

    74 fun applC_ast_tr [f, args] = Ast.Appl (f :: Ast.unfold_ast "_cargs" args)

    75   | applC_ast_tr asts = raise Ast.AST ("applC_ast_tr", asts);

    78 (* abstraction *)

    80 fun idtyp_ast_tr (*"_idtyp"*) [x, ty] = Ast.Appl [Ast.Constant SynExt.constrainC, x, ty]

    81   | idtyp_ast_tr (*"_idtyp"*) asts = raise Ast.AST ("idtyp_ast_tr", asts);

    83 fun lambda_ast_tr (*"_lambda"*) [pats, body] =

    84       Ast.fold_ast_p "_abs" (Ast.unfold_ast "_pttrns" pats, body)

    85   | lambda_ast_tr (*"_lambda"*) asts = raise Ast.AST ("lambda_ast_tr", asts);

    87 val constrainAbsC = "_constrainAbs";

    89 fun abs_tr (*"_abs"*) [Free (x, T), body] = Term.absfree (x, T, body)

    90   | abs_tr (*"_abs"*) (ts as [Const (c, _) $ Free (x, T) $ tT, body]) =

    91       if c = SynExt.constrainC

    92         then Lexicon.const constrainAbsC $ Term.absfree (x, T, body) $ tT

    93       else raise TERM ("abs_tr", ts)

    94   | abs_tr (*"_abs"*) ts = raise TERM ("abs_tr", ts);

    97 (* nondependent abstraction *)

    99 fun k_tr (*"_K"*) [t] = Abs ("uu", dummyT, Term.incr_boundvars 1 t)

   100   | k_tr (*"_K"*) ts = raise TERM ("k_tr", ts);

   103 (* binder *)

   105 fun mk_binder_tr (sy, name) =

   106   let

   107     fun tr (Free (x, T), t) = Lexicon.const name $ Term.absfree (x, T, t)

   108       | tr (Const ("_idts", _) $ idt $ idts, t) = tr (idt, tr (idts, t))

   109       | tr (t1 as Const (c, _) $ Free (x, T) $ tT, t) =

   110           if c = SynExt.constrainC then

   111             Lexicon.const name $ (Lexicon.const constrainAbsC $ Term.absfree (x, T, t) $ tT)

   112           else raise TERM ("binder_tr", [t1, t])

   113       | tr (t1, t2) = raise TERM ("binder_tr", [t1, t2]);

   115     fun binder_tr (*sy*) [idts, body] = tr (idts, body)

   116       | binder_tr (*sy*) ts = raise TERM ("binder_tr", ts);

   117   in

   118     (sy, binder_tr)

   119   end;

   122 (* meta propositions *)

   124 fun aprop_tr (*"_aprop"*) [t] = Lexicon.const SynExt.constrainC $ t $ Lexicon.const "prop"

   125   | aprop_tr (*"_aprop"*) ts = raise TERM ("aprop_tr", ts);

   127 fun ofclass_tr (*"_ofclass"*) [ty, cls] =

   128       cls $ (Lexicon.const SynExt.constrainC $ Lexicon.const "TYPE" $

   129         (Lexicon.const "itself" $ ty))

   130   | ofclass_tr (*"_ofclass"*) ts = raise TERM ("ofclass_tr", ts);

   133 (* meta implication *)

   135 fun bigimpl_ast_tr (*"_bigimpl"*) [asms, concl] =

   136       Ast.fold_ast_p "==>" (Ast.unfold_ast "_asms" asms, concl)

   137   | bigimpl_ast_tr (*"_bigimpl"*) asts = raise Ast.AST ("bigimpl_ast_tr", asts);

   140 (* type reflection *)

   142 fun type_tr (*"_TYPE"*) [ty] =

   143       Lexicon.const SynExt.constrainC $ Lexicon.const "TYPE" $ (Lexicon.const "itself" $ ty)

   144   | type_tr (*"_TYPE"*) ts = raise TERM ("type_tr", ts);

   147 (* dddot *)

   149 fun dddot_tr (*"_DDDOT"*) ts = Term.list_comb (Lexicon.var SynExt.dddot_indexname, ts);

   152 (* quote / antiquote *)

   154 fun antiquote_tr name =

   155   let

   156     fun tr i ((t as Const (c, _)) $ u) =

   157           if c = name then tr i u $ Bound i

   158           else tr i t $ tr i u

   159       | tr i (t $ u) = tr i t $ tr i u

   160       | tr i (Abs (x, T, t)) = Abs (x, T, tr (i + 1) t)

   161       | tr _ a = a;

   162   in tr 0 end;

   164 fun quote_tr name t = Abs ("s", dummyT, antiquote_tr name (Term.incr_boundvars 1 t));

   166 fun quote_antiquote_tr quoteN antiquoteN name =

   167   let

   168     fun tr [t] = Lexicon.const name $ quote_tr antiquoteN t

   169       | tr ts = raise TERM ("quote_tr", ts);

   170   in (quoteN, tr) end;

   173 (* indexed syntax *)

   175 fun struct_ast_tr (*"_struct"*) [Ast.Appl [Ast.Constant "_index", ast]] = ast

   176   | struct_ast_tr (*"_struct"*) asts = Ast.mk_appl (Ast.Constant "_struct") asts;

   178 fun index_ast_tr ast =

   179   Ast.mk_appl (Ast.Constant "_index") [Ast.mk_appl (Ast.Constant "_struct") [ast]];

   181 fun indexdefault_ast_tr (*"_indexdefault"*) [] =

   182       index_ast_tr (Ast.Constant "_indexdefault")

   183   | indexdefault_ast_tr (*"_indexdefault"*) asts =

   184       raise Ast.AST ("indexdefault_ast_tr", asts);

   186 fun indexnum_ast_tr (*"_indexnum"*) [ast] =

   187       index_ast_tr (Ast.mk_appl (Ast.Constant "_indexnum") [ast])

   188   | indexnum_ast_tr (*"_indexnum"*) asts = raise Ast.AST ("indexnum_ast_tr", asts);

   190 fun indexvar_ast_tr (*"_indexvar"*) [] =

   191       Ast.mk_appl (Ast.Constant "_index") [Ast.Variable "some_index"]

   192   | indexvar_ast_tr (*"_indexvar"*) asts = raise Ast.AST ("indexvar_ast_tr", asts);

   194 fun index_tr (*"_index"*) [t] = t

   195   | index_tr (*"_index"*) ts = raise TERM ("index_tr", ts);

   198 (* implicit structures *)

   200 fun the_struct structs i =

   201   if 1 <= i andalso i <= length structs then Library.nth_elem (i - 1, structs)

   202   else raise ERROR_MESSAGE ("Illegal reference to implicit structure #" ^ string_of_int i);

   204 fun struct_tr structs (*"_struct"*) [Const ("_indexdefault", _)] =

   205       Lexicon.free (the_struct structs 1)

   206   | struct_tr structs (*"_struct"*) [t as (Const ("_indexnum", _) $ Const (s, _))] =

   207       Lexicon.free (the_struct structs

   208         (case Lexicon.read_nat s of Some n => n | None => raise TERM ("struct_tr", [t])))

   209   | struct_tr _ (*"_struct"*) ts = raise TERM ("struct_tr", ts);

   213 (** print (ast) translations **)

   215 (* types *)

   217 fun non_typed_tr' f _ _ ts = f ts;

   218 fun non_typed_tr'' f x _ _ ts = f x ts;

   221 (* application *)

   223 fun appl_ast_tr' (f, []) = raise Ast.AST ("appl_ast_tr'", [f])

   224   | appl_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_appl", f, Ast.fold_ast "_args" args];

   226 fun applC_ast_tr' (f, []) = raise Ast.AST ("applC_ast_tr'", [f])

   227   | applC_ast_tr' (f, args) = Ast.Appl [Ast.Constant "_applC", f, Ast.fold_ast "_cargs" args];

   230 (* abstraction *)

   232 fun mark_boundT x_T = Lexicon.const "_bound" $ Free x_T;

   233 fun mark_bound x = mark_boundT (x, dummyT);

   235 fun strip_abss vars_of body_of tm =

   236   let

   237     val vars = vars_of tm;

   238     val body = body_of tm;

   239     val rev_new_vars = rename_wrt_term body vars;

   240   in

   241     (map mark_boundT (rev rev_new_vars),

   242       subst_bounds (map (mark_bound o #1) rev_new_vars, body))

   243   end;

   246 (*do (partial) eta-contraction before printing*)

   248 val eta_contract = ref true;

   250 fun eta_contr tm =

   251   let

   252     fun is_aprop (Const ("_aprop", _)) = true

   253       | is_aprop _ = false;

   255     fun eta_abs (Abs (a, T, t)) =

   256           (case eta_abs t of

   257             t' as f $ u =>

   258               (case eta_abs u of

   259                 Bound 0 =>

   260                   if Term.loose_bvar1 (f, 0) orelse is_aprop f then Abs (a, T, t')

   261                   else  incr_boundvars ~1 f

   262               | _ => Abs (a, T, t'))

   263           | t' => Abs (a, T, t'))

   264       | eta_abs t = t;

   265   in

   266     if ! eta_contract then eta_abs tm else tm

   267   end;

   270 fun abs_tr' tm =

   271   foldr (fn (x, t) => Lexicon.const "_abs" $ x $ t)

   272     (strip_abss strip_abs_vars strip_abs_body (eta_contr tm));

   274 fun atomic_abs_tr' (x, T, t) =

   275   let val [xT] = rename_wrt_term t [(x, T)]

   276   in (mark_boundT xT, subst_bound (mark_bound (fst xT), t)) end;

   278 fun abs_ast_tr' (*"_abs"*) asts =

   279   (case Ast.unfold_ast_p "_abs" (Ast.Appl (Ast.Constant "_abs" :: asts)) of

   280     ([], _) => raise Ast.AST ("abs_ast_tr'", asts)

   281   | (xs, body) => Ast.Appl [Ast.Constant "_lambda", Ast.fold_ast "_pttrns" xs, body]);

   284 (* binder *)

   286 fun mk_binder_tr' (name, sy) =

   287   let

   288     fun mk_idts [] = raise Match    (*abort translation*)

   289       | mk_idts [idt] = idt

   290       | mk_idts (idt :: idts) = Lexicon.const "_idts" $ idt $ mk_idts idts;

   292     fun tr' t =

   293       let

   294         val (xs, bd) = strip_abss (strip_qnt_vars name) (strip_qnt_body name) t;

   295       in Lexicon.const sy $ mk_idts xs $ bd end;

   297     fun binder_tr' (*name*) (t :: ts) = Term.list_comb (tr' (Lexicon.const name $ t), ts)

   298       | binder_tr' (*name*) [] = raise Match;

   299   in

   300     (name, binder_tr')

   301   end;

   304 (* idtyp constraints *)

   306 fun idtyp_ast_tr' a [Ast.Appl [Ast.Constant c, x, ty], xs] =

   307       if c = SynExt.constrainC then

   308         Ast.Appl [ Ast.Constant a,  Ast.Appl [Ast.Constant "_idtyp", x, ty], xs]

   309       else raise Match

   310   | idtyp_ast_tr' _ _ = raise Match;

   313 (* meta propositions *)

   315 fun prop_tr' tm =

   316   let

   317     fun aprop t = Lexicon.const "_aprop" $ t;

   319     fun is_prop Ts t =

   320       fastype_of1 (Ts, t) = propT handle TERM _ => false;

   322     fun tr' _ (t as Const _) = t

   323       | tr' _ (t as Free (x, T)) =

   324           if T = propT then aprop (Lexicon.free x) else t

   325       | tr' _ (t as Var (xi, T)) =

   326           if T = propT then aprop (Lexicon.var xi) else t

   327       | tr' Ts (t as Bound _) =

   328           if is_prop Ts t then aprop t else t

   329       | tr' Ts (Abs (x, T, t)) = Abs (x, T, tr' (T :: Ts) t)

   330       | tr' Ts (t as t1 $ (t2 as Const ("TYPE", Type ("itself", [T])))) =

   331           if is_prop Ts t then Const ("_mk_ofclass", T) $ tr' Ts t1

   332           else tr' Ts t1 $ tr' Ts t2

   333       | tr' Ts (t as t1 $ t2) =

   334           (if is_Const (Term.head_of t) orelse not (is_prop Ts t)

   335             then I else aprop) (tr' Ts t1 $ tr' Ts t2);

   336   in

   337     tr' [] tm

   338   end;

   340 fun mk_ofclass_tr' show_sorts (*"_mk_ofclass"*) T [t] =

   341       Lexicon.const "_ofclass" $ TypeExt.term_of_typ show_sorts T $ t

   342   | mk_ofclass_tr' _ (*"_mk_ofclass"*) T ts = raise TYPE ("mk_ofclass_tr'", [T], ts);

   345 (* meta implication *)

   347 fun impl_ast_tr' (*"==>"*) asts =

   348   if TypeExt.no_brackets () then raise Match

   349   else

   350     (case Ast.unfold_ast_p "==>" (Ast.Appl (Ast.Constant "==>" :: asts)) of

   351       (asms as _ :: _ :: _, concl)

   352         => Ast.Appl [Ast.Constant "_bigimpl", Ast.fold_ast "_asms" asms, concl]

   353     | _ => raise Match);

   356 (* meta conjunction *)

   358 fun meta_conjunction_tr' (*"all"*)

   359       [Abs (_, _, Const ("==>", _) $

   360         (Const ("==>", _) $ A $ (Const ("==>", _) $ B $ (Const ("_aprop", _) $ Bound 0))) $

   361         (Const ("_aprop", _) $ Bound 0))] =

   362       if 0 mem_int Term.loose_bnos A orelse 0 mem_int Term.loose_bnos B then raise Match

   363       else Lexicon.const "_meta_conjunction" $ A $ B

   364   | meta_conjunction_tr' (*"all"*) ts = raise Match;

   367 (* type reflection *)

   369 fun type_tr' show_sorts (*"TYPE"*) (Type ("itself", [T])) ts =

   370       Term.list_comb (Lexicon.const "_TYPE" $ TypeExt.term_of_typ show_sorts T, ts)

   371   | type_tr' _ _ _ = raise Match;

   374 (* dependent / nondependent quantifiers *)

   376 fun variant_abs' (x, T, B) =

   377   let val x' = variant (add_term_names (B, [])) x in

   378     (x', subst_bound (mark_boundT (x', T), B))

   379   end;

   381 fun dependent_tr' (q, r) (A :: Abs (x, T, B) :: ts) =

   382       if Term.loose_bvar1 (B, 0) then

   383         let val (x', B') = variant_abs' (x, dummyT, B);

   384         in Term.list_comb (Lexicon.const q $ mark_boundT (x', T) $ A $ B', ts) end

   385       else Term.list_comb (Lexicon.const r $ A $ B, ts)

   386   | dependent_tr' _ _ = raise Match;

   389 (* quote / antiquote *)

   391 fun antiquote_tr' name =

   392   let

   393     fun tr' i (t $ u) =

   394       if u = Bound i then Lexicon.const name $ tr' i t

   395       else tr' i t $ tr' i u

   396       | tr' i (Abs (x, T, t)) = Abs (x, T, tr' (i + 1) t)

   397       | tr' i a = if a = Bound i then raise Match else a;

   398   in tr' 0 end;

   400 fun quote_tr' name (Abs (_, _, t)) = Term.incr_boundvars ~1 (antiquote_tr' name t)

   401   | quote_tr' _ _ = raise Match;

   403 fun quote_antiquote_tr' quoteN antiquoteN name =

   404   let

   405     fun tr' (t :: ts) = Term.list_comb (Lexicon.const quoteN $ quote_tr' antiquoteN t, ts)

   406       | tr' _ = raise Match;

   407   in (name, tr') end;

   410 (* indexed syntax *)

   412 fun index_ast_tr' (*"_index"*) [Ast.Appl [Ast.Constant "_struct", ast]] = ast

   413   | index_ast_tr' _ = raise Match;

   416 (* implicit structures *)

   418 fun the_struct' structs s =

   419   [(case Lexicon.read_nat s of

   420     Some i => Ast.Variable (the_struct structs i handle ERROR_MESSAGE _ => raise Match)

   421   | None => raise Match)] |> Ast.mk_appl (Ast.Constant "_free");

   422 ;

   424 fun struct_ast_tr' structs (*"_struct"*) [Ast.Constant "_indexdefault"] =

   425       the_struct' structs "1"

   426   | struct_ast_tr' structs (*"_struct"*) [Ast.Appl [Ast.Constant "_indexnum", Ast.Constant s]] =

   427       the_struct' structs s

   428   | struct_ast_tr' _ _ = raise Match;

   432 (** Pure translations **)

   434 val pure_trfuns =

   435  ([("_constify", constify_ast_tr), ("_appl", appl_ast_tr), ("_applC", applC_ast_tr),

   436    ("_lambda", lambda_ast_tr), ("_idtyp", idtyp_ast_tr), ("_bigimpl", bigimpl_ast_tr),

   437    ("_indexdefault", indexdefault_ast_tr), ("_indexnum", indexnum_ast_tr),

   438    ("_indexvar", indexvar_ast_tr), ("_struct", struct_ast_tr)],

   439   [("_abs", abs_tr), ("_aprop", aprop_tr), ("_ofclass", ofclass_tr),

   440    ("_TYPE", type_tr), ("_DDDOT", dddot_tr), ("_K", k_tr),

   441    ("_index", index_tr)],

   442   [("all", meta_conjunction_tr')],

   443   [("_abs", abs_ast_tr'), ("_idts", idtyp_ast_tr' "_idts"),

   444    ("_pttrns", idtyp_ast_tr' "_pttrns"), ("==>", impl_ast_tr'),

   445    ("_index", index_ast_tr')]);

   447 val pure_trfunsT =

   448   [("_mk_ofclass", mk_ofclass_tr'), ("TYPE", type_tr')];

   450 fun struct_trfuns structs =

   451   ([], [("_struct", struct_tr structs)], [], [("_struct", struct_ast_tr' structs)]);

   455 (** pts_to_asts **)

   457 exception TRANSLATION of string * exn;

   459 fun pts_to_asts trf pts =

   460   let

   461     fun trans a args =

   462       (case trf a of

   463         None => Ast.mk_appl (Ast.Constant a) args

   464       | Some f => f args handle exn => raise TRANSLATION (a, exn));

   466     (*translate pt bottom-up*)

   467     fun ast_of (Parser.Node (a, pts)) = trans a (map ast_of pts)

   468       | ast_of (Parser.Tip tok) = Ast.Variable (Lexicon.str_of_token tok);

   470     val exn_results = map (capture ast_of) pts;

   471     val exns = mapfilter get_exn exn_results;

   472     val results = mapfilter get_result exn_results

   473   in

   474     (case (results, exns) of

   475       ([], TRANSLATION (a, exn) :: _) =>

   476         (writeln ("Error in parse ast translation for " ^ quote a); raise exn)

   477     | _ => results)

   478   end;

   482 (** asts_to_terms **)

   484 fun asts_to_terms trf asts =

   485   let

   486     fun trans a args =

   487       (case trf a of

   488         None => Term.list_comb (Lexicon.const a, args)

   489       | Some f => f args handle exn => raise TRANSLATION (a, exn));

   491     fun term_of (Ast.Constant a) = trans a []

   492       | term_of (Ast.Variable x) = Lexicon.read_var x

   493       | term_of (Ast.Appl (Ast.Constant a :: (asts as _ :: _))) =

   494           trans a (map term_of asts)

   495       | term_of (Ast.Appl (ast :: (asts as _ :: _))) =

   496           Term.list_comb (term_of ast, map term_of asts)

   497       | term_of (ast as Ast.Appl _) = raise Ast.AST ("ast_to_term: malformed ast", [ast]);

   499     val exn_results = map (capture term_of) asts;

   500     val exns = mapfilter get_exn exn_results;

   501     val results = mapfilter get_result exn_results

   502   in

   503     (case (results, exns) of

   504       ([], TRANSLATION (a, exn) :: _) =>

   505         (writeln ("Error in parse translation for " ^ quote a); raise exn)

   506     | _ => results)

   507   end;

   509 end;

author	wenzelm
	Sat, 05 Jun 2004 13:06:04 +0200
changeset 14868	617e4b19a2e5
parent 14798	702cb4859cab
child 14981	e73f8140af78
permissions	-rw-r--r--