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