src/Pure/theory.ML
author wenzelm
Mon Dec 11 21:39:26 2006 +0100 (2006-12-11)
changeset 21772 7c7ade4f537b
parent 21608 2ca27eeb2841
child 22485 3a7d623485fa
permissions -rw-r--r--
advanced translation functions: Proof.context;
     1 (*  Title:      Pure/theory.ML
     2     ID:         $Id$
     3     Author:     Lawrence C Paulson and Markus Wenzel
     4 
     5 Logical theory content: axioms, definitions, oracles.
     6 *)
     7 
     8 signature BASIC_THEORY =
     9 sig
    10   val sign_of: theory -> theory    (*obsolete*)
    11   val rep_theory: theory ->
    12    {axioms: term NameSpace.table,
    13     defs: Defs.T,
    14     oracles: ((theory * Object.T -> term) * stamp) NameSpace.table}
    15   val parents_of: theory -> theory list
    16   val ancestors_of: theory -> theory list
    17   val eq_thy: theory * theory -> bool
    18   val subthy: theory * theory -> bool
    19   val cert_axm: theory -> string * term -> string * term
    20   val read_def_axm: theory * (indexname -> typ option) * (indexname -> sort option) ->
    21     string list -> string * string -> string * term
    22   val read_axm: theory -> string * string -> string * term
    23   val inferT_axm: theory -> string * term -> string * term
    24 end
    25 
    26 signature THEORY =
    27 sig
    28   include BASIC_THEORY
    29   include SIGN_THEORY
    30   val begin_theory: string -> theory list -> theory
    31   val end_theory: theory -> theory
    32   val checkpoint: theory -> theory
    33   val copy: theory -> theory
    34   val init_data: theory -> theory
    35   val axiom_space: theory -> NameSpace.T
    36   val oracle_space: theory -> NameSpace.T
    37   val axioms_of: theory -> (string * term) list
    38   val all_axioms_of: theory -> (string * term) list
    39   val defs_of : theory -> Defs.T
    40   val self_ref: theory -> theory_ref
    41   val deref: theory_ref -> theory
    42   val merge: theory * theory -> theory                     (*exception TERM*)
    43   val merge_refs: theory_ref * theory_ref -> theory_ref    (*exception TERM*)
    44   val merge_list: theory list -> theory                    (*exception TERM*)
    45   val requires: theory -> string -> string -> unit
    46   val assert_super: theory -> theory -> theory
    47   val add_axioms: (bstring * string) list -> theory -> theory
    48   val add_axioms_i: (bstring * term) list -> theory -> theory
    49   val add_deps: string -> string * typ -> (string * typ) list -> theory -> theory
    50   val add_defs: bool -> bool -> (bstring * string) list -> theory -> theory
    51   val add_defs_i: bool -> bool -> (bstring * term) list -> theory -> theory
    52   val add_finals: bool -> string list -> theory -> theory
    53   val add_finals_i: bool -> term list -> theory -> theory
    54   val add_oracle: bstring * (theory * Object.T -> term) -> theory -> theory
    55 end
    56 
    57 structure Theory: THEORY =
    58 struct
    59 
    60 
    61 (** type theory **)
    62 
    63 (* context operations *)
    64 
    65 val eq_thy = Context.eq_thy;
    66 val subthy = Context.subthy;
    67 
    68 val parents_of = Context.parents_of;
    69 val ancestors_of = Context.ancestors_of;
    70 
    71 val self_ref = Context.self_ref;
    72 val deref = Context.deref;
    73 val merge = Context.merge;
    74 val merge_refs = Context.merge_refs;
    75 
    76 fun merge_list [] = raise TERM ("Empty merge of theories", [])
    77   | merge_list (thy :: thys) = Library.foldl merge (thy, thys);
    78 
    79 val begin_theory = Sign.local_path oo Context.begin_thy Sign.pp;
    80 val end_theory = Context.finish_thy;
    81 val checkpoint = Context.checkpoint_thy;
    82 val copy = Context.copy_thy;
    83 
    84 
    85 (* signature operations *)
    86 
    87 val sign_of = I;
    88 
    89 structure SignTheory: SIGN_THEORY = Sign;
    90 open SignTheory;
    91 
    92 
    93 
    94 (** datatype thy **)
    95 
    96 datatype thy = Thy of
    97  {axioms: term NameSpace.table,
    98   defs: Defs.T,
    99   oracles: ((theory * Object.T -> term) * stamp) NameSpace.table};
   100 
   101 fun make_thy (axioms, defs, oracles) =
   102   Thy {axioms = axioms, defs = defs, oracles = oracles};
   103 
   104 fun err_dup_axms dups = error ("Duplicate axiom(s): " ^ commas_quote dups);
   105 fun err_dup_oras dups = error ("Duplicate oracle(s): " ^ commas_quote dups);
   106 
   107 structure ThyData = TheoryDataFun
   108 (struct
   109   val name = "Pure/theory";
   110   type T = thy;
   111   val empty = make_thy (NameSpace.empty_table, Defs.empty, NameSpace.empty_table);
   112   val copy = I;
   113 
   114   fun extend (Thy {axioms, defs, oracles}) = make_thy (NameSpace.empty_table, defs, oracles);
   115 
   116   fun merge pp (thy1, thy2) =
   117     let
   118       val Thy {axioms = _, defs = defs1, oracles = oracles1} = thy1;
   119       val Thy {axioms = _, defs = defs2, oracles = oracles2} = thy2;
   120 
   121       val axioms = NameSpace.empty_table;
   122       val defs = Defs.merge pp (defs1, defs2);
   123       val oracles = NameSpace.merge_tables (eq_snd (op =)) (oracles1, oracles2)
   124         handle Symtab.DUPS dups => err_dup_oras dups;
   125     in make_thy (axioms, defs, oracles) end;
   126 
   127   fun print _ _ = ();
   128 end);
   129 
   130 val init_data = ThyData.init;
   131 
   132 fun rep_theory thy = ThyData.get thy |> (fn Thy args => args);
   133 
   134 fun map_thy f = ThyData.map (fn (Thy {axioms, defs, oracles}) =>
   135   make_thy (f (axioms, defs, oracles)));
   136 
   137 fun map_axioms f = map_thy (fn (axioms, defs, oracles) => (f axioms, defs, oracles));
   138 fun map_defs f = map_thy (fn (axioms, defs, oracles) => (axioms, f defs, oracles));
   139 fun map_oracles f = map_thy (fn (axioms, defs, oracles) => (axioms, defs, f oracles));
   140 
   141 
   142 (* basic operations *)
   143 
   144 val axiom_space = #1 o #axioms o rep_theory;
   145 val oracle_space = #1 o #oracles o rep_theory;
   146 
   147 val axioms_of = Symtab.dest o #2 o #axioms o rep_theory;
   148 fun all_axioms_of thy = maps axioms_of (thy :: ancestors_of thy);
   149 
   150 val defs_of = #defs o rep_theory;
   151 
   152 fun requires thy name what =
   153   if Context.exists_name name thy then ()
   154   else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
   155 
   156 fun assert_super thy1 thy2 =
   157   if subthy (thy1, thy2) then thy2
   158   else raise THEORY ("Not a super theory", [thy1, thy2]);
   159 
   160 
   161 
   162 (** add axioms **)
   163 
   164 (* prepare axioms *)
   165 
   166 fun err_in_axm msg name =
   167   cat_error msg ("The error(s) above occurred in axiom " ^ quote name);
   168 
   169 fun cert_axm thy (name, raw_tm) =
   170   let
   171     val (t, T, _) = Sign.certify_prop thy raw_tm
   172       handle TYPE (msg, _, _) => error msg
   173         | TERM (msg, _) => error msg;
   174   in
   175     Term.no_dummy_patterns t handle TERM (msg, _) => error msg;
   176     (name, Sign.no_vars (Sign.pp thy) t)
   177   end;
   178 
   179 fun read_def_axm (thy, types, sorts) used (name, str) =
   180   let
   181     val ts = Syntax.read (ProofContext.init thy) (Sign.is_logtype thy) (Sign.syn_of thy) propT str;
   182     val (t, _) =
   183       Sign.infer_types (Sign.pp thy) thy (Sign.consts_of thy)
   184         types sorts (Name.make_context used) true (ts, propT);
   185   in cert_axm thy (name, t) end
   186   handle ERROR msg => err_in_axm msg name;
   187 
   188 fun read_axm thy name_str = read_def_axm (thy, K NONE, K NONE) [] name_str;
   189 
   190 fun inferT_axm thy (name, pre_tm) =
   191   let
   192     val pp = Sign.pp thy;
   193     val (t, _) =
   194       Sign.infer_types pp thy (Sign.consts_of thy)
   195         (K NONE) (K NONE) Name.context true ([pre_tm], propT);
   196   in (name, Sign.no_vars pp t) end
   197   handle ERROR msg => err_in_axm msg name;
   198 
   199 
   200 (* add_axioms(_i) *)
   201 
   202 local
   203 
   204 fun gen_add_axioms prep_axm raw_axms thy = thy |> map_axioms (fn axioms =>
   205   let
   206     val axms = map (apsnd (Compress.term thy o Logic.varify) o prep_axm thy) raw_axms;
   207     val axioms' = NameSpace.extend_table (Sign.naming_of thy) (axioms, axms)
   208       handle Symtab.DUPS dups => err_dup_axms dups;
   209   in axioms' end);
   210 
   211 in
   212 
   213 val add_axioms = gen_add_axioms read_axm;
   214 val add_axioms_i = gen_add_axioms cert_axm;
   215 
   216 end;
   217 
   218 
   219 
   220 (** add constant definitions **)
   221 
   222 (* dependencies *)
   223 
   224 fun dependencies thy unchecked is_def name lhs rhs =
   225   let
   226     val pp = Sign.pp thy;
   227     val consts = Sign.consts_of thy;
   228     fun prep const =
   229       let val Const (c, T) = Sign.no_vars pp (Const const)
   230       in (c, Consts.typargs consts (c, Compress.typ thy (Logic.varifyT T))) end;
   231 
   232     val lhs_vars = Term.add_tfreesT (#2 lhs) [];
   233     val rhs_extras = fold (#2 #> Term.fold_atyps (fn TFree v =>
   234       if member (op =) lhs_vars v then I else insert (op =) v | _ => I)) rhs [];
   235     val _ =
   236       if null rhs_extras then ()
   237       else error ("Specification depends on extra type variables: " ^
   238         commas_quote (map (Pretty.string_of_typ pp o TFree) rhs_extras) ^
   239         "\nThe error(s) above occurred in " ^ quote name);
   240   in Defs.define pp unchecked is_def (Context.theory_name thy) name (prep lhs) (map prep rhs) end;
   241 
   242 fun add_deps a raw_lhs raw_rhs thy =
   243   let
   244     val lhs :: rhs = map (dest_Const o Sign.cert_term thy o Const) (raw_lhs :: raw_rhs);
   245     val name = if a = "" then (#1 lhs ^ " axiom") else a;
   246   in thy |> map_defs (dependencies thy false false name lhs rhs) end;
   247 
   248 
   249 (* check_overloading *)
   250 
   251 fun check_overloading thy overloaded (c, T) =
   252   let
   253     val declT =
   254       (case Sign.const_constraint thy c of
   255         NONE => error ("Undeclared constant " ^ quote c)
   256       | SOME declT => declT);
   257     val T' = Logic.varifyT T;
   258 
   259     fun message txt =
   260       [Pretty.block [Pretty.str "Specification of constant ",
   261         Pretty.str c, Pretty.str " ::", Pretty.brk 1, Pretty.quote (Sign.pretty_typ thy T)],
   262         Pretty.str txt] |> Pretty.chunks |> Pretty.string_of;
   263   in
   264     if Sign.typ_instance thy (declT, T') then ()
   265     else if Type.raw_instance (declT, T') then
   266       error (Library.setmp show_sorts true
   267         message "imposes additional sort constraints on the constant declaration")
   268     else if overloaded then ()
   269     else warning (message "is strictly less general than the declared type");
   270     (c, T)
   271   end;
   272 
   273 
   274 (* check_def *)
   275 
   276 fun check_def thy unchecked overloaded (bname, tm) defs =
   277   let
   278     val name = Sign.full_name thy bname;
   279     val (lhs_const, rhs) = Sign.cert_def (Sign.pp thy) tm;
   280     val rhs_consts = fold_aterms (fn Const const => insert (op =) const | _ => I) rhs [];
   281     val _ = check_overloading thy overloaded lhs_const;
   282   in defs |> dependencies thy unchecked true name lhs_const rhs_consts end
   283   handle ERROR msg => cat_error msg (Pretty.string_of (Pretty.block
   284    [Pretty.str ("The error(s) above occurred in definition " ^ quote bname ^ ":"),
   285     Pretty.fbrk, Pretty.quote (Sign.pretty_term thy tm)]));
   286 
   287 
   288 (* add_defs(_i) *)
   289 
   290 local
   291 
   292 fun gen_add_defs prep_axm unchecked overloaded raw_axms thy =
   293   let val axms = map (prep_axm thy) raw_axms in
   294     thy
   295     |> map_defs (fold (check_def thy unchecked overloaded) axms)
   296     |> add_axioms_i axms
   297   end;
   298 
   299 in
   300 
   301 val add_defs_i = gen_add_defs cert_axm;
   302 val add_defs = gen_add_defs read_axm;
   303 
   304 end;
   305 
   306 
   307 (* add_finals(_i) *)
   308 
   309 local
   310 
   311 fun gen_add_finals prep_term overloaded args thy =
   312   let
   313     fun const_of (Const const) = const
   314       | const_of (Free _) = error "Attempt to finalize variable (or undeclared constant)"
   315       | const_of _ = error "Attempt to finalize non-constant term";
   316     fun specify (c, T) = dependencies thy false false (c ^ " axiom") (c, T) [];
   317     val finalize = specify o check_overloading thy overloaded o const_of o prep_term thy;
   318   in thy |> map_defs (fold finalize args) end;
   319 
   320 in
   321 
   322 val add_finals = gen_add_finals Sign.read_term;
   323 val add_finals_i = gen_add_finals Sign.cert_term;
   324 
   325 end;
   326 
   327 
   328 
   329 (** add oracle **)
   330 
   331 fun add_oracle (bname, oracle) thy = thy |> map_oracles (fn oracles =>
   332   NameSpace.extend_table (Sign.naming_of thy) (oracles, [(bname, (oracle, stamp ()))])
   333     handle Symtab.DUPS dups => err_dup_oras dups);
   334 
   335 end;
   336 
   337 structure BasicTheory: BASIC_THEORY = Theory;
   338 open BasicTheory;