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