src/Pure/Isar/element.ML
author wenzelm
Tue Mar 14 16:29:36 2006 +0100 (2006-03-14)
changeset 19259 196d3b7c8ad1
parent 18906 2487aea6ff12
child 19267 fdb4658eab26
permissions -rw-r--r--
added pretty_stmt;
tuned;
wenzelm@18140
     1
(*  Title:      Pure/Isar/element.ML
wenzelm@18140
     2
    ID:         $Id$
wenzelm@18140
     3
    Author:     Makarius
wenzelm@18140
     4
wenzelm@18140
     5
Explicit data structures for some Isar language elements.
wenzelm@18140
     6
*)
wenzelm@18140
     7
wenzelm@18140
     8
signature ELEMENT =
wenzelm@18140
     9
sig
wenzelm@19259
    10
  datatype ('typ, 'term) stmt =
wenzelm@19259
    11
    Shows of ((string * Attrib.src list) * ('term * ('term list * 'term list)) list) list |
wenzelm@19259
    12
    Obtains of (string * ((string * 'typ option) list * 'term list)) list
wenzelm@19259
    13
  type statement  (*= (string, string) stmt*)
wenzelm@19259
    14
  type statement_i  (*= (typ, term) stmt*)
wenzelm@18140
    15
  datatype ('typ, 'term, 'fact) ctxt =
wenzelm@18669
    16
    Fixes of (string * 'typ option * mixfix) list |
wenzelm@18140
    17
    Constrains of (string * 'typ) list |
wenzelm@18140
    18
    Assumes of ((string * Attrib.src list) * ('term * ('term list * 'term list)) list) list |
wenzelm@18140
    19
    Defines of ((string * Attrib.src list) * ('term * 'term list)) list |
wenzelm@18140
    20
    Notes of ((string * Attrib.src list) * ('fact * Attrib.src list) list) list
wenzelm@18140
    21
  type context (*= (string, string, thmref) ctxt*)
wenzelm@18140
    22
  type context_i (*= (typ, term, thm list) ctxt*)
wenzelm@18140
    23
  val map_ctxt: {name: string -> string,
wenzelm@18669
    24
    var: string * mixfix -> string * mixfix,
wenzelm@18140
    25
    typ: 'typ -> 'a, term: 'term -> 'b, fact: 'fact -> 'c,
wenzelm@18140
    26
    attrib: Attrib.src -> Attrib.src} -> ('typ, 'term, 'fact) ctxt -> ('a, 'b, 'c) ctxt
wenzelm@18140
    27
  val map_ctxt_values: (typ -> typ) -> (term -> term) -> (thm -> thm) -> context_i -> context_i
wenzelm@18140
    28
  val rename: (string * (string * mixfix option)) list -> string -> string
wenzelm@18669
    29
  val rename_var: (string * (string * mixfix option)) list -> string * mixfix -> string * mixfix
wenzelm@18140
    30
  val rename_term: (string * (string * mixfix option)) list -> term -> term
wenzelm@18140
    31
  val rename_thm: (string * (string * mixfix option)) list -> thm -> thm
wenzelm@18140
    32
  val rename_ctxt: (string * (string * mixfix option)) list -> context_i -> context_i
wenzelm@18140
    33
  val instT_type: typ Symtab.table -> typ -> typ
wenzelm@18140
    34
  val instT_term: typ Symtab.table -> term -> term
wenzelm@18140
    35
  val instT_thm: theory -> typ Symtab.table -> thm -> thm
wenzelm@18140
    36
  val instT_ctxt: theory -> typ Symtab.table -> context_i -> context_i
wenzelm@18140
    37
  val inst_term: typ Symtab.table * term Symtab.table -> term -> term
wenzelm@18140
    38
  val inst_thm: theory -> typ Symtab.table * term Symtab.table -> thm -> thm
wenzelm@18140
    39
  val inst_ctxt: theory -> typ Symtab.table * term Symtab.table -> context_i -> context_i
wenzelm@19259
    40
  val pretty_stmt: ProofContext.context -> statement_i -> Pretty.T list
wenzelm@19259
    41
  val pretty_ctxt: ProofContext.context -> context_i -> Pretty.T list
wenzelm@18140
    42
end;
wenzelm@18140
    43
wenzelm@18140
    44
structure Element: ELEMENT =
wenzelm@18140
    45
struct
wenzelm@18140
    46
wenzelm@19259
    47
wenzelm@19259
    48
(** conclusions **)
wenzelm@19259
    49
wenzelm@19259
    50
datatype ('typ, 'term) stmt =
wenzelm@19259
    51
  Shows of ((string * Attrib.src list) * ('term * ('term list * 'term list)) list) list |
wenzelm@19259
    52
  Obtains of (string * ((string * 'typ option) list * 'term list)) list;
wenzelm@19259
    53
wenzelm@19259
    54
type statement = (string, string) stmt;
wenzelm@19259
    55
type statement_i = (typ, term) stmt;
wenzelm@19259
    56
wenzelm@19259
    57
wenzelm@19259
    58
wenzelm@18140
    59
(** context elements **)
wenzelm@18140
    60
wenzelm@18140
    61
(* datatype ctxt *)
wenzelm@18140
    62
wenzelm@18140
    63
datatype ('typ, 'term, 'fact) ctxt =
wenzelm@18669
    64
  Fixes of (string * 'typ option * mixfix) list |
wenzelm@18140
    65
  Constrains of (string * 'typ) list |
wenzelm@18140
    66
  Assumes of ((string * Attrib.src list) * ('term * ('term list * 'term list)) list) list |
wenzelm@18140
    67
  Defines of ((string * Attrib.src list) * ('term * 'term list)) list |
wenzelm@18140
    68
  Notes of ((string * Attrib.src list) * ('fact * Attrib.src list) list) list;
wenzelm@18140
    69
wenzelm@18140
    70
type context = (string, string, thmref) ctxt;
wenzelm@18140
    71
type context_i = (typ, term, thm list) ctxt;
wenzelm@18140
    72
wenzelm@18140
    73
fun map_ctxt {name, var, typ, term, fact, attrib} =
wenzelm@18140
    74
  fn Fixes fixes => Fixes (fixes |> map (fn (x, T, mx) =>
wenzelm@18140
    75
       let val (x', mx') = var (x, mx) in (x', Option.map typ T, mx') end))
wenzelm@18669
    76
   | Constrains xs => Constrains (xs |> map (fn (x, T) => (#1 (var (x, NoSyn)), typ T)))
wenzelm@18140
    77
   | Assumes asms => Assumes (asms |> map (fn ((a, atts), propps) =>
wenzelm@18140
    78
      ((name a, map attrib atts), propps |> map (fn (t, (ps, qs)) =>
wenzelm@18140
    79
        (term t, (map term ps, map term qs))))))
wenzelm@18140
    80
   | Defines defs => Defines (defs |> map (fn ((a, atts), (t, ps)) =>
wenzelm@18140
    81
      ((name a, map attrib atts), (term t, map term ps))))
wenzelm@18140
    82
   | Notes facts => Notes (facts |> map (fn ((a, atts), bs) =>
wenzelm@18140
    83
      ((name a, map attrib atts), bs |> map (fn (ths, btts) => (fact ths, map attrib btts)))));
wenzelm@18140
    84
wenzelm@18140
    85
fun map_ctxt_values typ term thm = map_ctxt
wenzelm@18140
    86
  {name = I, var = I, typ = typ, term = term, fact = map thm,
wenzelm@18140
    87
    attrib = Args.map_values I typ term thm};
wenzelm@18140
    88
wenzelm@18140
    89
wenzelm@18140
    90
wenzelm@18140
    91
(** logical operations **)
wenzelm@18140
    92
wenzelm@18140
    93
(* derived rules *)
wenzelm@18140
    94
wenzelm@18140
    95
fun instantiate_tfrees thy subst =
wenzelm@18140
    96
  let
wenzelm@18140
    97
    val certT = Thm.ctyp_of thy;
wenzelm@18140
    98
    fun inst vs (a, T) = AList.lookup (op =) vs a
wenzelm@18140
    99
      |> Option.map (fn v => (certT (TVar v), certT T));
wenzelm@18140
   100
  in
wenzelm@18140
   101
    Drule.tvars_intr_list (map fst subst) #->
wenzelm@18140
   102
    (fn vs => Thm.instantiate (List.mapPartial (inst vs) subst, []))
wenzelm@18140
   103
  end;
wenzelm@18140
   104
wenzelm@18140
   105
fun instantiate_frees thy subst =
wenzelm@18140
   106
  let val cert = Thm.cterm_of thy in
wenzelm@18140
   107
    Drule.forall_intr_list (map (cert o Free o fst) subst) #>
wenzelm@18140
   108
    Drule.forall_elim_list (map (cert o snd) subst)
wenzelm@18140
   109
  end;
wenzelm@18140
   110
wenzelm@18140
   111
fun hyps_rule rule th =
wenzelm@18140
   112
  let
wenzelm@18140
   113
    val cterm_rule = Thm.reflexive #> rule #> Thm.cprop_of #> Drule.dest_equals #> #1;
wenzelm@18140
   114
    val {hyps, ...} = Thm.crep_thm th;
wenzelm@18140
   115
  in
wenzelm@18140
   116
    Drule.implies_elim_list
wenzelm@18140
   117
      (rule (Drule.implies_intr_list hyps th))
wenzelm@18140
   118
      (map (Thm.assume o cterm_rule) hyps)
wenzelm@18140
   119
  end;
wenzelm@18140
   120
wenzelm@18140
   121
wenzelm@18140
   122
(* renaming *)
wenzelm@18140
   123
wenzelm@18140
   124
fun rename ren x =
wenzelm@18140
   125
  (case AList.lookup (op =) ren (x: string) of
wenzelm@18140
   126
    NONE => x
wenzelm@18140
   127
  | SOME (x', _) => x');
wenzelm@18140
   128
wenzelm@18140
   129
fun rename_var ren (x, mx) =
wenzelm@18669
   130
  (case (AList.lookup (op =) ren (x: string), mx) of
wenzelm@18140
   131
    (NONE, _) => (x, mx)
wenzelm@18669
   132
  | (SOME (x', NONE), Structure) => (x', mx)
wenzelm@18669
   133
  | (SOME (x', SOME _), Structure) =>
wenzelm@18669
   134
      error ("Attempt to change syntax of structure parameter " ^ quote x)
wenzelm@18669
   135
  | (SOME (x', NONE), _) => (x', NoSyn)
wenzelm@18669
   136
  | (SOME (x', SOME mx'), _) => (x', mx'));
wenzelm@18140
   137
wenzelm@18140
   138
fun rename_term ren (Free (x, T)) = Free (rename ren x, T)
wenzelm@18140
   139
  | rename_term ren (t $ u) = rename_term ren t $ rename_term ren u
wenzelm@18140
   140
  | rename_term ren (Abs (x, T, t)) = Abs (x, T, rename_term ren t)
wenzelm@18140
   141
  | rename_term _ a = a;
wenzelm@18140
   142
wenzelm@18140
   143
fun rename_thm ren th =
wenzelm@18140
   144
  let
wenzelm@18140
   145
    val subst = Drule.frees_of th
wenzelm@18140
   146
      |> List.mapPartial (fn (x, T) =>
wenzelm@18140
   147
        let val x' = rename ren x
wenzelm@18140
   148
        in if x = x' then NONE else SOME ((x, T), (Free (x', T))) end);
wenzelm@18140
   149
  in
wenzelm@18140
   150
    if null subst then th
wenzelm@18140
   151
    else th |> hyps_rule (instantiate_frees (Thm.theory_of_thm th) subst)
wenzelm@18140
   152
  end;
wenzelm@18140
   153
wenzelm@18140
   154
fun rename_ctxt ren =
wenzelm@18140
   155
  map_ctxt_values I (rename_term ren) (rename_thm ren)
wenzelm@18140
   156
  #> map_ctxt {name = I, typ = I, term = I, fact = I, attrib = I, var = rename_var ren};
wenzelm@18140
   157
wenzelm@18140
   158
wenzelm@18140
   159
(* type instantiation *)
wenzelm@18140
   160
wenzelm@18140
   161
fun instT_type env =
wenzelm@18140
   162
  if Symtab.is_empty env then I
wenzelm@18140
   163
  else Term.map_type_tfree (fn (x, S) => the_default (TFree (x, S)) (Symtab.lookup env x));
wenzelm@18140
   164
wenzelm@18140
   165
fun instT_term env =
wenzelm@18140
   166
  if Symtab.is_empty env then I
wenzelm@18140
   167
  else Term.map_term_types (instT_type env);
wenzelm@18140
   168
wenzelm@18140
   169
fun instT_subst env th =
wenzelm@18140
   170
  Drule.tfrees_of th
wenzelm@18140
   171
  |> List.mapPartial (fn (a, S) =>
wenzelm@18140
   172
    let
wenzelm@18140
   173
      val T = TFree (a, S);
wenzelm@18140
   174
      val T' = the_default T (Symtab.lookup env a);
wenzelm@18140
   175
    in if T = T' then NONE else SOME (a, T') end);
wenzelm@18140
   176
wenzelm@18140
   177
fun instT_thm thy env th =
wenzelm@18140
   178
  if Symtab.is_empty env then th
wenzelm@18140
   179
  else
wenzelm@18140
   180
    let val subst = instT_subst env th
wenzelm@18140
   181
    in if null subst then th else th |> hyps_rule (instantiate_tfrees thy subst) end;
wenzelm@18140
   182
wenzelm@18140
   183
fun instT_ctxt thy env =
wenzelm@18140
   184
  map_ctxt_values (instT_type env) (instT_term env) (instT_thm thy env);
wenzelm@18140
   185
wenzelm@18140
   186
wenzelm@18140
   187
(* type and term instantiation *)
wenzelm@18140
   188
wenzelm@18140
   189
fun inst_term (envT, env) =
wenzelm@18140
   190
  if Symtab.is_empty env then instT_term envT
wenzelm@18140
   191
  else
wenzelm@18140
   192
    let
wenzelm@18140
   193
      val instT = instT_type envT;
wenzelm@18140
   194
      fun inst (Const (x, T)) = Const (x, instT T)
wenzelm@18140
   195
        | inst (Free (x, T)) =
wenzelm@18140
   196
            (case Symtab.lookup env x of
wenzelm@18140
   197
              NONE => Free (x, instT T)
wenzelm@18140
   198
            | SOME t => t)
wenzelm@18140
   199
        | inst (Var (xi, T)) = Var (xi, instT T)
wenzelm@18140
   200
        | inst (b as Bound _) = b
wenzelm@18140
   201
        | inst (Abs (x, T, t)) = Abs (x, instT T, inst t)
wenzelm@18140
   202
        | inst (t $ u) = inst t $ inst u;
wenzelm@18140
   203
    in Envir.beta_norm o inst end;
wenzelm@18140
   204
wenzelm@18140
   205
fun inst_thm thy (envT, env) th =
wenzelm@18140
   206
  if Symtab.is_empty env then instT_thm thy envT th
wenzelm@18140
   207
  else
wenzelm@18140
   208
    let
wenzelm@18140
   209
      val substT = instT_subst envT th;
wenzelm@18140
   210
      val subst = Drule.frees_of th
wenzelm@18140
   211
        |> List.mapPartial (fn (x, T) =>
wenzelm@18140
   212
          let
wenzelm@18140
   213
            val T' = instT_type envT T;
wenzelm@18140
   214
            val t = Free (x, T');
wenzelm@18140
   215
            val t' = the_default t (Symtab.lookup env x);
wenzelm@18140
   216
          in if t aconv t' then NONE else SOME ((x, T'), t') end);
wenzelm@18140
   217
    in
wenzelm@18140
   218
      if null substT andalso null subst then th
wenzelm@18140
   219
      else th |> hyps_rule
wenzelm@18140
   220
       (instantiate_tfrees thy substT #>
wenzelm@18140
   221
        instantiate_frees thy subst #>
wenzelm@18140
   222
        Drule.fconv_rule (Thm.beta_conversion true))
wenzelm@18140
   223
    end;
wenzelm@18140
   224
wenzelm@18140
   225
fun inst_ctxt thy envs =
wenzelm@18140
   226
  map_ctxt_values (instT_type (#1 envs)) (inst_term envs) (inst_thm thy envs);
wenzelm@18140
   227
wenzelm@18894
   228
wenzelm@18894
   229
wenzelm@19259
   230
(** pretty printing **)
wenzelm@19259
   231
wenzelm@19259
   232
fun pretty_items _ _ _ [] = []
wenzelm@19259
   233
  | pretty_items ctxt sep prfx (x :: xs) =
wenzelm@19259
   234
      Pretty.block [Pretty.str prfx, Pretty.brk 1, x] :: pretty_items ctxt sep ("  " ^ sep) xs;
wenzelm@19259
   235
wenzelm@19259
   236
fun pretty_name_atts ctxt (name, atts) sep =
wenzelm@19259
   237
  if name = "" andalso null atts then []
wenzelm@19259
   238
  else [Pretty.block (Pretty.breaks (Pretty.str (ProofContext.extern_thm ctxt name) ::
wenzelm@19259
   239
    Args.pretty_attribs ctxt atts @ [Pretty.str sep]))];
wenzelm@19259
   240
wenzelm@19259
   241
wenzelm@19259
   242
(* pretty_stmt *)
wenzelm@19259
   243
wenzelm@19259
   244
fun pretty_stmt ctxt =
wenzelm@19259
   245
  let
wenzelm@19259
   246
    val prt_typ = Pretty.quote o ProofContext.pretty_typ ctxt;
wenzelm@19259
   247
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
wenzelm@19259
   248
    val prt_name_atts = pretty_name_atts ctxt;
wenzelm@19259
   249
wenzelm@19259
   250
    fun prt_show (a, ts) =
wenzelm@19259
   251
      Pretty.block (Pretty.breaks (prt_name_atts a ":" @ map (prt_term o fst) ts));
wenzelm@19259
   252
wenzelm@19259
   253
    fun prt_var (x, SOME T) = Pretty.block [Pretty.str (x ^ " ::"), Pretty.brk 1, prt_typ T]
wenzelm@19259
   254
      | prt_var (x, NONE) = Pretty.str x;
wenzelm@19259
   255
wenzelm@19259
   256
    fun prt_obtain (_, ([], ts)) = Pretty.block (Pretty.breaks (map prt_term ts))
wenzelm@19259
   257
      | prt_obtain (_, (xs, ts)) = Pretty.block (Pretty.breaks
wenzelm@19259
   258
          (map prt_var xs @ [Pretty.str "where"] @ map prt_term ts));
wenzelm@19259
   259
  in
wenzelm@19259
   260
    fn Shows shows => pretty_items ctxt "and" "shows" (map prt_show shows)
wenzelm@19259
   261
     | Obtains obtains => pretty_items ctxt "|" "obtains" (map prt_obtain obtains)
wenzelm@19259
   262
  end;
wenzelm@19259
   263
wenzelm@18894
   264
wenzelm@19259
   265
(* pretty_ctxt *)
wenzelm@19259
   266
wenzelm@19259
   267
fun pretty_ctxt ctxt =
wenzelm@19259
   268
  let
wenzelm@19259
   269
    val prt_typ = Pretty.quote o ProofContext.pretty_typ ctxt;
wenzelm@19259
   270
    val prt_term = Pretty.quote o ProofContext.pretty_term ctxt;
wenzelm@19259
   271
    val prt_thm = Pretty.backquote o ProofContext.pretty_thm ctxt;
wenzelm@19259
   272
    val prt_name_atts = pretty_name_atts ctxt;
wenzelm@19259
   273
    val prt_items = pretty_items ctxt "and";
wenzelm@19259
   274
wenzelm@19259
   275
    fun prt_mixfix mx =
wenzelm@19259
   276
      let val s = Syntax.string_of_mixfix mx
wenzelm@19259
   277
      in if s = "" then [] else [Pretty.brk 2, Pretty.str s] end;
wenzelm@19259
   278
    fun prt_fix (x, SOME T, mx) = Pretty.block (Pretty.str (x ^ " ::") :: Pretty.brk 1 ::
wenzelm@19259
   279
          prt_typ T :: Pretty.brk 1 :: prt_mixfix mx)
wenzelm@19259
   280
      | prt_fix (x, NONE, mx) = Pretty.block (Pretty.str x :: Pretty.brk 1 :: prt_mixfix mx);
wenzelm@19259
   281
    fun prt_constrain (x, T) = prt_fix (x, SOME T, NoSyn);
wenzelm@18894
   282
wenzelm@19259
   283
    fun prt_asm (a, ts) =
wenzelm@19259
   284
      Pretty.block (Pretty.breaks (prt_name_atts a ":" @ map (prt_term o fst) ts));
wenzelm@19259
   285
    fun prt_def (a, (t, _)) =
wenzelm@19259
   286
      Pretty.block (Pretty.breaks (prt_name_atts a ":" @ [prt_term t]));
wenzelm@19259
   287
wenzelm@19259
   288
    fun prt_fact (ths, []) = map prt_thm ths
wenzelm@19259
   289
      | prt_fact (ths, atts) = Pretty.enclose "(" ")"
wenzelm@19259
   290
          (Pretty.breaks (map prt_thm ths)) :: Args.pretty_attribs ctxt atts;
wenzelm@19259
   291
    fun prt_note (a, ths) =
wenzelm@19259
   292
      Pretty.block (Pretty.breaks (List.concat (prt_name_atts a "=" :: map prt_fact ths)));
wenzelm@19259
   293
  in
wenzelm@19259
   294
    fn Fixes fixes => prt_items "fixes" (map prt_fix fixes)
wenzelm@19259
   295
     | Constrains xs => prt_items "constrains" (map prt_constrain xs)
wenzelm@19259
   296
     | Assumes asms => prt_items "assumes" (map prt_asm asms)
wenzelm@19259
   297
     | Defines defs => prt_items "defines" (map prt_def defs)
wenzelm@19259
   298
     | Notes facts => prt_items "notes" (map prt_note facts)
wenzelm@19259
   299
  end;
wenzelm@18894
   300
wenzelm@18140
   301
end;