src/Pure/Proof/proof_syntax.ML
author wenzelm
Tue May 31 11:53:40 2005 +0200 (2005-05-31)
changeset 16149 d8cac577493c
parent 15574 b1d1b5bfc464
child 16182 a5c77d298ad7
permissions -rw-r--r--
Theory.restore_naming;
tuned fold;
berghofe@11522
     1
(*  Title:      Pure/Proof/proof_syntax.ML
berghofe@11522
     2
    ID:         $Id$
wenzelm@11539
     3
    Author:     Stefan Berghofer, TU Muenchen
berghofe@11522
     4
berghofe@11522
     5
Function for parsing and printing proof terms.
berghofe@11522
     6
*)
berghofe@11522
     7
berghofe@11522
     8
signature PROOF_SYNTAX =
berghofe@11522
     9
sig
berghofe@11522
    10
  val proofT : typ
berghofe@11522
    11
  val add_proof_syntax : Sign.sg -> Sign.sg
berghofe@11522
    12
  val disambiguate_names : theory -> Proofterm.proof ->
berghofe@11522
    13
    Proofterm.proof * Proofterm.proof Symtab.table
berghofe@11522
    14
  val proof_of_term : theory -> Proofterm.proof Symtab.table ->
berghofe@11522
    15
    bool -> term -> Proofterm.proof
berghofe@11522
    16
  val term_of_proof : Proofterm.proof -> term
berghofe@11522
    17
  val cterm_of_proof : theory -> Proofterm.proof -> cterm * (cterm -> Proofterm.proof)
berghofe@11522
    18
  val read_term : theory -> typ -> string -> term
berghofe@11522
    19
  val read_proof : theory -> bool -> string -> Proofterm.proof
berghofe@11522
    20
  val pretty_proof : Sign.sg -> Proofterm.proof -> Pretty.T
berghofe@11522
    21
  val pretty_proof_of : bool -> thm -> Pretty.T
berghofe@11522
    22
  val print_proof_of : bool -> thm -> unit
berghofe@11522
    23
end;
berghofe@11522
    24
berghofe@11522
    25
structure ProofSyntax : PROOF_SYNTAX =
berghofe@11522
    26
struct
berghofe@11522
    27
berghofe@11522
    28
open Proofterm;
berghofe@11522
    29
berghofe@11522
    30
(**** add special syntax for embedding proof terms ****)
berghofe@11522
    31
berghofe@11522
    32
val proofT = Type ("proof", []);
berghofe@11614
    33
val paramT = Type ("param", []);
berghofe@11614
    34
val paramsT = Type ("params", []);
berghofe@11522
    35
val idtT = Type ("idt", []);
wenzelm@14854
    36
val aT = TFree ("'a", []);
berghofe@11522
    37
berghofe@11522
    38
(** constants for theorems and axioms **)
berghofe@11522
    39
berghofe@11522
    40
fun add_prefix a b = NameSpace.pack (a :: NameSpace.unpack b);
berghofe@11522
    41
berghofe@11522
    42
fun add_proof_atom_consts names sg = Sign.add_consts_i
berghofe@11522
    43
  (map (fn name => (name, proofT, NoSyn)) names) (Sign.add_path "//" sg);
berghofe@11522
    44
berghofe@11522
    45
(** constants for application and abstraction **)
berghofe@11614
    46
berghofe@11522
    47
fun add_proof_syntax sg =
berghofe@11522
    48
  sg
berghofe@11522
    49
  |> Sign.copy
berghofe@11522
    50
  |> Sign.add_path "/"
wenzelm@14854
    51
  |> Sign.add_defsort_i []
berghofe@11522
    52
  |> Sign.add_types [("proof", 0, NoSyn)]
berghofe@11522
    53
  |> Sign.add_consts_i
berghofe@11614
    54
      [("Appt", [proofT, aT] ---> proofT, Mixfix ("(1_ %/ _)", [4, 5], 4)),
berghofe@11614
    55
       ("AppP", [proofT, proofT] ---> proofT, Mixfix ("(1_ %%/ _)", [4, 5], 4)),
berghofe@11522
    56
       ("Abst", (aT --> proofT) --> proofT, NoSyn),
berghofe@13199
    57
       ("AbsP", [propT, proofT --> proofT] ---> proofT, NoSyn),
berghofe@13199
    58
       ("Hyp", propT --> proofT, NoSyn),
berghofe@13199
    59
       ("Oracle", propT --> proofT, NoSyn),
berghofe@13199
    60
       ("MinProof", proofT, Delimfix "?")]
berghofe@11614
    61
  |> Sign.add_nonterminals ["param", "params"]
berghofe@11522
    62
  |> Sign.add_syntax_i
berghofe@11640
    63
      [("_Lam", [paramsT, proofT] ---> proofT, Mixfix ("(1Lam _./ _)", [0, 3], 3)),
berghofe@11614
    64
       ("_Lam0", [paramT, paramsT] ---> paramsT, Mixfix ("_/ _", [1, 0], 0)),
berghofe@11614
    65
       ("_Lam0", [idtT, paramsT] ---> paramsT, Mixfix ("_/ _", [1, 0], 0)),
berghofe@11614
    66
       ("_Lam1", [idtT, propT] ---> paramT, Mixfix ("_: _", [0, 0], 0)),
berghofe@11614
    67
       ("", paramT --> paramT, Delimfix "'(_')"),
berghofe@11614
    68
       ("", idtT --> paramsT, Delimfix "_"),
berghofe@11614
    69
       ("", paramT --> paramsT, Delimfix "_")]
berghofe@11522
    70
  |> Sign.add_modesyntax_i (("xsymbols", true),
berghofe@11640
    71
      [("_Lam", [paramsT, proofT] ---> proofT, Mixfix ("(1\\<Lambda>_./ _)", [0, 3], 3)),
berghofe@11522
    72
       ("Appt", [proofT, aT] ---> proofT, Mixfix ("(1_ \\<cdot>/ _)", [4, 5], 4)),
berghofe@11522
    73
       ("AppP", [proofT, proofT] ---> proofT, Mixfix ("(1_ \\<bullet>/ _)", [4, 5], 4))])
wenzelm@11839
    74
  |> Sign.add_modesyntax_i (("latex", false),
wenzelm@11839
    75
      [("_Lam", [paramsT, proofT] ---> proofT, Mixfix ("(1\\<^bold>\\<lambda>_./ _)", [0, 3], 3))])
berghofe@11522
    76
  |> Sign.add_trrules_i (map Syntax.ParsePrintRule
berghofe@11522
    77
      [(Syntax.mk_appl (Constant "_Lam")
berghofe@11614
    78
          [Syntax.mk_appl (Constant "_Lam0") [Variable "l", Variable "m"], Variable "A"],
berghofe@11614
    79
        Syntax.mk_appl (Constant "_Lam")
berghofe@11614
    80
          [Variable "l", Syntax.mk_appl (Constant "_Lam") [Variable "m", Variable "A"]]),
berghofe@11614
    81
       (Syntax.mk_appl (Constant "_Lam")
berghofe@11522
    82
          [Syntax.mk_appl (Constant "_Lam1") [Variable "x", Variable "A"], Variable "B"],
berghofe@11522
    83
        Syntax.mk_appl (Constant "AbsP") [Variable "A",
berghofe@11522
    84
          (Syntax.mk_appl (Constant "_abs") [Variable "x", Variable "B"])]),
berghofe@11614
    85
       (Syntax.mk_appl (Constant "_Lam") [Variable "x", Variable "A"],
berghofe@11522
    86
        Syntax.mk_appl (Constant "Abst")
berghofe@11614
    87
          [(Syntax.mk_appl (Constant "_abs") [Variable "x", Variable "A"])])]);
berghofe@11522
    88
berghofe@11522
    89
berghofe@11522
    90
(**** create unambiguous theorem names ****)
berghofe@11522
    91
berghofe@11522
    92
fun disambiguate_names thy prf =
berghofe@11522
    93
  let
berghofe@11522
    94
    val thms = thms_of_proof Symtab.empty prf;
skalberg@15570
    95
    val thms' = map (apsnd (#prop o rep_thm)) (List.concat
berghofe@11522
    96
      (map PureThy.thms_of (thy :: Theory.ancestors_of thy)));
berghofe@11522
    97
berghofe@11522
    98
    val tab = Symtab.foldl (fn (tab, (key, ps)) =>
skalberg@15570
    99
      let val prop = getOpt (assoc (thms', key), Bound 0)
skalberg@15574
   100
      in fst (foldr (fn ((prop', prf), x as (tab, i)) =>
berghofe@11522
   101
        if prop <> prop' then
berghofe@11522
   102
          (Symtab.update ((key ^ "_" ^ string_of_int i, prf), tab), i+1)
skalberg@15574
   103
        else x) (tab, 1) ps)
berghofe@11522
   104
      end) (Symtab.empty, thms);
berghofe@11522
   105
berghofe@11522
   106
    fun rename (Abst (s, T, prf)) = Abst (s, T, rename prf)
berghofe@11522
   107
      | rename (AbsP (s, t, prf)) = AbsP (s, t, rename prf)
berghofe@11614
   108
      | rename (prf1 %% prf2) = rename prf1 %% rename prf2
berghofe@11614
   109
      | rename (prf % t) = rename prf % t
berghofe@11522
   110
      | rename (prf' as PThm ((s, tags), prf, prop, Ts)) =
berghofe@11522
   111
          let
skalberg@15570
   112
            val prop' = getOpt (assoc (thms', s), Bound 0);
skalberg@15570
   113
            val ps = map fst (valOf (Symtab.lookup (thms, s))) \ prop'
berghofe@11522
   114
          in if prop = prop' then prf' else
berghofe@11522
   115
            PThm ((s ^ "_" ^ string_of_int (length ps - find_index_eq prop ps), tags),
berghofe@11522
   116
              prf, prop, Ts)
berghofe@11522
   117
          end
berghofe@11522
   118
      | rename prf = prf
berghofe@11522
   119
berghofe@11522
   120
  in (rename prf, tab) end;
berghofe@11522
   121
berghofe@11522
   122
berghofe@11522
   123
(**** translation between proof terms and pure terms ****)
berghofe@11522
   124
berghofe@11522
   125
fun proof_of_term thy tab ty =
berghofe@11522
   126
  let
berghofe@11522
   127
    val thys = thy :: Theory.ancestors_of thy;
skalberg@15570
   128
    val thms = List.concat (map thms_of thys);
skalberg@15570
   129
    val axms = List.concat (map (Symtab.dest o #axioms o rep_theory) thys);
berghofe@11522
   130
berghofe@11614
   131
    fun mk_term t = (if ty then I else map_term_types (K dummyT))
berghofe@11614
   132
      (Term.no_dummy_patterns t);
berghofe@11614
   133
berghofe@11522
   134
    fun prf_of [] (Bound i) = PBound i
berghofe@11522
   135
      | prf_of Ts (Const (s, Type ("proof", _))) =
skalberg@15531
   136
          change_type (if ty then SOME Ts else NONE)
berghofe@11522
   137
            (case NameSpace.unpack s of
berghofe@11614
   138
               "axm" :: xs =>
berghofe@11522
   139
                 let
berghofe@11522
   140
                   val name = NameSpace.pack xs;
berghofe@11522
   141
                   val prop = (case assoc (axms, name) of
skalberg@15531
   142
                       SOME prop => prop
skalberg@15531
   143
                     | NONE => error ("Unknown axiom " ^ quote name))
skalberg@15531
   144
                 in PAxm (name, prop, NONE) end
berghofe@11614
   145
             | "thm" :: xs =>
berghofe@11522
   146
                 let val name = NameSpace.pack xs;
berghofe@11522
   147
                 in (case assoc (thms, name) of
skalberg@15531
   148
                     SOME thm => fst (strip_combt (Thm.proof_of thm))
skalberg@15531
   149
                   | NONE => (case Symtab.lookup (tab, name) of
skalberg@15531
   150
                         SOME prf => prf
skalberg@15531
   151
                       | NONE => error ("Unknown theorem " ^ quote name)))
berghofe@11522
   152
                 end
berghofe@11522
   153
             | _ => error ("Illegal proof constant name: " ^ quote s))
berghofe@13199
   154
      | prf_of Ts (Const ("Hyp", _) $ prop) = Hyp prop
berghofe@11522
   155
      | prf_of Ts (v as Var ((_, Type ("proof", _)))) = Hyp v
berghofe@11522
   156
      | prf_of [] (Const ("Abst", _) $ Abs (s, T, prf)) =
skalberg@15531
   157
          Abst (s, if ty then SOME T else NONE,
berghofe@11522
   158
            incr_pboundvars (~1) 0 (prf_of [] prf))
berghofe@11522
   159
      | prf_of [] (Const ("AbsP", _) $ t $ Abs (s, _, prf)) =
berghofe@11614
   160
          AbsP (s, case t of
skalberg@15531
   161
                Const ("dummy_pattern", _) => NONE
skalberg@15531
   162
              | _ $ Const ("dummy_pattern", _) => NONE
skalberg@15531
   163
              | _ => SOME (mk_term t),
berghofe@11522
   164
            incr_pboundvars 0 (~1) (prf_of [] prf))
berghofe@11522
   165
      | prf_of [] (Const ("AppP", _) $ prf1 $ prf2) =
berghofe@11614
   166
          prf_of [] prf1 %% prf_of [] prf2
berghofe@11522
   167
      | prf_of Ts (Const ("Appt", _) $ prf $ Const ("TYPE", Type (_, [T]))) =
berghofe@11522
   168
          prf_of (T::Ts) prf
berghofe@11614
   169
      | prf_of [] (Const ("Appt", _) $ prf $ t) = prf_of [] prf %
skalberg@15531
   170
          (case t of Const ("dummy_pattern", _) => NONE | _ => SOME (mk_term t))
berghofe@11522
   171
      | prf_of _ t = error ("Not a proof term:\n" ^
berghofe@11522
   172
          Sign.string_of_term (sign_of thy) t)
berghofe@11522
   173
berghofe@11522
   174
  in prf_of [] end;
berghofe@11522
   175
berghofe@11522
   176
berghofe@11522
   177
val AbsPt = Const ("AbsP", [propT, proofT --> proofT] ---> proofT);
berghofe@11522
   178
val AppPt = Const ("AppP", [proofT, proofT] ---> proofT);
berghofe@13199
   179
val Hypt = Const ("Hyp", propT --> proofT);
berghofe@13199
   180
val Oraclet = Const ("Oracle", propT --> proofT);
berghofe@13199
   181
val MinProoft = Const ("MinProof", proofT);
berghofe@11522
   182
skalberg@15570
   183
val mk_tyapp = Library.foldl (fn (prf, T) => Const ("Appt",
berghofe@11522
   184
  [proofT, itselfT T] ---> proofT) $ prf $ Logic.mk_type T);
berghofe@11522
   185
skalberg@15531
   186
fun term_of _ (PThm ((name, _), _, _, NONE)) =
berghofe@11614
   187
      Const (add_prefix "thm" name, proofT)
skalberg@15531
   188
  | term_of _ (PThm ((name, _), _, _, SOME Ts)) =
berghofe@11614
   189
      mk_tyapp (Const (add_prefix "thm" name, proofT), Ts)
skalberg@15531
   190
  | term_of _ (PAxm (name, _, NONE)) = Const (add_prefix "axm" name, proofT)
skalberg@15531
   191
  | term_of _ (PAxm (name, _, SOME Ts)) =
berghofe@11614
   192
      mk_tyapp (Const (add_prefix "axm" name, proofT), Ts)
berghofe@11522
   193
  | term_of _ (PBound i) = Bound i
berghofe@11522
   194
  | term_of Ts (Abst (s, opT, prf)) = 
skalberg@15570
   195
      let val T = getOpt (opT,dummyT)
berghofe@11522
   196
      in Const ("Abst", (T --> proofT) --> proofT) $
berghofe@11522
   197
        Abs (s, T, term_of (T::Ts) (incr_pboundvars 1 0 prf))
berghofe@11522
   198
      end
berghofe@11522
   199
  | term_of Ts (AbsP (s, t, prf)) =
skalberg@15570
   200
      AbsPt $ getOpt (t, Const ("dummy_pattern", propT)) $
berghofe@11522
   201
        Abs (s, proofT, term_of (proofT::Ts) (incr_pboundvars 0 1 prf))
berghofe@11614
   202
  | term_of Ts (prf1 %% prf2) =
berghofe@11522
   203
      AppPt $ term_of Ts prf1 $ term_of Ts prf2
berghofe@11614
   204
  | term_of Ts (prf % opt) = 
skalberg@15570
   205
      let val t = getOpt (opt, Const ("dummy_pattern", dummyT))
berghofe@11522
   206
      in Const ("Appt",
berghofe@11522
   207
        [proofT, fastype_of1 (Ts, t) handle TERM _ => dummyT] ---> proofT) $
berghofe@11522
   208
          term_of Ts prf $ t
berghofe@11522
   209
      end
berghofe@11522
   210
  | term_of Ts (Hyp t) = Hypt $ t
berghofe@11522
   211
  | term_of Ts (Oracle (_, t, _)) = Oraclet $ t
berghofe@11522
   212
  | term_of Ts (MinProof _) = MinProoft;
berghofe@11522
   213
berghofe@11522
   214
val term_of_proof = term_of [];
berghofe@11522
   215
berghofe@11522
   216
fun cterm_of_proof thy prf =
berghofe@11522
   217
  let
berghofe@11522
   218
    val (prf', tab) = disambiguate_names thy prf;
berghofe@11522
   219
    val thys = thy :: Theory.ancestors_of thy;
skalberg@15570
   220
    val thm_names = filter_out (equal "") (map fst (List.concat (map thms_of thys))) @
berghofe@11522
   221
      map fst (Symtab.dest tab);
skalberg@15570
   222
    val axm_names = map fst (List.concat (map (Symtab.dest o #axioms o rep_theory) thys));
berghofe@11522
   223
    val sg = sign_of thy |>
berghofe@11522
   224
      add_proof_syntax |>
berghofe@11522
   225
      add_proof_atom_consts
berghofe@11614
   226
        (map (add_prefix "thm") thm_names @ map (add_prefix "axm") axm_names)
berghofe@11522
   227
  in
berghofe@11522
   228
    (cterm_of sg (term_of_proof prf'),
berghofe@11522
   229
     proof_of_term thy tab true o Thm.term_of)
berghofe@11522
   230
  end;
berghofe@11522
   231
berghofe@11522
   232
fun read_term thy =
berghofe@11522
   233
  let
berghofe@11522
   234
    val thys = thy :: Theory.ancestors_of thy;
skalberg@15570
   235
    val thm_names = filter_out (equal "") (map fst (List.concat (map thms_of thys)));
skalberg@15570
   236
    val axm_names = map fst (List.concat (map (Symtab.dest o #axioms o rep_theory) thys));
berghofe@11522
   237
    val sg = sign_of thy |>
berghofe@11522
   238
      add_proof_syntax |>
berghofe@11522
   239
      add_proof_atom_consts
berghofe@11614
   240
        (map (add_prefix "thm") thm_names @ map (add_prefix "axm") axm_names)
berghofe@11522
   241
  in
berghofe@11522
   242
    (fn T => fn s => Thm.term_of (read_cterm sg (s, T)))
berghofe@11522
   243
  end;
berghofe@11522
   244
berghofe@11522
   245
fun read_proof thy =
berghofe@11522
   246
  let val rd = read_term thy proofT
berghofe@11522
   247
  in
berghofe@11522
   248
    (fn ty => fn s => proof_of_term thy Symtab.empty ty (Logic.varify (rd s)))
berghofe@11522
   249
  end;
berghofe@11522
   250
berghofe@11522
   251
fun pretty_proof sg prf =
berghofe@11522
   252
  let
berghofe@11522
   253
    val thm_names = map fst (Symtab.dest (thms_of_proof Symtab.empty prf)) \ "";
berghofe@11522
   254
    val axm_names = map fst (Symtab.dest (axms_of_proof Symtab.empty prf));
berghofe@11522
   255
    val sg' = sg |>
berghofe@11522
   256
      add_proof_syntax |>
berghofe@11522
   257
      add_proof_atom_consts
berghofe@11614
   258
        (map (add_prefix "thm") thm_names @ map (add_prefix "axm") axm_names)
berghofe@11522
   259
  in
berghofe@11522
   260
    Sign.pretty_term sg' (term_of_proof prf)
berghofe@11522
   261
  end;
berghofe@11522
   262
berghofe@11522
   263
fun pretty_proof_of full thm =
berghofe@11522
   264
  let
berghofe@11522
   265
    val {sign, der = (_, prf), prop, ...} = rep_thm thm;
berghofe@11522
   266
    val prf' = (case strip_combt (fst (strip_combP prf)) of
berghofe@11522
   267
        (PThm (_, prf', prop', _), _) => if prop=prop' then prf' else prf
berghofe@11522
   268
      | _ => prf)
berghofe@11522
   269
  in
berghofe@11522
   270
    pretty_proof sign
berghofe@11614
   271
      (if full then Reconstruct.reconstruct_proof sign prop prf' else prf')
berghofe@11522
   272
  end;
berghofe@11522
   273
berghofe@11522
   274
val print_proof_of = Pretty.writeln oo pretty_proof_of;
berghofe@11522
   275
berghofe@11522
   276
end;