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