src/Pure/proofterm.ML
author wenzelm
Sat, 15 Nov 2008 21:31:23 +0100
changeset 28803 d90258bbb18f
parent 28329 e6a5fa9f1e41
child 28812 413695e07bd4
permissions -rw-r--r--
reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial); added type proof_body, which covers oracles and thms of local proof; added general fold_body_thms, fold_proof_atoms; removed thms_of_proof, thms_of_proof', axms_of_proof; slightly more abstract handling of body content (oracles, thms); rewrite_proof: simplified simprocs (no name required); thm_proof: lazy fulfillment of promises;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     1
(*  Title:      Pure/proofterm.ML
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     2
    ID:         $Id$
11540
23794728cdb7 fixed header;
wenzelm
parents: 11519
diff changeset
     3
    Author:     Stefan Berghofer, TU Muenchen
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     4
11540
23794728cdb7 fixed header;
wenzelm
parents: 11519
diff changeset
     5
LF style proof terms.
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     6
*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     7
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
     8
infix 8 % %% %>;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
     9
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    10
signature BASIC_PROOFTERM =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    11
sig
11543
d61b913431c5 renamed `keep_derivs' to `proofs', and made an integer;
wenzelm
parents: 11540
diff changeset
    12
  val proofs: int ref
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    13
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    14
  datatype proof =
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    15
     MinProof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    16
   | PBound of int
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    17
   | Abst of string * typ option * proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    18
   | AbsP of string * term option * proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    19
   | op % of proof * term option
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    20
   | op %% of proof * proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    21
   | Hyp of term
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    22
   | PAxm of string * term * typ list option
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    23
   | Oracle of string * term * typ list option
28319
13cb2108c2b9 added Promise constructor, which is similar to Oracle but may be replaced later;
wenzelm
parents: 27330
diff changeset
    24
   | Promise of serial * term * typ list option
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    25
   | PThm of serial * ((string * term * typ list option) * proof_body Lazy.T)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    26
  and proof_body = PBody of
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    27
    {oracles: (string * term) OrdList.T,
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    28
     thms: (serial * ((string * term * typ list option) * proof_body Lazy.T)) OrdList.T,
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    29
     proof: proof}
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    30
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
    31
  val %> : proof * term -> proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    32
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    33
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    34
signature PROOFTERM =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    35
sig
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    36
  include BASIC_PROOFTERM
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    37
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    38
  val proof_of: proof_body -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    39
  val force_body: proof_body Lazy.T ->
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    40
   {oracles: (string * term) OrdList.T,
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    41
    thms: (serial * ((string * term * typ list option) * proof_body Lazy.T)) OrdList.T,
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    42
    proof: proof}
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    43
  val force_proof: proof_body Lazy.T -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    44
  val fold_body_thms: ((string * term * typ list option) * proof_body -> 'a -> 'a) ->
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    45
    proof_body list -> 'a -> 'a
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    46
  val fold_proof_atoms: bool -> (proof -> 'a -> 'a) -> proof list -> 'a -> 'a
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    47
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    48
  type oracle = string * term
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    49
  val oracle_ord: oracle * oracle -> order
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    50
  type pthm = serial * ((string * term * typ list option) * proof_body Lazy.T)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    51
  val thm_ord: pthm * pthm -> order
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    52
  val make_proof_body: proof -> proof_body
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    53
  val merge_oracles: oracle OrdList.T -> oracle OrdList.T -> oracle OrdList.T
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    54
  val make_oracles: proof -> oracle OrdList.T
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    55
  val merge_thms: pthm OrdList.T -> pthm OrdList.T -> pthm OrdList.T
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    56
  val make_thms: proof -> pthm OrdList.T
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    57
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    58
  (** primitive operations **)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    59
  val proof_combt: proof * term list -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    60
  val proof_combt': proof * term option list -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    61
  val proof_combP: proof * proof list -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    62
  val strip_combt: proof -> proof * term option list
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    63
  val strip_combP: proof -> proof * proof list
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    64
  val strip_thm: proof_body -> proof_body
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    65
  val map_proof_terms_option: (term -> term option) -> (typ -> typ option) -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    66
  val map_proof_terms: (term -> term) -> (typ -> typ) -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    67
  val fold_proof_terms: (term -> 'a -> 'a) -> (typ -> 'a -> 'a) -> proof -> 'a -> 'a
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    68
  val maxidx_proof: proof -> int -> int
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    69
  val size_of_proof: proof -> int
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    70
  val change_type: typ list option -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    71
  val prf_abstract_over: term -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    72
  val prf_incr_bv: int -> int -> int -> int -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    73
  val incr_pboundvars: int -> int -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    74
  val prf_loose_bvar1: proof -> int -> bool
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    75
  val prf_loose_Pbvar1: proof -> int -> bool
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    76
  val prf_add_loose_bnos: int -> int -> proof -> int list * int list -> int list * int list
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    77
  val norm_proof: Envir.env -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    78
  val norm_proof': Envir.env -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    79
  val prf_subst_bounds: term list -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    80
  val prf_subst_pbounds: proof list -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    81
  val freeze_thaw_prf: proof -> proof * (proof -> proof)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    82
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
    83
  (** proof terms for specific inference rules **)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    84
  val implies_intr_proof: term -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    85
  val forall_intr_proof: term -> string -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    86
  val varify_proof: term -> (string * sort) list -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    87
  val freezeT: term -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    88
  val rotate_proof: term list -> term -> int -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    89
  val permute_prems_prf: term list -> int -> int -> proof -> proof
19908
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
    90
  val generalize: string list * string list -> int -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    91
  val instantiate: ((indexname * sort) * typ) list * ((indexname * typ) * term) list
16880
411d91d104c4 tuned instantiate interface;
wenzelm
parents: 16787
diff changeset
    92
    -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    93
  val lift_proof: term -> int -> term -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    94
  val assumption_proof: term list -> term -> int -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    95
  val bicompose_proof: bool -> term list -> term list -> term list -> term option ->
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
    96
    int -> int -> proof -> proof -> proof
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    97
  val equality_axms: (string * term) list
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    98
  val reflexive_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
    99
  val symmetric_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   100
  val transitive_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   101
  val equal_intr_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   102
  val equal_elim_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   103
  val abstract_rule_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   104
  val combination_axm: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   105
  val reflexive: proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   106
  val symmetric: proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   107
  val transitive: term -> typ -> proof -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   108
  val abstract_rule: term -> string -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   109
  val combination: term -> term -> term -> term -> typ -> proof -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   110
  val equal_intr: term -> term -> proof -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   111
  val equal_elim: term -> term -> proof -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   112
  val axm_proof: string -> term -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   113
  val oracle_proof: string -> term -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   114
  val promise_proof: serial -> term -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   115
  val fulfill_proof: (serial * proof Lazy.T) list -> proof_body -> proof_body
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   116
  val thm_proof: theory -> string -> term list -> term ->
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   117
    (serial * proof Lazy.T) list -> proof_body -> pthm * proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   118
  val get_name: term list -> term -> proof -> string
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   119
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   120
  (** rewriting on proof terms **)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   121
  val add_prf_rrule: proof * proof -> theory -> theory
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   122
  val add_prf_rproc: (typ list -> proof -> proof option) -> theory -> theory
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   123
  val rewrite_proof: theory -> (proof * proof) list *
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   124
    (typ list -> proof -> proof option) list -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   125
  val rewrite_proof_notypes: (proof * proof) list *
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   126
    (typ list -> proof -> proof option) list -> proof -> proof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   127
  val rew_proof: theory -> proof -> proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   128
end
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   129
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   130
structure Proofterm : PROOFTERM =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   131
struct
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   132
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   133
open Envir;
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   134
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   135
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   136
(***** datatype proof *****)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   137
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   138
datatype proof =
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   139
   MinProof
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   140
 | PBound of int
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   141
 | Abst of string * typ option * proof
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   142
 | AbsP of string * term option * proof
12497
ec6ba9e6eef3 type_env;
wenzelm
parents: 12311
diff changeset
   143
 | op % of proof * term option
ec6ba9e6eef3 type_env;
wenzelm
parents: 12311
diff changeset
   144
 | op %% of proof * proof
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   145
 | Hyp of term
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   146
 | PAxm of string * term * typ list option
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   147
 | Oracle of string * term * typ list option
28319
13cb2108c2b9 added Promise constructor, which is similar to Oracle but may be replaced later;
wenzelm
parents: 27330
diff changeset
   148
 | Promise of serial * term * typ list option
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   149
 | PThm of serial * ((string * term * typ list option) * proof_body Lazy.T)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   150
and proof_body = PBody of
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   151
  {oracles: (string * term) OrdList.T,
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   152
   thms: (serial * ((string * term * typ list option) * proof_body Lazy.T)) OrdList.T,
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   153
   proof: proof};
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   154
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   155
val force_body = Lazy.force #> (fn PBody args => args);
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   156
val force_proof = #proof o force_body;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   157
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   158
fun proof_of (PBody {proof, ...}) = proof;
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   159
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   160
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   161
(***** proof atoms *****)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   162
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   163
fun fold_body_thms f =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   164
  let
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   165
    fun app (PBody {thms, ...}) = thms |> fold (fn (i, (stmt, body)) => fn (x, seen) =>
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   166
      if Inttab.defined seen i then (x, seen)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   167
      else
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   168
        let
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   169
          val body' = Lazy.force body;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   170
          val (x', seen') = app body' (x, Inttab.update (i, ()) seen);
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   171
        in (f (stmt, body') x', seen') end);
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   172
  in fn bodies => fn x => #1 (fold app bodies (x, Inttab.empty)) end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   173
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   174
fun fold_proof_atoms all f =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   175
  let
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   176
    fun app (Abst (_, _, prf)) = app prf
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   177
      | app (AbsP (_, _, prf)) = app prf
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   178
      | app (prf % _) = app prf
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   179
      | app (prf1 %% prf2) = app prf1 #> app prf2
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   180
      | app (prf as PThm (i, (_, body))) = (fn (x, seen) =>
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   181
          if Inttab.defined seen i then (x, seen)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   182
          else
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   183
            let val res = (f prf x, Inttab.update (i, ()) seen)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   184
            in if all then app (force_proof body) res else res
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   185
          end)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   186
      | app prf = (fn (x, seen) => (f prf x, seen));
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   187
  in fn prfs => fn x => #1 (fold app prfs (x, Inttab.empty)) end;
19357
dade85a75c9f Added alternative version of thms_of_proof that does not recursively
berghofe
parents: 19304
diff changeset
   188
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   189
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   190
(* atom kinds *)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   191
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   192
type oracle = string * term;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   193
val oracle_ord = prod_ord fast_string_ord Term.fast_term_ord;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   194
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   195
type pthm = serial * ((string * term * typ list option) * proof_body Lazy.T);
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   196
fun thm_ord ((i, _): pthm, (j, _)) = int_ord (j, i);
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   197
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   198
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   199
(* proof body *)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   200
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   201
fun make_body prf =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   202
  let
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   203
    val (oracles, thms) = fold_proof_atoms false
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   204
      (fn Oracle (s, prop, _) => apfst (cons (s, prop))
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   205
        | PThm thm => apsnd (cons thm)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   206
        | _ => I) [prf] ([], []);
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   207
  in (OrdList.make oracle_ord oracles, OrdList.make thm_ord thms) end;
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   208
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   209
fun make_proof_body prf =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   210
  let val (oracles, thms) = make_body prf
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   211
  in PBody {oracles = oracles, thms = thms, proof = prf} end;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   212
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   213
val make_oracles = #1 o make_body;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   214
val make_thms = #2 o make_body;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   215
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   216
val merge_oracles = OrdList.union oracle_ord;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   217
val merge_thms = OrdList.union thm_ord;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   218
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   219
fun merge_body (oracles1, thms1) (oracles2, thms2) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   220
 (merge_oracles oracles1 oracles2, merge_thms thms1 thms2);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   221
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   222
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   223
(***** proof objects with different levels of detail *****)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   224
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   225
fun (prf %> t) = prf % SOME t;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   226
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   227
val proof_combt = Library.foldl (op %>);
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   228
val proof_combt' = Library.foldl (op %);
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   229
val proof_combP = Library.foldl (op %%);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   230
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   231
fun strip_combt prf =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   232
    let fun stripc (prf % t, ts) = stripc (prf, t::ts)
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   233
          | stripc  x =  x
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   234
    in  stripc (prf, [])  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   235
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   236
fun strip_combP prf =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   237
    let fun stripc (prf %% prf', prfs) = stripc (prf, prf'::prfs)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   238
          | stripc  x =  x
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   239
    in  stripc (prf, [])  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   240
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   241
fun strip_thm (body as PBody {proof, ...}) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   242
  (case strip_combt (fst (strip_combP proof)) of
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   243
    (PThm (_, (_, body')), _) => Lazy.force body'
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   244
  | _ => body);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   245
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   246
val mk_Abst = fold_rev (fn (s, T:typ) => fn prf => Abst (s, NONE, prf));
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   247
fun mk_AbsP (i, prf) = funpow i (fn prf => AbsP ("H", NONE, prf)) prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   248
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   249
fun apsome f NONE = raise SAME
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   250
  | apsome f (SOME x) = (case f x of NONE => raise SAME | some => some);
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   251
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   252
fun apsome' f NONE = raise SAME
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   253
  | apsome' f (SOME x) = SOME (f x);
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   254
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   255
fun map_proof_terms_option f g =
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   256
  let
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   257
    fun map_typs (T :: Ts) =
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   258
          (case g T of
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   259
            NONE => T :: map_typs Ts
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   260
          | SOME T' => T' :: (map_typs Ts handle SAME => Ts))
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   261
      | map_typs [] = raise SAME;
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   262
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   263
    fun mapp (Abst (s, T, prf)) = (Abst (s, apsome g T, mapph prf)
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   264
          handle SAME => Abst (s, T, mapp prf))
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   265
      | mapp (AbsP (s, t, prf)) = (AbsP (s, apsome f t, mapph prf)
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   266
          handle SAME => AbsP (s, t, mapp prf))
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   267
      | mapp (prf % t) = (mapp prf % (apsome f t handle SAME => t)
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   268
          handle SAME => prf % apsome f t)
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   269
      | mapp (prf1 %% prf2) = (mapp prf1 %% mapph prf2
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   270
          handle SAME => prf1 %% mapp prf2)
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   271
      | mapp (PAxm (a, prop, SOME Ts)) =
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   272
          PAxm (a, prop, SOME (map_typs Ts))
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   273
      | mapp (PThm (i, ((a, prop, SOME Ts), body))) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   274
          PThm (i, ((a, prop, SOME (map_typs Ts)), body))
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   275
      | mapp _ = raise SAME
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   276
    and mapph prf = (mapp prf handle SAME => prf)
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   277
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   278
  in mapph end;
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   279
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   280
fun same eq f x =
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   281
  let val x' = f x
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   282
  in if eq (x, x') then raise SAME else x' end;
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   283
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   284
fun map_proof_terms f g =
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   285
  map_proof_terms_option
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   286
   (fn t => SOME (same (op =) f t) handle SAME => NONE)
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   287
   (fn T => SOME (same (op =) g T) handle SAME => NONE);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   288
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   289
fun fold_proof_terms f g (Abst (_, SOME T, prf)) = g T #> fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   290
  | fold_proof_terms f g (Abst (_, NONE, prf)) = fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   291
  | fold_proof_terms f g (AbsP (_, SOME t, prf)) = f t #> fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   292
  | fold_proof_terms f g (AbsP (_, NONE, prf)) = fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   293
  | fold_proof_terms f g (prf % SOME t) = fold_proof_terms f g prf #> f t
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   294
  | fold_proof_terms f g (prf % NONE) = fold_proof_terms f g prf
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   295
  | fold_proof_terms f g (prf1 %% prf2) =
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   296
      fold_proof_terms f g prf1 #> fold_proof_terms f g prf2
20159
wenzelm
parents: 20147
diff changeset
   297
  | fold_proof_terms _ g (PAxm (_, _, SOME Ts)) = fold g Ts
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   298
  | fold_proof_terms _ g (PThm (_, ((_, _, SOME Ts), _))) = fold g Ts
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   299
  | fold_proof_terms _ _ _ = I;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   300
20300
963bf056e8f7 replaced maxidx_of_proof by maxidx_proof;
wenzelm
parents: 20159
diff changeset
   301
fun maxidx_proof prf = fold_proof_terms Term.maxidx_term Term.maxidx_typ prf;
12868
cdf338ef5fad New function maxidx_of_proof.
berghofe
parents: 12497
diff changeset
   302
13744
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   303
fun size_of_proof (Abst (_, _, prf)) = 1 + size_of_proof prf
13749
6844c38d74df size_of_proof no longer includes size_of_term
berghofe
parents: 13744
diff changeset
   304
  | size_of_proof (AbsP (_, t, prf)) = 1 + size_of_proof prf
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   305
  | size_of_proof (prf % _) = 1 + size_of_proof prf
13744
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   306
  | size_of_proof (prf1 %% prf2) = size_of_proof prf1 + size_of_proof prf2
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   307
  | size_of_proof _ = 1;
2241191a3c54 Added size_of_proof.
berghofe
parents: 13662
diff changeset
   308
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   309
fun change_type opTs (PAxm (name, prop, _)) = PAxm (name, prop, opTs)
12907
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   310
  | change_type opTs (Oracle (name, prop, _)) = Oracle (name, prop, opTs)
28319
13cb2108c2b9 added Promise constructor, which is similar to Oracle but may be replaced later;
wenzelm
parents: 27330
diff changeset
   311
  | change_type opTs (Promise (i, prop, _)) = Promise (i, prop, opTs)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   312
  | change_type opTs (PThm (i, ((name, prop, _), body))) = PThm (i, ((name, prop, opTs), body))
12907
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   313
  | change_type _ prf = prf;
27e6d344d724 New function change_type for changing type assignments of theorems,
berghofe
parents: 12890
diff changeset
   314
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   315
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   316
(***** utilities *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   317
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   318
fun strip_abs (_::Ts) (Abs (_, _, t)) = strip_abs Ts t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   319
  | strip_abs _ t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   320
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   321
fun mk_abs Ts t = Library.foldl (fn (t', T) => Abs ("", T, t')) (t, Ts);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   322
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   323
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   324
(*Abstraction of a proof term over its occurrences of v,
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   325
    which must contain no loose bound variables.
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   326
  The resulting proof term is ready to become the body of an Abst.*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   327
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   328
fun prf_abstract_over v =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   329
  let
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   330
    fun abst' lev u = if v aconv u then Bound lev else
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   331
      (case u of
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   332
         Abs (a, T, t) => Abs (a, T, abst' (lev + 1) t)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   333
       | f $ t => (abst' lev f $ absth' lev t handle SAME => f $ abst' lev t)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   334
       | _ => raise SAME)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   335
    and absth' lev t = (abst' lev t handle SAME => t);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   336
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   337
    fun abst lev (AbsP (a, t, prf)) =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   338
          (AbsP (a, apsome' (abst' lev) t, absth lev prf)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   339
           handle SAME => AbsP (a, t, abst lev prf))
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   340
      | abst lev (Abst (a, T, prf)) = Abst (a, T, abst (lev + 1) prf)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   341
      | abst lev (prf1 %% prf2) = (abst lev prf1 %% absth lev prf2
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   342
          handle SAME => prf1 %% abst lev prf2)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   343
      | abst lev (prf % t) = (abst lev prf % Option.map (absth' lev) t
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   344
          handle SAME => prf % apsome' (abst' lev) t)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   345
      | abst _ _ = raise SAME
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   346
    and absth lev prf = (abst lev prf handle SAME => prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   347
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   348
  in absth 0 end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   349
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   350
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   351
(*increments a proof term's non-local bound variables
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   352
  required when moving a proof term within abstractions
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   353
     inc is  increment for bound variables
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   354
     lev is  level at which a bound variable is considered 'loose'*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   355
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   356
fun incr_bv' inct tlev t = incr_bv (inct, tlev, t);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   357
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   358
fun prf_incr_bv' incP inct Plev tlev (PBound i) =
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   359
      if i >= Plev then PBound (i+incP) else raise SAME
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   360
  | prf_incr_bv' incP inct Plev tlev (AbsP (a, t, body)) =
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   361
      (AbsP (a, apsome' (same (op =) (incr_bv' inct tlev)) t,
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   362
         prf_incr_bv incP inct (Plev+1) tlev body) handle SAME =>
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   363
           AbsP (a, t, prf_incr_bv' incP inct (Plev+1) tlev body))
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   364
  | prf_incr_bv' incP inct Plev tlev (Abst (a, T, body)) =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   365
      Abst (a, T, prf_incr_bv' incP inct Plev (tlev+1) body)
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   366
  | prf_incr_bv' incP inct Plev tlev (prf %% prf') =
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   367
      (prf_incr_bv' incP inct Plev tlev prf %% prf_incr_bv incP inct Plev tlev prf'
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   368
       handle SAME => prf %% prf_incr_bv' incP inct Plev tlev prf')
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   369
  | prf_incr_bv' incP inct Plev tlev (prf % t) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   370
      (prf_incr_bv' incP inct Plev tlev prf % Option.map (incr_bv' inct tlev) t
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   371
       handle SAME => prf % apsome' (same (op =) (incr_bv' inct tlev)) t)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   372
  | prf_incr_bv' _ _ _ _ _ = raise SAME
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   373
and prf_incr_bv incP inct Plev tlev prf =
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   374
      (prf_incr_bv' incP inct Plev tlev prf handle SAME => prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   375
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   376
fun incr_pboundvars  0 0 prf = prf
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   377
  | incr_pboundvars incP inct prf = prf_incr_bv incP inct 0 0 prf;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   378
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   379
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   380
fun prf_loose_bvar1 (prf1 %% prf2) k = prf_loose_bvar1 prf1 k orelse prf_loose_bvar1 prf2 k
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   381
  | prf_loose_bvar1 (prf % SOME t) k = prf_loose_bvar1 prf k orelse loose_bvar1 (t, k)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   382
  | prf_loose_bvar1 (_ % NONE) _ = true
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   383
  | prf_loose_bvar1 (AbsP (_, SOME t, prf)) k = loose_bvar1 (t, k) orelse prf_loose_bvar1 prf k
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   384
  | prf_loose_bvar1 (AbsP (_, NONE, _)) k = true
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   385
  | prf_loose_bvar1 (Abst (_, _, prf)) k = prf_loose_bvar1 prf (k+1)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   386
  | prf_loose_bvar1 _ _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   387
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   388
fun prf_loose_Pbvar1 (PBound i) k = i = k
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   389
  | prf_loose_Pbvar1 (prf1 %% prf2) k = prf_loose_Pbvar1 prf1 k orelse prf_loose_Pbvar1 prf2 k
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   390
  | prf_loose_Pbvar1 (prf % _) k = prf_loose_Pbvar1 prf k
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   391
  | prf_loose_Pbvar1 (AbsP (_, _, prf)) k = prf_loose_Pbvar1 prf (k+1)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   392
  | prf_loose_Pbvar1 (Abst (_, _, prf)) k = prf_loose_Pbvar1 prf k
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   393
  | prf_loose_Pbvar1 _ _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   394
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   395
fun prf_add_loose_bnos plev tlev (PBound i) (is, js) =
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   396
      if i < plev then (is, js) else (insert (op =) (i-plev) is, js)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   397
  | prf_add_loose_bnos plev tlev (prf1 %% prf2) p =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   398
      prf_add_loose_bnos plev tlev prf2
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   399
        (prf_add_loose_bnos plev tlev prf1 p)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   400
  | prf_add_loose_bnos plev tlev (prf % opt) (is, js) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   401
      prf_add_loose_bnos plev tlev prf (case opt of
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   402
          NONE => (is, insert (op =) ~1 js)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   403
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   404
  | prf_add_loose_bnos plev tlev (AbsP (_, opt, prf)) (is, js) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   405
      prf_add_loose_bnos (plev+1) tlev prf (case opt of
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   406
          NONE => (is, insert (op =) ~1 js)
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   407
        | SOME t => (is, add_loose_bnos (t, tlev, js)))
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   408
  | prf_add_loose_bnos plev tlev (Abst (_, _, prf)) p =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   409
      prf_add_loose_bnos plev (tlev+1) prf p
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   410
  | prf_add_loose_bnos _ _ _ _ = ([], []);
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   411
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   412
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   413
(**** substitutions ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   414
20509
073a5ed7dd71 moved term subst functions to TermSubst;
wenzelm
parents: 20300
diff changeset
   415
fun del_conflicting_tvars envT T = TermSubst.instantiateT
19482
9f11af8f7ef9 tuned basic list operators (flat, maps, map_filter);
wenzelm
parents: 19357
diff changeset
   416
  (map_filter (fn ixnS as (_, S) =>
26328
b2d6f520172c Type.lookup now curried
haftmann
parents: 23780
diff changeset
   417
     (Type.lookup envT ixnS; NONE) handle TYPE _ =>
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   418
        SOME (ixnS, TFree ("'dummy", S))) (typ_tvars T)) T;
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   419
20509
073a5ed7dd71 moved term subst functions to TermSubst;
wenzelm
parents: 20300
diff changeset
   420
fun del_conflicting_vars env t = TermSubst.instantiate
19482
9f11af8f7ef9 tuned basic list operators (flat, maps, map_filter);
wenzelm
parents: 19357
diff changeset
   421
  (map_filter (fn ixnS as (_, S) =>
26328
b2d6f520172c Type.lookup now curried
haftmann
parents: 23780
diff changeset
   422
     (Type.lookup (type_env env) ixnS; NONE) handle TYPE _ =>
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   423
        SOME (ixnS, TFree ("'dummy", S))) (term_tvars t),
19482
9f11af8f7ef9 tuned basic list operators (flat, maps, map_filter);
wenzelm
parents: 19357
diff changeset
   424
   map_filter (fn Var (ixnT as (_, T)) =>
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   425
     (Envir.lookup (env, ixnT); NONE) handle TYPE _ =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   426
        SOME (ixnT, Free ("dummy", T))) (term_vars t)) t;
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   427
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   428
fun norm_proof env =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   429
  let
12497
ec6ba9e6eef3 type_env;
wenzelm
parents: 12311
diff changeset
   430
    val envT = type_env env;
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   431
    fun msg s = warning ("type conflict in norm_proof:\n" ^ s);
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   432
    fun htype f t = f env t handle TYPE (s, _, _) =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   433
      (msg s; f env (del_conflicting_vars env t));
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   434
    fun htypeT f T = f envT T handle TYPE (s, _, _) =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   435
      (msg s; f envT (del_conflicting_tvars envT T));
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   436
    fun htypeTs f Ts = f envT Ts handle TYPE (s, _, _) =>
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   437
      (msg s; f envT (map (del_conflicting_tvars envT) Ts));
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   438
    fun norm (Abst (s, T, prf)) = (Abst (s, apsome' (htypeT norm_type_same) T, normh prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   439
          handle SAME => Abst (s, T, norm prf))
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   440
      | norm (AbsP (s, t, prf)) = (AbsP (s, apsome' (htype norm_term_same) t, normh prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   441
          handle SAME => AbsP (s, t, norm prf))
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   442
      | norm (prf % t) = (norm prf % Option.map (htype norm_term) t
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   443
          handle SAME => prf % apsome' (htype norm_term_same) t)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   444
      | norm (prf1 %% prf2) = (norm prf1 %% normh prf2
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   445
          handle SAME => prf1 %% norm prf2)
18316
4b62e0cb3aa8 Improved norm_proof to handle proofs containing term (type) variables
berghofe
parents: 18030
diff changeset
   446
      | norm (PAxm (s, prop, Ts)) = PAxm (s, prop, apsome' (htypeTs norm_types_same) Ts)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   447
      | norm (PThm (i, ((s, t, Ts), body))) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   448
          PThm (i, ((s, t, apsome' (htypeTs norm_types_same) Ts), body))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   449
      | norm _ = raise SAME
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   450
    and normh prf = (norm prf handle SAME => prf);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   451
  in normh end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   452
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   453
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   454
(***** Remove some types in proof term (to save space) *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   455
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   456
fun remove_types (Abs (s, _, t)) = Abs (s, dummyT, remove_types t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   457
  | remove_types (t $ u) = remove_types t $ remove_types u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   458
  | remove_types (Const (s, _)) = Const (s, dummyT)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   459
  | remove_types t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   460
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   461
fun remove_types_env (Envir.Envir {iTs, asol, maxidx}) =
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   462
  Envir.Envir {iTs = iTs, asol = Vartab.map (apsnd remove_types) asol,
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
   463
    maxidx = maxidx};
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   464
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   465
fun norm_proof' env prf = norm_proof (remove_types_env env) prf;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   466
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   467
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   468
(**** substitution of bound variables ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   469
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   470
fun prf_subst_bounds args prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   471
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   472
    val n = length args;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   473
    fun subst' lev (Bound i) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   474
         (if i<lev then raise SAME    (*var is locally bound*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   475
          else  incr_boundvars lev (List.nth (args, i-lev))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   476
                  handle Subscript => Bound (i-n)  (*loose: change it*))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   477
      | subst' lev (Abs (a, T, body)) = Abs (a, T,  subst' (lev+1) body)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   478
      | subst' lev (f $ t) = (subst' lev f $ substh' lev t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   479
          handle SAME => f $ subst' lev t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   480
      | subst' _ _ = raise SAME
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   481
    and substh' lev t = (subst' lev t handle SAME => t);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   482
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   483
    fun subst lev (AbsP (a, t, body)) = (AbsP (a, apsome' (subst' lev) t, substh lev body)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   484
          handle SAME => AbsP (a, t, subst lev body))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   485
      | subst lev (Abst (a, T, body)) = Abst (a, T, subst (lev+1) body)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   486
      | subst lev (prf %% prf') = (subst lev prf %% substh lev prf'
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   487
          handle SAME => prf %% subst lev prf')
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   488
      | subst lev (prf % t) = (subst lev prf % Option.map (substh' lev) t
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   489
          handle SAME => prf % apsome' (subst' lev) t)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   490
      | subst _ _ = raise SAME
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   491
    and substh lev prf = (subst lev prf handle SAME => prf)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   492
  in case args of [] => prf | _ => substh 0 prf end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   493
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   494
fun prf_subst_pbounds args prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   495
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   496
    val n = length args;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   497
    fun subst (PBound i) Plev tlev =
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   498
         (if i < Plev then raise SAME    (*var is locally bound*)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   499
          else incr_pboundvars Plev tlev (List.nth (args, i-Plev))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   500
                 handle Subscript => PBound (i-n)  (*loose: change it*))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   501
      | subst (AbsP (a, t, body)) Plev tlev = AbsP (a, t, subst body (Plev+1) tlev)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   502
      | subst (Abst (a, T, body)) Plev tlev = Abst (a, T, subst body Plev (tlev+1))
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   503
      | subst (prf %% prf') Plev tlev = (subst prf Plev tlev %% substh prf' Plev tlev
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   504
          handle SAME => prf %% subst prf' Plev tlev)
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   505
      | subst (prf % t) Plev tlev = subst prf Plev tlev % t
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   506
      | subst  prf _ _ = raise SAME
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   507
    and substh prf Plev tlev = (subst prf Plev tlev handle SAME => prf)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   508
  in case args of [] => prf | _ => substh prf 0 0 end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   509
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   510
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   511
(**** Freezing and thawing of variables in proof terms ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   512
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   513
fun frzT names =
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   514
  map_type_tvar (fn (ixn, xs) => TFree ((the o AList.lookup (op =) names) ixn, xs));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   515
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   516
fun thawT names =
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   517
  map_type_tfree (fn (s, xs) => case AList.lookup (op =) names s of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   518
      NONE => TFree (s, xs)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   519
    | SOME ixn => TVar (ixn, xs));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   520
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   521
fun freeze names names' (t $ u) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   522
      freeze names names' t $ freeze names names' u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   523
  | freeze names names' (Abs (s, T, t)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   524
      Abs (s, frzT names' T, freeze names names' t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   525
  | freeze names names' (Const (s, T)) = Const (s, frzT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   526
  | freeze names names' (Free (s, T)) = Free (s, frzT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   527
  | freeze names names' (Var (ixn, T)) =
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   528
      Free ((the o AList.lookup (op =) names) ixn, frzT names' T)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   529
  | freeze names names' t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   530
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   531
fun thaw names names' (t $ u) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   532
      thaw names names' t $ thaw names names' u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   533
  | thaw names names' (Abs (s, T, t)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   534
      Abs (s, thawT names' T, thaw names names' t)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   535
  | thaw names names' (Const (s, T)) = Const (s, thawT names' T)
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   536
  | thaw names names' (Free (s, T)) =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   537
      let val T' = thawT names' T
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   538
      in case AList.lookup (op =) names s of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   539
          NONE => Free (s, T')
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   540
        | SOME ixn => Var (ixn, T')
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   541
      end
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   542
  | thaw names names' (Var (ixn, T)) = Var (ixn, thawT names' T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   543
  | thaw names names' t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   544
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   545
fun freeze_thaw_prf prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   546
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   547
    val (fs, Tfs, vs, Tvs) = fold_proof_terms
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   548
      (fn t => fn (fs, Tfs, vs, Tvs) =>
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   549
         (add_term_frees (t, fs), add_term_tfree_names (t, Tfs),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   550
          add_term_vars (t, vs), add_term_tvar_ixns (t, Tvs)))
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   551
      (fn T => fn (fs, Tfs, vs, Tvs) =>
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   552
         (fs, add_typ_tfree_names (T, Tfs),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   553
          vs, add_typ_ixns (Tvs, T)))
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   554
      prf ([], [], [], []);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   555
    val fs' = map (fst o dest_Free) fs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   556
    val vs' = map (fst o dest_Var) vs;
20071
8f3e1ddb50e6 replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents: 20000
diff changeset
   557
    val names = vs' ~~ Name.variant_list fs' (map fst vs');
8f3e1ddb50e6 replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents: 20000
diff changeset
   558
    val names' = Tvs ~~ Name.variant_list Tfs (map fst Tvs);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   559
    val rnames = map swap names;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   560
    val rnames' = map swap names';
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   561
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   562
    (map_proof_terms (freeze names names') (frzT names') prf,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   563
     map_proof_terms (thaw rnames rnames') (thawT rnames'))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   564
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   565
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   566
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   567
(***** implication introduction *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   568
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   569
fun implies_intr_proof h prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   570
  let
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   571
    fun abshyp i (Hyp t) = if h aconv t then PBound i else raise SAME
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   572
      | abshyp i (Abst (s, T, prf)) = Abst (s, T, abshyp i prf)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   573
      | abshyp i (AbsP (s, t, prf)) = AbsP (s, t, abshyp (i+1) prf)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   574
      | abshyp i (prf % t) = abshyp i prf % t
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   575
      | abshyp i (prf1 %% prf2) = (abshyp i prf1 %% abshyph i prf2
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   576
          handle SAME => prf1 %% abshyp i prf2)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   577
      | abshyp _ _ = raise SAME
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   578
    and abshyph i prf = (abshyp i prf handle SAME => prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   579
  in
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   580
    AbsP ("H", NONE (*h*), abshyph 0 prf)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   581
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   582
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   583
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   584
(***** forall introduction *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   585
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   586
fun forall_intr_proof x a prf = Abst (a, NONE, prf_abstract_over x prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   587
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   588
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   589
(***** varify *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   590
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   591
fun varify_proof t fixed prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   592
  let
19304
15f001295a7b remove (op =);
wenzelm
parents: 19222
diff changeset
   593
    val fs = Term.fold_types (Term.fold_atyps
15f001295a7b remove (op =);
wenzelm
parents: 19222
diff changeset
   594
      (fn TFree v => if member (op =) fixed v then I else insert (op =) v | _ => I)) t [];
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   595
    val ixns = add_term_tvar_ixns (t, []);
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   596
    val fmap = fs ~~ Name.variant_list (map #1 ixns) (map fst fs);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   597
    fun thaw (f as (a, S)) =
17314
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
   598
      (case AList.lookup (op =) fmap f of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   599
        NONE => TFree f
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   600
      | SOME b => TVar ((b, 0), S));
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   601
  in map_proof_terms (map_types (map_type_tfree thaw)) (map_type_tfree thaw) prf end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   602
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   603
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   604
local
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   605
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   606
fun new_name (ix, (pairs,used)) =
20071
8f3e1ddb50e6 replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents: 20000
diff changeset
   607
  let val v = Name.variant used (string_of_indexname ix)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   608
  in  ((ix, v) :: pairs, v :: used)  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   609
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
   610
fun freeze_one alist (ix, sort) = (case AList.lookup (op =) alist ix of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   611
    NONE => TVar (ix, sort)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   612
  | SOME name => TFree (name, sort));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   613
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   614
in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   615
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   616
fun freezeT t prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   617
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   618
    val used = it_term_types add_typ_tfree_names (t, [])
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   619
    and tvars = map #1 (it_term_types add_typ_tvars (t, []));
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   620
    val (alist, _) = List.foldr new_name ([], used) tvars;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   621
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   622
    (case alist of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   623
      [] => prf (*nothing to do!*)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   624
    | _ =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   625
      let val frzT = map_type_tvar (freeze_one alist)
20548
8ef25fe585a8 renamed Term.map_term_types to Term.map_types (cf. Term.fold_types);
wenzelm
parents: 20509
diff changeset
   626
      in map_proof_terms (map_types frzT) frzT prf end)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   627
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   628
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   629
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   630
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   631
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   632
(***** rotate assumptions *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   633
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   634
fun rotate_proof Bs Bi m prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   635
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   636
    val params = Term.strip_all_vars Bi;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   637
    val asms = Logic.strip_imp_prems (Term.strip_all_body Bi);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   638
    val i = length asms;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   639
    val j = length Bs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   640
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   641
    mk_AbsP (j+1, proof_combP (prf, map PBound
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   642
      (j downto 1) @ [mk_Abst params (mk_AbsP (i,
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   643
        proof_combP (proof_combt (PBound i, map Bound ((length params - 1) downto 0)),
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   644
          map PBound (((i-m-1) downto 0) @ ((i-1) downto (i-m))))))]))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   645
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   646
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   647
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   648
(***** permute premises *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   649
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   650
fun permute_prems_prf prems j k prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   651
  let val n = length prems
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   652
  in mk_AbsP (n, proof_combP (prf,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   653
    map PBound ((n-1 downto n-j) @ (k-1 downto 0) @ (n-j-1 downto k))))
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   654
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   655
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   656
19908
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
   657
(***** generalization *****)
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
   658
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   659
fun generalize (tfrees, frees) idx =
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   660
  map_proof_terms_option
20509
073a5ed7dd71 moved term subst functions to TermSubst;
wenzelm
parents: 20300
diff changeset
   661
    (TermSubst.generalize_option (tfrees, frees) idx)
073a5ed7dd71 moved term subst functions to TermSubst;
wenzelm
parents: 20300
diff changeset
   662
    (TermSubst.generalizeT_option tfrees idx);
19908
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
   663
f035261fb5b9 added generalize rule;
wenzelm
parents: 19502
diff changeset
   664
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   665
(***** instantiation *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   666
20000
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   667
fun instantiate (instT, inst) =
2fa767ab91aa added map_proof_terms_option;
wenzelm
parents: 19908
diff changeset
   668
  map_proof_terms_option
20509
073a5ed7dd71 moved term subst functions to TermSubst;
wenzelm
parents: 20300
diff changeset
   669
    (TermSubst.instantiate_option (instT, map (apsnd remove_types) inst))
073a5ed7dd71 moved term subst functions to TermSubst;
wenzelm
parents: 20300
diff changeset
   670
    (TermSubst.instantiateT_option instT);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   671
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   672
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   673
(***** lifting *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   674
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   675
fun lift_proof Bi inc prop prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   676
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   677
    fun lift'' Us Ts t = strip_abs Ts (Logic.incr_indexes (Us, inc) (mk_abs Ts t));
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   678
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   679
    fun lift' Us Ts (Abst (s, T, prf)) =
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   680
          (Abst (s, apsome' (same (op =) (Logic.incr_tvar inc)) T, lifth' Us (dummyT::Ts) prf)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   681
           handle SAME => Abst (s, T, lift' Us (dummyT::Ts) prf))
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   682
      | lift' Us Ts (AbsP (s, t, prf)) =
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   683
          (AbsP (s, apsome' (same (op =) (lift'' Us Ts)) t, lifth' Us Ts prf)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   684
           handle SAME => AbsP (s, t, lift' Us Ts prf))
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   685
      | lift' Us Ts (prf % t) = (lift' Us Ts prf % Option.map (lift'' Us Ts) t
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   686
          handle SAME => prf % apsome' (same (op =) (lift'' Us Ts)) t)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   687
      | lift' Us Ts (prf1 %% prf2) = (lift' Us Ts prf1 %% lifth' Us Ts prf2
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   688
          handle SAME => prf1 %% lift' Us Ts prf2)
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   689
      | lift' _ _ (PAxm (s, prop, Ts)) =
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
   690
          PAxm (s, prop, apsome' (same (op =) (map (Logic.incr_tvar inc))) Ts)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   691
      | lift' _ _ (PThm (i, ((s, prop, Ts), body))) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   692
          PThm (i, ((s, prop, apsome' (same (op =) (map (Logic.incr_tvar inc))) Ts), body))
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   693
      | lift' _ _ _ = raise SAME
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   694
    and lifth' Us Ts prf = (lift' Us Ts prf handle SAME => prf);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   695
18030
5dadabde8fe4 Logic.lift_all;
wenzelm
parents: 17756
diff changeset
   696
    val ps = map (Logic.lift_all inc Bi) (Logic.strip_imp_prems prop);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   697
    val k = length ps;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   698
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   699
    fun mk_app b (i, j, prf) =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   700
          if b then (i-1, j, prf %% PBound i) else (i, j-1, prf %> Bound j);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   701
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   702
    fun lift Us bs i j (Const ("==>", _) $ A $ B) =
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   703
            AbsP ("H", NONE (*A*), lift Us (true::bs) (i+1) j B)
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   704
      | lift Us bs i j (Const ("all", _) $ Abs (a, T, t)) =
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   705
            Abst (a, NONE (*T*), lift (T::Us) (false::bs) i (j+1) t)
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
   706
      | lift Us bs i j _ = proof_combP (lifth' (rev Us) [] prf,
23178
07ba6b58b3d2 simplified/unified list fold;
wenzelm
parents: 22846
diff changeset
   707
            map (fn k => (#3 (fold_rev mk_app bs (i-1, j-1, PBound k))))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   708
              (i + k - 1 downto i));
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   709
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   710
    mk_AbsP (k, lift [] [] 0 0 Bi)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   711
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   712
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   713
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   714
(***** proof by assumption *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   715
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   716
fun mk_asm_prf t i m =
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   717
  let
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   718
    fun imp_prf _ i 0 = PBound i
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   719
      | imp_prf (Const ("==>", _) $ A $ B) i m = AbsP ("H", NONE (*A*), imp_prf B (i+1) (m-1))
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   720
      | imp_prf _ i _ = PBound i;
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   721
    fun all_prf (Const ("all", _) $ Abs (a, T, t)) = Abst (a, NONE (*T*), all_prf t)
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   722
      | all_prf t = imp_prf t (~i) m
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   723
  in all_prf t end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   724
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   725
fun assumption_proof Bs Bi n prf =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   726
  mk_AbsP (length Bs, proof_combP (prf,
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   727
    map PBound (length Bs - 1 downto 0) @ [mk_asm_prf Bi n ~1]));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   728
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   729
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   730
(***** Composition of object rule with proof state *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   731
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   732
fun flatten_params_proof i j n (Const ("==>", _) $ A $ B, k) =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   733
      AbsP ("H", NONE (*A*), flatten_params_proof (i+1) j n (B, k))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   734
  | flatten_params_proof i j n (Const ("all", _) $ Abs (a, T, t), k) =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   735
      Abst (a, NONE (*T*), flatten_params_proof i (j+1) n (t, k))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   736
  | flatten_params_proof i j n (_, k) = proof_combP (proof_combt (PBound (k+i),
19304
15f001295a7b remove (op =);
wenzelm
parents: 19222
diff changeset
   737
      map Bound (j-1 downto 0)), map PBound (remove (op =) (i-n) (i-1 downto 0)));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   738
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   739
fun bicompose_proof flatten Bs oldAs newAs A n m rprf sprf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   740
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   741
    val la = length newAs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   742
    val lb = length Bs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   743
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   744
    mk_AbsP (lb+la, proof_combP (sprf,
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   745
      map PBound (lb + la - 1 downto la)) %%
23296
25f28f9c28a3 Adapted Proofterm.bicompose_proof to Larry's changes in
berghofe
parents: 23178
diff changeset
   746
        proof_combP (rprf, (if n>0 then [mk_asm_prf (the A) n m] else []) @
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   747
          map (if flatten then flatten_params_proof 0 0 n else PBound o snd)
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
   748
            (oldAs ~~ (la - 1 downto 0))))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   749
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   750
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   751
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   752
(***** axioms for equality *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   753
14854
61bdf2ae4dc5 removed obsolete sort 'logic';
wenzelm
parents: 14787
diff changeset
   754
val aT = TFree ("'a", []);
61bdf2ae4dc5 removed obsolete sort 'logic';
wenzelm
parents: 14787
diff changeset
   755
val bT = TFree ("'b", []);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   756
val x = Free ("x", aT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   757
val y = Free ("y", aT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   758
val z = Free ("z", aT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   759
val A = Free ("A", propT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   760
val B = Free ("B", propT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   761
val f = Free ("f", aT --> bT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   762
val g = Free ("g", aT --> bT);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   763
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   764
local open Logic in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   765
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   766
val equality_axms =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   767
  [("reflexive", mk_equals (x, x)),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   768
   ("symmetric", mk_implies (mk_equals (x, y), mk_equals (y, x))),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   769
   ("transitive", list_implies ([mk_equals (x, y), mk_equals (y, z)], mk_equals (x, z))),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   770
   ("equal_intr", list_implies ([mk_implies (A, B), mk_implies (B, A)], mk_equals (A, B))),
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   771
   ("equal_elim", list_implies ([mk_equals (A, B), A], B)),
27330
1af2598b5f7d Logic.all/mk_equals/mk_implies;
wenzelm
parents: 26631
diff changeset
   772
   ("abstract_rule", mk_implies
1af2598b5f7d Logic.all/mk_equals/mk_implies;
wenzelm
parents: 26631
diff changeset
   773
      (all x (mk_equals (f $ x, g $ x)), mk_equals (lambda x (f $ x), lambda x (g $ x)))),
1af2598b5f7d Logic.all/mk_equals/mk_implies;
wenzelm
parents: 26631
diff changeset
   774
   ("combination", list_implies
1af2598b5f7d Logic.all/mk_equals/mk_implies;
wenzelm
parents: 26631
diff changeset
   775
      ([mk_equals (f, g), mk_equals (x, y)], mk_equals (f $ x, g $ y)))];
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   776
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   777
val [reflexive_axm, symmetric_axm, transitive_axm, equal_intr_axm,
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   778
  equal_elim_axm, abstract_rule_axm, combination_axm] =
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   779
    map (fn (s, t) => PAxm ("Pure." ^ s, varify t, NONE)) equality_axms;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   780
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   781
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   782
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   783
val reflexive = reflexive_axm % NONE;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   784
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   785
fun symmetric (prf as PAxm ("Pure.reflexive", _, _) % _) = prf
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   786
  | symmetric prf = symmetric_axm % NONE % NONE %% prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   787
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   788
fun transitive _ _ (PAxm ("Pure.reflexive", _, _) % _) prf2 = prf2
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   789
  | transitive _ _ prf1 (PAxm ("Pure.reflexive", _, _) % _) = prf1
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   790
  | transitive u (Type ("prop", [])) prf1 prf2 =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   791
      transitive_axm % NONE % SOME (remove_types u) % NONE %% prf1 %% prf2
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   792
  | transitive u T prf1 prf2 =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   793
      transitive_axm % NONE % NONE % NONE %% prf1 %% prf2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   794
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   795
fun abstract_rule x a prf =
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   796
  abstract_rule_axm % NONE % NONE %% forall_intr_proof x a prf;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   797
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   798
fun check_comb (PAxm ("Pure.combination", _, _) % f % g % _ % _ %% prf %% _) =
19502
wenzelm
parents: 19482
diff changeset
   799
      is_some f orelse check_comb prf
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   800
  | check_comb (PAxm ("Pure.transitive", _, _) % _ % _ % _ %% prf1 %% prf2) =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   801
      check_comb prf1 andalso check_comb prf2
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   802
  | check_comb (PAxm ("Pure.symmetric", _, _) % _ % _ %% prf) = check_comb prf
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   803
  | check_comb _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   804
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   805
fun combination f g t u (Type (_, [T, U])) prf1 prf2 =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   806
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   807
    val f = Envir.beta_norm f;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   808
    val g = Envir.beta_norm g;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   809
    val prf =  if check_comb prf1 then
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   810
        combination_axm % NONE % NONE
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   811
      else (case prf1 of
26424
a6cad32a27b0 eliminated theory ProtoPure;
wenzelm
parents: 26328
diff changeset
   812
          PAxm ("Pure.reflexive", _, _) % _ =>
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   813
            combination_axm %> remove_types f % NONE
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   814
        | _ => combination_axm %> remove_types f %> remove_types g)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   815
  in
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   816
    (case T of
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   817
       Type ("fun", _) => prf %
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   818
         (case head_of f of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   819
            Abs _ => SOME (remove_types t)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   820
          | Var _ => SOME (remove_types t)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   821
          | _ => NONE) %
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   822
         (case head_of g of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   823
            Abs _ => SOME (remove_types u)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   824
          | Var _ => SOME (remove_types u)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   825
          | _ => NONE) %% prf1 %% prf2
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   826
     | _ => prf % NONE % NONE %% prf1 %% prf2)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   827
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   828
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   829
fun equal_intr A B prf1 prf2 =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   830
  equal_intr_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   831
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   832
fun equal_elim A B prf1 prf2 =
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
   833
  equal_elim_axm %> remove_types A %> remove_types B %% prf1 %% prf2;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   834
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   835
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   836
(***** axioms and theorems *****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   837
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   838
val proofs = ref 2;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   839
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   840
fun vars_of t = rev (fold_aterms (fn v as Var _ => insert (op =) v | _ => I) t []);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   841
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   842
fun test_args _ [] = true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   843
  | test_args is (Bound i :: ts) =
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   844
      not (member (op =) is i) andalso test_args (i :: is) ts
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   845
  | test_args _ _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   846
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   847
fun is_fun (Type ("fun", _)) = true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   848
  | is_fun (TVar _) = true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   849
  | is_fun _ = false;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   850
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   851
fun add_funvars Ts (vs, t) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   852
  if is_fun (fastype_of1 (Ts, t)) then
19482
9f11af8f7ef9 tuned basic list operators (flat, maps, map_filter);
wenzelm
parents: 19357
diff changeset
   853
    vs union map_filter (fn Var (ixn, T) =>
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   854
      if is_fun T then SOME ixn else NONE | _ => NONE) (vars_of t)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   855
  else vs;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   856
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   857
fun add_npvars q p Ts (vs, Const ("==>", _) $ t $ u) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   858
      add_npvars q p Ts (add_npvars q (not p) Ts (vs, t), u)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   859
  | add_npvars q p Ts (vs, Const ("all", Type (_, [Type (_, [T, _]), _])) $ t) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   860
      add_npvars q p Ts (vs, if p andalso q then betapply (t, Var (("",0), T)) else t)
12041
27214c16ebe4 Fixed bug in function add_npvars.
berghofe
parents: 11999
diff changeset
   861
  | add_npvars q p Ts (vs, Abs (_, T, t)) = add_npvars q p (T::Ts) (vs, t)
27214c16ebe4 Fixed bug in function add_npvars.
berghofe
parents: 11999
diff changeset
   862
  | add_npvars _ _ Ts (vs, t) = add_npvars' Ts (vs, t)
27214c16ebe4 Fixed bug in function add_npvars.
berghofe
parents: 11999
diff changeset
   863
and add_npvars' Ts (vs, t) = (case strip_comb t of
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   864
    (Var (ixn, _), ts) => if test_args [] ts then vs
17314
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
   865
      else Library.foldl (add_npvars' Ts)
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
   866
        (AList.update (op =) (ixn,
04e21a27c0ad introduces some modern-style AList operations
haftmann
parents: 17221
diff changeset
   867
          Library.foldl (add_funvars Ts) ((these ooo AList.lookup) (op =) vs ixn, ts)) vs, ts)
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   868
  | (Abs (_, T, u), ts) => Library.foldl (add_npvars' (T::Ts)) (vs, u :: ts)
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   869
  | (_, ts) => Library.foldl (add_npvars' Ts) (vs, ts));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   870
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   871
fun prop_vars (Const ("==>", _) $ P $ Q) = prop_vars P union prop_vars Q
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   872
  | prop_vars (Const ("all", _) $ Abs (_, _, t)) = prop_vars t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   873
  | prop_vars t = (case strip_comb t of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   874
      (Var (ixn, _), _) => [ixn] | _ => []);
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   875
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   876
fun is_proj t =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   877
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   878
    fun is_p i t = (case strip_comb t of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   879
        (Bound j, []) => false
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   880
      | (Bound j, ts) => j >= i orelse exists (is_p i) ts
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   881
      | (Abs (_, _, u), _) => is_p (i+1) u
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   882
      | (_, ts) => exists (is_p i) ts)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   883
  in (case strip_abs_body t of
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   884
        Bound _ => true
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   885
      | t' => is_p 0 t')
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   886
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   887
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
   888
fun needed_vars prop =
20853
3ff5a2e05810 *** empty log message ***
haftmann
parents: 20548
diff changeset
   889
  Library.foldl (op union)
3ff5a2e05810 *** empty log message ***
haftmann
parents: 20548
diff changeset
   890
    ([], map (uncurry (insert (op =))) (add_npvars true true [] ([], prop))) union
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   891
  prop_vars prop;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   892
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   893
fun gen_axm_proof c name prop =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   894
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   895
    val nvs = needed_vars prop;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   896
    val args = map (fn (v as Var (ixn, _)) =>
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   897
        if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @
16983
c895701d55ea replaced atless by term_ord;
wenzelm
parents: 16940
diff changeset
   898
      map SOME (sort Term.term_ord (term_frees prop));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   899
  in
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   900
    proof_combt' (c (name, prop, NONE), args)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   901
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   902
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   903
val axm_proof = gen_axm_proof PAxm;
17017
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   904
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   905
val dummy = Const (Term.dummy_patternN, dummyT);
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   906
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   907
fun oracle_proof name prop =
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   908
  if !proofs = 0 then Oracle (name, dummy, NONE)
fa8e32209734 - Tuned handling of oracles
berghofe
parents: 16983
diff changeset
   909
  else gen_axm_proof Oracle name prop;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   910
28319
13cb2108c2b9 added Promise constructor, which is similar to Oracle but may be replaced later;
wenzelm
parents: 27330
diff changeset
   911
fun promise_proof i prop = gen_axm_proof Promise i prop;
13cb2108c2b9 added Promise constructor, which is similar to Oracle but may be replaced later;
wenzelm
parents: 27330
diff changeset
   912
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   913
fun shrink_proof thy =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   914
  let
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   915
    fun shrink ls lev (prf as Abst (a, T, body)) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   916
          let val (b, is, ch, body') = shrink ls (lev+1) body
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
   917
          in (b, is, ch, if ch then Abst (a, T, body') else prf) end
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   918
      | shrink ls lev (prf as AbsP (a, t, body)) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   919
          let val (b, is, ch, body') = shrink (lev::ls) lev body
19482
9f11af8f7ef9 tuned basic list operators (flat, maps, map_filter);
wenzelm
parents: 19357
diff changeset
   920
          in (b orelse member (op =) is 0, map_filter (fn 0 => NONE | i => SOME (i-1)) is,
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
   921
            ch, if ch then AbsP (a, t, body') else prf)
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   922
          end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   923
      | shrink ls lev prf =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   924
          let val (is, ch, _, prf') = shrink' ls lev [] [] prf
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   925
          in (false, is, ch, prf') end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   926
    and shrink' ls lev ts prfs (prf as prf1 %% prf2) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   927
          let
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   928
            val p as (_, is', ch', prf') = shrink ls lev prf2;
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   929
            val (is, ch, ts', prf'') = shrink' ls lev ts (p::prfs) prf1
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   930
          in (is union is', ch orelse ch', ts',
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   931
              if ch orelse ch' then prf'' %% prf' else prf)
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   932
          end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   933
      | shrink' ls lev ts prfs (prf as prf1 % t) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   934
          let val (is, ch, (ch', t')::ts', prf') = shrink' ls lev (t::ts) prfs prf1
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   935
          in (is, ch orelse ch', ts',
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
   936
              if ch orelse ch' then prf' % t' else prf) end
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   937
      | shrink' ls lev ts prfs (prf as PBound i) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   938
          (if exists (fn SOME (Bound j) => lev-j <= List.nth (ls, i) | _ => true) ts
18928
042608ffa2ec subsituted gen_duplicates / has_duplicates for duplicates whenever appropriate
haftmann
parents: 18485
diff changeset
   939
             orelse has_duplicates (op =)
042608ffa2ec subsituted gen_duplicates / has_duplicates for duplicates whenever appropriate
haftmann
parents: 18485
diff changeset
   940
               (Library.foldl (fn (js, SOME (Bound j)) => j :: js | (js, _) => js) ([], ts))
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   941
             orelse exists #1 prfs then [i] else [], false, map (pair false) ts, prf)
26631
d6b6c74a8bcf rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents: 26424
diff changeset
   942
      | shrink' ls lev ts prfs (Hyp t) = ([], false, map (pair false) ts, Hyp t)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   943
      | shrink' ls lev ts prfs MinProof = ([], false, map (pair false) ts, MinProof)
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   944
      | shrink' ls lev ts prfs prf =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   945
          let
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   946
            val prop =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   947
              (case prf of
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   948
                PAxm (_, prop, _) => prop
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   949
              | Oracle (_, prop, _) => prop
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   950
              | Promise (_, prop, _) => prop
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
   951
              | PThm (_, ((_, prop, _), _)) => prop
28319
13cb2108c2b9 added Promise constructor, which is similar to Oracle but may be replaced later;
wenzelm
parents: 27330
diff changeset
   952
              | _ => error "shrink: proof not in normal form");
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   953
            val vs = vars_of prop;
19012
wenzelm
parents: 18928
diff changeset
   954
            val (ts', ts'') = chop (length vs) ts;
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   955
            val insts = Library.take (length ts', map (fst o dest_Var) vs) ~~ ts';
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   956
            val nvs = Library.foldl (fn (ixns', (ixn, ixns)) =>
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   957
              insert (op =) ixn (case AList.lookup (op =) insts ixn of
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   958
                  SOME (SOME t) => if is_proj t then ixns union ixns' else ixns'
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   959
                | _ => ixns union ixns'))
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   960
                  (needed prop ts'' prfs, add_npvars false true [] ([], prop));
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   961
            val insts' = map
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   962
              (fn (ixn, x as SOME _) => if member (op =) nvs ixn then (false, x) else (true, NONE)
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   963
                | (_, x) => (false, x)) insts
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   964
          in ([], false, insts' @ map (pair false) ts'', prf) end
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   965
    and needed (Const ("==>", _) $ t $ u) ts ((b, _, _, _)::prfs) =
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   966
          (if b then map (fst o dest_Var) (vars_of t) else []) union needed u ts prfs
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   967
      | needed (Var (ixn, _)) (_::_) _ = [ixn]
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   968
      | needed _ _ _ = [];
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
   969
  in shrink end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   970
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   971
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   972
(**** Simple first order matching functions for terms and proofs ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   973
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   974
exception PMatch;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   975
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   976
(** see pattern.ML **)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   977
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
   978
fun flt (i: int) = List.filter (fn n => n < i);
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   979
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   980
fun fomatch Ts tymatch j =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   981
  let
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   982
    fun mtch (instsp as (tyinsts, insts)) = fn
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   983
        (Var (ixn, T), t)  =>
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   984
          if j>0 andalso not (null (flt j (loose_bnos t)))
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   985
          then raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   986
          else (tymatch (tyinsts, fn () => (T, fastype_of1 (Ts, t))),
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   987
            (ixn, t) :: insts)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   988
      | (Free (a, T), Free (b, U)) =>
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   989
          if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   990
      | (Const (a, T), Const (b, U))  =>
20147
7aa076a45cb4 fold_proof_terms: canonical arguments;
wenzelm
parents: 20071
diff changeset
   991
          if a=b then (tymatch (tyinsts, K (T, U)), insts) else raise PMatch
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   992
      | (f $ t, g $ u) => mtch (mtch instsp (f, g)) (t, u)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   993
      | (Bound i, Bound j) => if i=j then instsp else raise PMatch
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   994
      | _ => raise PMatch
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   995
  in mtch end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   996
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
   997
fun match_proof Ts tymatch =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
   998
  let
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
   999
    fun optmatch _ inst (NONE, _) = inst
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1000
      | optmatch _ _ (SOME _, NONE) = raise PMatch
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1001
      | optmatch mtch inst (SOME x, SOME y) = mtch inst (x, y)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1002
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1003
    fun matcht Ts j (pinst, tinst) (t, u) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1004
      (pinst, fomatch Ts tymatch j tinst (t, Envir.beta_norm u));
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1005
    fun matchT (pinst, (tyinsts, insts)) p =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1006
      (pinst, (tymatch (tyinsts, K p), insts));
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1007
    fun matchTs inst (Ts, Us) = Library.foldl (uncurry matchT) (inst, Ts ~~ Us);
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1008
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1009
    fun mtch Ts i j (pinst, tinst) (Hyp (Var (ixn, _)), prf) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1010
          if i = 0 andalso j = 0 then ((ixn, prf) :: pinst, tinst)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1011
          else (case apfst (flt i) (apsnd (flt j)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1012
                  (prf_add_loose_bnos 0 0 prf ([], []))) of
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1013
              ([], []) => ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1014
            | ([], _) => if j = 0 then
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1015
                   ((ixn, incr_pboundvars (~i) (~j) prf) :: pinst, tinst)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1016
                 else raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1017
            | _ => raise PMatch)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1018
      | mtch Ts i j inst (prf1 % opt1, prf2 % opt2) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1019
          optmatch (matcht Ts j) (mtch Ts i j inst (prf1, prf2)) (opt1, opt2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1020
      | mtch Ts i j inst (prf1 %% prf2, prf1' %% prf2') =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1021
          mtch Ts i j (mtch Ts i j inst (prf1, prf1')) (prf2, prf2')
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1022
      | mtch Ts i j inst (Abst (_, opT, prf1), Abst (_, opU, prf2)) =
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
  1023
          mtch (the_default dummyT opU :: Ts) i (j+1)
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1024
            (optmatch matchT inst (opT, opU)) (prf1, prf2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1025
      | mtch Ts i j inst (prf1, Abst (_, opU, prf2)) =
18485
5959295f82d3 bicompose_proof: no_flatten;
wenzelm
parents: 18316
diff changeset
  1026
          mtch (the_default dummyT opU :: Ts) i (j+1) inst
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1027
            (incr_pboundvars 0 1 prf1 %> Bound 0, prf2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1028
      | mtch Ts i j inst (AbsP (_, opt, prf1), AbsP (_, opu, prf2)) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1029
          mtch Ts (i+1) j (optmatch (matcht Ts j) inst (opt, opu)) (prf1, prf2)
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1030
      | mtch Ts i j inst (prf1, AbsP (_, _, prf2)) =
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1031
          mtch Ts (i+1) j inst (incr_pboundvars 1 0 prf1 %% PBound 0, prf2)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1032
      | mtch Ts i j inst (PAxm (s1, _, opTs), PAxm (s2, _, opUs)) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1033
          if s1 = s2 then optmatch matchTs inst (opTs, opUs)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1034
          else raise PMatch
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1035
      | mtch Ts i j inst (PThm (_, ((name1, prop1, opTs), _)), PThm (_, ((name2, prop2, opUs), _))) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1036
          if name1 = name2 andalso prop1 = prop2 then
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1037
            optmatch matchTs inst (opTs, opUs)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1038
          else raise PMatch
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1039
      | mtch _ _ _ inst (PBound i, PBound j) = if i = j then inst else raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1040
      | mtch _ _ _ _ _ = raise PMatch
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1041
  in mtch Ts 0 0 end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1042
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1043
fun prf_subst (pinst, (tyinsts, insts)) =
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1044
  let
15797
a63605582573 - Eliminated nodup_vars check.
berghofe
parents: 15632
diff changeset
  1045
    val substT = Envir.typ_subst_TVars tyinsts;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1046
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
  1047
    fun subst' lev (t as Var (ixn, _)) = (case AList.lookup (op =) insts ixn of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1048
          NONE => t
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1049
        | SOME u => incr_boundvars lev u)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1050
      | subst' lev (Const (s, T)) = Const (s, substT T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1051
      | subst' lev (Free (s, T)) = Free (s, substT T)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1052
      | subst' lev (Abs (a, T, body)) = Abs (a, substT T, subst' (lev+1) body)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1053
      | subst' lev (f $ t) = subst' lev f $ subst' lev t
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1054
      | subst' _ t = t;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1055
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1056
    fun subst plev tlev (AbsP (a, t, body)) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1057
          AbsP (a, Option.map (subst' tlev) t, subst (plev+1) tlev body)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1058
      | subst plev tlev (Abst (a, T, body)) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1059
          Abst (a, Option.map substT T, subst plev (tlev+1) body)
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
  1060
      | subst plev tlev (prf %% prf') = subst plev tlev prf %% subst plev tlev prf'
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1061
      | subst plev tlev (prf % t) = subst plev tlev prf % Option.map (subst' tlev) t
17325
d9d50222808e introduced new-style AList operations
haftmann
parents: 17314
diff changeset
  1062
      | subst plev tlev (prf as Hyp (Var (ixn, _))) = (case AList.lookup (op =) pinst ixn of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1063
          NONE => prf
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1064
        | SOME prf' => incr_pboundvars plev tlev prf')
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1065
      | subst _ _ (PAxm (id, prop, Ts)) =
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1066
          PAxm (id, prop, Option.map (map substT) Ts)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1067
      | subst _ _ (PThm (i, ((id, prop, Ts), body))) =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1068
          PThm (i, ((id, prop, Option.map (map substT) Ts), body))
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1069
      | subst _ _ t = t;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1070
  in subst 0 0 end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1071
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
  1072
(*A fast unification filter: true unless the two terms cannot be unified.
12871
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1073
  Terms must be NORMAL.  Treats all Vars as distinct. *)
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1074
fun could_unify prf1 prf2 =
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1075
  let
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1076
    fun matchrands (prf1 %% prf2) (prf1' %% prf2') =
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1077
          could_unify prf2 prf2' andalso matchrands prf1 prf1'
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1078
      | matchrands (prf % SOME t) (prf' % SOME t') =
12871
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1079
          Term.could_unify (t, t') andalso matchrands prf prf'
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1080
      | matchrands (prf % _) (prf' % _) = matchrands prf prf'
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1081
      | matchrands _ _ = true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1082
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1083
    fun head_of (prf %% _) = head_of prf
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1084
      | head_of (prf % _) = head_of prf
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1085
      | head_of prf = prf
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1086
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1087
  in case (head_of prf1, head_of prf2) of
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1088
        (_, Hyp (Var _)) => true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1089
      | (Hyp (Var _), _) => true
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1090
      | (PAxm (a, _, _), PAxm (b, _, _)) => a = b andalso matchrands prf1 prf2
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1091
      | (PThm (_, ((a, propa, _), _)), PThm (_, ((b, propb, _), _))) =>
12871
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1092
          a = b andalso propa = propb andalso matchrands prf1 prf2
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1093
      | (PBound i, PBound j) => i = j andalso matchrands prf1 prf2
12871
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1094
      | (AbsP _, _) =>  true   (*because of possible eta equality*)
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1095
      | (Abst _, _) =>  true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1096
      | (_, AbsP _) =>  true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1097
      | (_, Abst _) =>  true
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1098
      | _ => false
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1099
  end;
21486a0557d1 Added function could_unify to speed up rewriting of proof terms.
berghofe
parents: 12868
diff changeset
  1100
28329
e6a5fa9f1e41 added conditional add_oracles, keep oracles_of_proof private;
wenzelm
parents: 28319
diff changeset
  1101
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1102
(**** rewriting on proof terms ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1103
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1104
val skel0 = PBound 0;
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1105
12279
dc3020e938e2 Extended match_proof to handle abstractions.
berghofe
parents: 12233
diff changeset
  1106
fun rewrite_prf tymatch (rules, procs) prf =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1107
  let
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1108
    fun rew _ (Abst (_, _, body) % SOME t) = SOME (prf_subst_bounds [t] body, skel0)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1109
      | rew _ (AbsP (_, _, body) %% prf) = SOME (prf_subst_pbounds [prf] body, skel0)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1110
      | rew Ts prf = (case get_first (fn r => r Ts prf) procs of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1111
          SOME prf' => SOME (prf', skel0)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1112
        | NONE => get_first (fn (prf1, prf2) => SOME (prf_subst
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1113
            (match_proof Ts tymatch ([], (Vartab.empty, [])) (prf1, prf)) prf2, prf2)
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1114
               handle PMatch => NONE) (filter (could_unify prf o fst) rules));
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1115
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
  1116
    fun rew0 Ts (prf as AbsP (_, _, prf' %% PBound 0)) =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1117
          if prf_loose_Pbvar1 prf' 0 then rew Ts prf
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1118
          else
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1119
            let val prf'' = incr_pboundvars (~1) 0 prf'
19502
wenzelm
parents: 19482
diff changeset
  1120
            in SOME (the_default (prf'', skel0) (rew Ts prf'')) end
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1121
      | rew0 Ts (prf as Abst (_, _, prf' % SOME (Bound 0))) =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1122
          if prf_loose_bvar1 prf' 0 then rew Ts prf
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1123
          else
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1124
            let val prf'' = incr_pboundvars 0 (~1) prf'
19502
wenzelm
parents: 19482
diff changeset
  1125
            in SOME (the_default (prf'', skel0) (rew Ts prf'')) end
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1126
      | rew0 Ts prf = rew Ts prf;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1127
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1128
    fun rew1 _ (Hyp (Var _)) _ = NONE
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1129
      | rew1 Ts skel prf = (case rew2 Ts skel prf of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1130
          SOME prf1 => (case rew0 Ts prf1 of
19502
wenzelm
parents: 19482
diff changeset
  1131
              SOME (prf2, skel') => SOME (the_default prf2 (rew1 Ts skel' prf2))
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1132
            | NONE => SOME prf1)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1133
        | NONE => (case rew0 Ts prf of
19502
wenzelm
parents: 19482
diff changeset
  1134
              SOME (prf1, skel') => SOME (the_default prf1 (rew1 Ts skel' prf1))
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1135
            | NONE => NONE))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1136
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1137
    and rew2 Ts skel (prf % SOME t) = (case prf of
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1138
            Abst (_, _, body) =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1139
              let val prf' = prf_subst_bounds [t] body
19502
wenzelm
parents: 19482
diff changeset
  1140
              in SOME (the_default prf' (rew2 Ts skel0 prf')) end
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1141
          | _ => (case rew1 Ts (case skel of skel' % _ => skel' | _ => skel0) prf of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1142
              SOME prf' => SOME (prf' % SOME t)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1143
            | NONE => NONE))
15570
8d8c70b41bab Move towards standard functions.
skalberg
parents: 15531
diff changeset
  1144
      | rew2 Ts skel (prf % NONE) = Option.map (fn prf' => prf' % NONE)
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1145
          (rew1 Ts (case skel of skel' % _ => skel' | _ => skel0) prf)
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1146
      | rew2 Ts skel (prf1 %% prf2) = (case prf1 of
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1147
            AbsP (_, _, body) =>
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1148
              let val prf' = prf_subst_pbounds [prf2] body
19502
wenzelm
parents: 19482
diff changeset
  1149
              in SOME (the_default prf' (rew2 Ts skel0 prf')) end
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1150
          | _ =>
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1151
            let val (skel1, skel2) = (case skel of
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1152
                skel1 %% skel2 => (skel1, skel2)
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1153
              | _ => (skel0, skel0))
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1154
            in case rew1 Ts skel1 prf1 of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1155
                SOME prf1' => (case rew1 Ts skel2 prf2 of
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1156
                    SOME prf2' => SOME (prf1' %% prf2')
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1157
                  | NONE => SOME (prf1' %% prf2))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1158
              | NONE => (case rew1 Ts skel2 prf2 of
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1159
                    SOME prf2' => SOME (prf1 %% prf2')
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1160
                  | NONE => NONE)
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1161
            end)
19502
wenzelm
parents: 19482
diff changeset
  1162
      | rew2 Ts skel (Abst (s, T, prf)) = (case rew1 (the_default dummyT T :: Ts)
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1163
              (case skel of Abst (_, _, skel') => skel' | _ => skel0) prf of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1164
            SOME prf' => SOME (Abst (s, T, prf'))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1165
          | NONE => NONE)
13102
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1166
      | rew2 Ts skel (AbsP (s, t, prf)) = (case rew1 Ts
b6f8aae5f152 Added skeletons to speed up rewriting on proof terms.
berghofe
parents: 12923
diff changeset
  1167
              (case skel of AbsP (_, _, skel') => skel' | _ => skel0) prf of
15531
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1168
            SOME prf' => SOME (AbsP (s, t, prf'))
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1169
          | NONE => NONE)
08c8dad8e399 Deleted Library.option type.
skalberg
parents: 15030
diff changeset
  1170
      | rew2 _ _ _ = NONE
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1171
19502
wenzelm
parents: 19482
diff changeset
  1172
  in the_default prf (rew1 [] skel0 prf) end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1173
17203
29b2563f5c11 refer to theory instead of low-level tsig;
wenzelm
parents: 17017
diff changeset
  1174
fun rewrite_proof thy = rewrite_prf (fn (tyenv, f) =>
29b2563f5c11 refer to theory instead of low-level tsig;
wenzelm
parents: 17017
diff changeset
  1175
  Sign.typ_match thy (f ()) tyenv handle Type.TYPE_MATCH => raise PMatch);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1176
11715
592923615f77 Tuned several functions to improve sharing of unchanged subproofs.
berghofe
parents: 11652
diff changeset
  1177
fun rewrite_proof_notypes rews = rewrite_prf fst rews;
11615
ca7be12b2cbc - Exchanged % and %%.
berghofe
parents: 11543
diff changeset
  1178
16940
d14ec6f2d29b adapted Type.typ_match;
wenzelm
parents: 16880
diff changeset
  1179
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1180
(**** theory data ****)
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1181
16458
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 15797
diff changeset
  1182
structure ProofData = TheoryDataFun
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22662
diff changeset
  1183
(
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1184
  type T = (stamp * (proof * proof)) list * (stamp * (typ list -> proof -> proof option)) list;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1185
12233
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1186
  val empty = ([], []);
3348aa8061d1 - Fixed bug in shrink
berghofe
parents: 12123
diff changeset
  1187
  val copy = I;
16458
4c6fd0c01d28 accomodate change of TheoryDataFun;
wenzelm
parents: 15797
diff changeset
  1188
  val extend = I;
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1189
  fun merge _ ((rules1, procs1), (rules2, procs2)) : T =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1190
    (AList.merge (op =) (K true) (rules1, rules2),
22662
3e492ba59355 canonical merge operations
haftmann
parents: 21646
diff changeset
  1191
      AList.merge (op =) (K true) (procs1, procs2));
22846
fb79144af9a3 simplified DataFun interfaces;
wenzelm
parents: 22662
diff changeset
  1192
);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1193
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1194
fun get_data thy = let val (rules, procs) = ProofData.get thy in (map #2 rules, map #2 procs) end;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1195
fun rew_proof thy = rewrite_prf fst (get_data thy);
23780
a0e7305dd0cb Added function rew_proof (for pre-normalizing proofs).
berghofe
parents: 23296
diff changeset
  1196
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1197
fun add_prf_rrule r = (ProofData.map o apfst) (cons (stamp (), r));
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1198
fun add_prf_rproc p = (ProofData.map o apsnd) (cons (stamp (), p));
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1199
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1200
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1201
(***** theorems *****)
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1202
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1203
fun fulfill_proof promises body0 =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1204
  let
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1205
    val tab = Inttab.make promises;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1206
    fun fill (Promise (i, _, _)) = Option.map Lazy.force (Inttab.lookup tab i)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1207
      | fill _ = NONE;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1208
    val PBody {oracles = oracles0, thms = thms0, proof = proof0} = body0;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1209
    val proof = proof0 |> rewrite_proof_notypes ([], [K fill]);
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1210
    val (oracles, thms) = (oracles0, thms0)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1211
      |> fold (merge_body o make_body o Lazy.force o #2) promises;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1212
  in PBody {oracles = oracles, thms = thms, proof = proof} end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1213
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1214
fun thm_proof thy name hyps prop promises body =
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1215
  let
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1216
    val PBody {oracles = oracles0, thms = thms0, proof = prf} = body;
12923
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1217
    val prop = Logic.list_implies (hyps, prop);
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1218
    val nvs = needed_vars prop;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1219
    val args = map (fn (v as Var (ixn, _)) =>
17492
714c95aab8bc shrink: compress terms and types;
wenzelm
parents: 17412
diff changeset
  1220
        if member (op =) nvs ixn then SOME v else NONE) (vars_of prop) @
16983
c895701d55ea replaced atless by term_ord;
wenzelm
parents: 16940
diff changeset
  1221
      map SOME (sort Term.term_ord (term_frees prop));
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1222
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1223
    val proof0 =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1224
      if ! proofs = 2 then
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1225
        #4 (shrink_proof thy [] 0 (rew_proof thy (fold_rev implies_intr_proof hyps prf)))
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1226
      else MinProof;
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1227
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1228
    fun new_prf () = (serial (), ((name, prop, NONE),
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1229
      Lazy.lazy (fn () =>
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1230
        fulfill_proof promises (PBody {oracles = oracles0, thms = thms0, proof = proof0}))));
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1231
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1232
    val head =
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1233
      (case strip_combt (fst (strip_combP prf)) of
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1234
        (PThm (i, ((old_name, prop', NONE), body')), args') =>
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1235
          if (old_name = "" orelse old_name = name) andalso
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1236
             prop = prop' andalso args = args'
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1237
          then (i, ((name, prop, NONE), body'))
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1238
          else new_prf ()
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1239
      | _ => new_prf ())
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1240
  in
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1241
    (head, proof_combP (proof_combt' (PThm head, args), map Hyp hyps))
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1242
  end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1243
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
  1244
fun get_name hyps prop prf =
12923
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1245
  let val prop = Logic.list_implies (hyps, prop) in
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1246
    (case strip_combt (fst (strip_combP prf)) of
28803
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1247
      (PAxm (name, prop', _), _) => if prop = prop' then name else ""   (* FIXME !? *)
d90258bbb18f reworked type proof: MinProof is vacous, added Promise, refined PThm (with serial);
wenzelm
parents: 28329
diff changeset
  1248
    | (PThm (_, ((name, prop', _), _)), _) => if prop = prop' then name else ""
21646
c07b5b0e8492 thm/prf: separate official name vs. additional tags;
wenzelm
parents: 20853
diff changeset
  1249
    | _ => "")
12923
9ba7c5358fa0 fixed get_name_tags in order to work with hyps;
wenzelm
parents: 12907
diff changeset
  1250
  end;
11519
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1251
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1252
end;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1253
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1254
structure BasicProofterm : BASIC_PROOFTERM = Proofterm;
0c96830636a1 New implementation of LF style proof terms.
berghofe
parents:
diff changeset
  1255
open BasicProofterm;