src/Pure/theory.ML
author wenzelm
Sat Apr 14 23:56:36 2007 +0200 (2007-04-14)
changeset 22689 b800228434a8
parent 22684 a614c5f506ea
child 22697 92f8e9a8df78
permissions -rw-r--r--
simplified read_axm;
     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 parents_of: theory -> theory list
    19   val ancestors_of: theory -> theory list
    20   val begin_theory: string -> theory list -> theory
    21   val end_theory: theory -> theory
    22   val checkpoint: theory -> theory
    23   val copy: theory -> theory
    24   val init_data: theory -> theory
    25   val rep_theory: theory ->
    26    {axioms: term NameSpace.table,
    27     defs: Defs.T,
    28     oracles: ((theory * Object.T -> term) * stamp) NameSpace.table}
    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 self_ref: theory -> theory_ref
    37   val deref: theory_ref -> theory
    38   val merge: theory * theory -> theory                     (*exception TERM*)
    39   val merge_refs: theory_ref * theory_ref -> theory_ref    (*exception TERM*)
    40   val merge_list: theory list -> theory                    (*exception TERM*)
    41   val requires: theory -> string -> string -> unit
    42   val assert_super: theory -> theory -> theory
    43   val cert_axm: theory -> string * term -> string * term
    44   val read_axm: theory -> string * string -> string * term
    45   val inferT_axm: theory -> string * term -> string * term
    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 fun merge_list [] = raise TERM ("Empty merge of theories", [])
    76   | merge_list (thy :: thys) = Library.foldl merge (thy, thys);
    77 
    78 val begin_theory = Sign.local_path oo Context.begin_thy Sign.pp;
    79 val end_theory = Context.finish_thy;
    80 val checkpoint = Context.checkpoint_thy;
    81 val copy = Context.copy_thy;
    82 
    83 
    84 (* signature operations *)
    85 
    86 structure SignTheory: SIGN_THEORY = Sign;
    87 open SignTheory;
    88 
    89 
    90 
    91 (** datatype thy **)
    92 
    93 datatype thy = Thy of
    94  {axioms: term NameSpace.table,
    95   defs: Defs.T,
    96   oracles: ((theory * Object.T -> term) * stamp) NameSpace.table};
    97 
    98 fun make_thy (axioms, defs, oracles) =
    99   Thy {axioms = axioms, defs = defs, oracles = oracles};
   100 
   101 fun err_dup_axms dups = error ("Duplicate axiom(s): " ^ commas_quote dups);
   102 fun err_dup_oras dups = error ("Duplicate oracle(s): " ^ commas_quote dups);
   103 
   104 structure ThyData = TheoryDataFun
   105 (struct
   106   val name = "Pure/theory";
   107   type T = thy;
   108   val empty = make_thy (NameSpace.empty_table, Defs.empty, NameSpace.empty_table);
   109   val copy = I;
   110 
   111   fun extend (Thy {axioms, defs, oracles}) = make_thy (NameSpace.empty_table, defs, oracles);
   112 
   113   fun merge pp (thy1, thy2) =
   114     let
   115       val Thy {axioms = _, defs = defs1, oracles = oracles1} = thy1;
   116       val Thy {axioms = _, defs = defs2, oracles = oracles2} = thy2;
   117 
   118       val axioms = NameSpace.empty_table;
   119       val defs = Defs.merge pp (defs1, defs2);
   120       val oracles = NameSpace.merge_tables (eq_snd (op =)) (oracles1, oracles2)
   121         handle Symtab.DUPS dups => err_dup_oras dups;
   122     in make_thy (axioms, defs, oracles) end;
   123 
   124   fun print _ _ = ();
   125 end);
   126 
   127 val init_data = ThyData.init;
   128 
   129 fun rep_theory thy = ThyData.get thy |> (fn Thy args => args);
   130 
   131 fun map_thy f = ThyData.map (fn (Thy {axioms, defs, oracles}) =>
   132   make_thy (f (axioms, defs, oracles)));
   133 
   134 fun map_axioms f = map_thy (fn (axioms, defs, oracles) => (f axioms, defs, oracles));
   135 fun map_defs f = map_thy (fn (axioms, defs, oracles) => (axioms, f defs, oracles));
   136 fun map_oracles f = map_thy (fn (axioms, defs, oracles) => (axioms, defs, f oracles));
   137 
   138 
   139 (* basic operations *)
   140 
   141 val axiom_space = #1 o #axioms o rep_theory;
   142 val axiom_table = #2 o #axioms o rep_theory;
   143 
   144 val oracle_space = #1 o #oracles o rep_theory;
   145 val oracle_table = #2 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_axm thy (name, str) =
   180   cert_axm thy (name, Sign.read_prop thy str)
   181     handle ERROR msg => err_in_axm msg name;
   182 
   183 fun inferT_axm thy (name, pre_tm) =
   184   let
   185     val pp = Sign.pp thy;
   186     val (t, _) =
   187       Sign.infer_types pp thy (Sign.consts_of thy)
   188         (K NONE) (K NONE) Name.context true ([pre_tm], propT);
   189   in (name, Sign.no_vars pp t) end
   190   handle ERROR msg => err_in_axm msg name;
   191 
   192 
   193 (* add_axioms(_i) *)
   194 
   195 local
   196 
   197 fun gen_add_axioms prep_axm raw_axms thy = thy |> map_axioms (fn axioms =>
   198   let
   199     val axms = map (apsnd (Compress.term thy o Logic.varify) o prep_axm thy) raw_axms;
   200     val axioms' = NameSpace.extend_table (Sign.naming_of thy) (axioms, axms)
   201       handle Symtab.DUPS dups => err_dup_axms dups;
   202   in axioms' end);
   203 
   204 in
   205 
   206 val add_axioms = gen_add_axioms read_axm;
   207 val add_axioms_i = gen_add_axioms cert_axm;
   208 
   209 end;
   210 
   211 
   212 
   213 (** add constant definitions **)
   214 
   215 (* dependencies *)
   216 
   217 fun dependencies thy unchecked is_def name lhs rhs =
   218   let
   219     val pp = Sign.pp thy;
   220     val consts = Sign.consts_of thy;
   221     fun prep const =
   222       let val Const (c, T) = Sign.no_vars pp (Const const)
   223       in (c, Consts.typargs consts (c, Compress.typ thy (Logic.varifyT T))) end;
   224 
   225     val lhs_vars = Term.add_tfreesT (#2 lhs) [];
   226     val rhs_extras = fold (#2 #> Term.fold_atyps (fn TFree v =>
   227       if member (op =) lhs_vars v then I else insert (op =) v | _ => I)) rhs [];
   228     val _ =
   229       if null rhs_extras then ()
   230       else error ("Specification depends on extra type variables: " ^
   231         commas_quote (map (Pretty.string_of_typ pp o TFree) rhs_extras) ^
   232         "\nThe error(s) above occurred in " ^ quote name);
   233   in Defs.define pp unchecked is_def (Context.theory_name thy) name (prep lhs) (map prep rhs) end;
   234 
   235 fun add_deps a raw_lhs raw_rhs thy =
   236   let
   237     val lhs :: rhs = map (dest_Const o Sign.cert_term thy o Const) (raw_lhs :: raw_rhs);
   238     val name = if a = "" then (#1 lhs ^ " axiom") else a;
   239   in thy |> map_defs (dependencies thy false false name lhs rhs) end;
   240 
   241 
   242 (* check_overloading *)
   243 
   244 fun check_overloading thy overloaded (c, T) =
   245   let
   246     val declT =
   247       (case Sign.const_constraint thy c of
   248         NONE => error ("Undeclared constant " ^ quote c)
   249       | SOME declT => declT);
   250     val T' = Logic.varifyT T;
   251 
   252     fun message txt =
   253       [Pretty.block [Pretty.str "Specification of constant ",
   254         Pretty.str c, Pretty.str " ::", Pretty.brk 1, Pretty.quote (Sign.pretty_typ thy T)],
   255         Pretty.str txt] |> Pretty.chunks |> Pretty.string_of;
   256   in
   257     if Sign.typ_instance thy (declT, T') then ()
   258     else if Type.raw_instance (declT, T') then
   259       error (Library.setmp show_sorts true
   260         message "imposes additional sort constraints on the constant declaration")
   261     else if overloaded then ()
   262     else warning (message "is strictly less general than the declared type");
   263     (c, T)
   264   end;
   265 
   266 
   267 (* check_def *)
   268 
   269 fun check_def thy unchecked overloaded (bname, tm) defs =
   270   let
   271     val name = Sign.full_name thy bname;
   272     val (lhs_const, rhs) = Sign.cert_def (Sign.pp thy) tm;
   273     val rhs_consts = fold_aterms (fn Const const => insert (op =) const | _ => I) rhs [];
   274     val _ = check_overloading thy overloaded lhs_const;
   275   in defs |> dependencies thy unchecked true name lhs_const rhs_consts end
   276   handle ERROR msg => cat_error msg (Pretty.string_of (Pretty.block
   277    [Pretty.str ("The error(s) above occurred in definition " ^ quote bname ^ ":"),
   278     Pretty.fbrk, Pretty.quote (Sign.pretty_term thy tm)]));
   279 
   280 
   281 (* add_defs(_i) *)
   282 
   283 local
   284 
   285 fun gen_add_defs prep_axm unchecked overloaded raw_axms thy =
   286   let val axms = map (prep_axm thy) raw_axms in
   287     thy
   288     |> map_defs (fold (check_def thy unchecked overloaded) axms)
   289     |> add_axioms_i axms
   290   end;
   291 
   292 in
   293 
   294 val add_defs_i = gen_add_defs cert_axm;
   295 val add_defs = gen_add_defs read_axm;
   296 
   297 end;
   298 
   299 
   300 (* add_finals(_i) *)
   301 
   302 local
   303 
   304 fun gen_add_finals prep_term overloaded args thy =
   305   let
   306     fun const_of (Const const) = const
   307       | const_of (Free _) = error "Attempt to finalize variable (or undeclared constant)"
   308       | const_of _ = error "Attempt to finalize non-constant term";
   309     fun specify (c, T) = dependencies thy false false (c ^ " axiom") (c, T) [];
   310     val finalize = specify o check_overloading thy overloaded o const_of o prep_term thy;
   311   in thy |> map_defs (fold finalize args) end;
   312 
   313 in
   314 
   315 val add_finals = gen_add_finals Sign.read_term;
   316 val add_finals_i = gen_add_finals Sign.cert_term;
   317 
   318 end;
   319 
   320 
   321 
   322 (** add oracle **)
   323 
   324 fun add_oracle (bname, oracle) thy = thy |> map_oracles (fn oracles =>
   325   NameSpace.extend_table (Sign.naming_of thy) (oracles, [(bname, (oracle, stamp ()))])
   326     handle Symtab.DUPS dups => err_dup_oras dups);
   327 
   328 end;
   329 
   330 structure BasicTheory: BASIC_THEORY = Theory;
   331 open BasicTheory;