src/Pure/theory.ML
author paulson
Fri Sep 06 11:56:12 1996 +0200 (1996-09-06)
changeset 1960 ae390b599213
parent 1539 f21c8fab7c3c
child 2206 a9419797e196
permissions -rw-r--r--
Improved error handling: if there are syntax or type-checking
errors, prints the name of the offending axiom
paulson@1526
     1
(*  Title:      Pure/theory.ML
paulson@1526
     2
    ID:         $Id$
paulson@1526
     3
    Author:     Lawrence C Paulson and Markus Wenzel
paulson@1526
     4
    Copyright   1996  University of Cambridge
paulson@1526
     5
paulson@1526
     6
Theories
paulson@1526
     7
*)
paulson@1526
     8
paulson@1526
     9
signature THEORY =
paulson@1526
    10
  sig
paulson@1526
    11
  type theory
paulson@1526
    12
  exception THEORY of string * theory list
paulson@1526
    13
  val rep_theory        : theory ->
paulson@1539
    14
    {sign: Sign.sg, oraopt: (Sign.sg * exn -> term) option,
paulson@1539
    15
     new_axioms: term Symtab.table, parents: theory list}
paulson@1526
    16
  val sign_of           : theory -> Sign.sg
paulson@1526
    17
  val syn_of            : theory -> Syntax.syntax
paulson@1526
    18
  val stamps_of_thy     : theory -> string ref list
paulson@1526
    19
  val parents_of        : theory -> theory list
paulson@1526
    20
  val subthy            : theory * theory -> bool
paulson@1526
    21
  val eq_thy            : theory * theory -> bool
paulson@1526
    22
  val proto_pure_thy    : theory
paulson@1526
    23
  val pure_thy          : theory
paulson@1526
    24
  val cpure_thy         : theory
paulson@1526
    25
  (*theory primitives*)
paulson@1539
    26
  val add_classes	: (class * class list) list -> theory -> theory
paulson@1539
    27
  val add_classrel	: (class * class) list -> theory -> theory
paulson@1539
    28
  val add_defsort	: sort -> theory -> theory
paulson@1539
    29
  val add_types		: (string * int * mixfix) list -> theory -> theory
paulson@1539
    30
  val add_tyabbrs	: (string * string list * string * mixfix) list
paulson@1526
    31
    -> theory -> theory
paulson@1539
    32
  val add_tyabbrs_i	: (string * string list * typ * mixfix) list
paulson@1526
    33
    -> theory -> theory
paulson@1539
    34
  val add_arities	: (string * sort list * sort) list -> theory -> theory
paulson@1539
    35
  val add_consts	: (string * string * mixfix) list -> theory -> theory
paulson@1539
    36
  val add_consts_i	: (string * typ * mixfix) list -> theory -> theory
paulson@1539
    37
  val add_syntax	: (string * string * mixfix) list -> theory -> theory
paulson@1539
    38
  val add_syntax_i	: (string * typ * mixfix) list -> theory -> theory
paulson@1539
    39
  val add_trfuns	:
paulson@1526
    40
    (string * (Syntax.ast list -> Syntax.ast)) list *
paulson@1526
    41
    (string * (term list -> term)) list *
paulson@1526
    42
    (string * (term list -> term)) list *
paulson@1526
    43
    (string * (Syntax.ast list -> Syntax.ast)) list -> theory -> theory
paulson@1526
    44
  val add_trrules     : (string * string)Syntax.trrule list -> theory -> theory
paulson@1539
    45
  val add_trrules_i	: Syntax.ast Syntax.trrule list -> theory -> theory
paulson@1526
    46
  val cert_axm          : Sign.sg -> string * term -> string * term
paulson@1526
    47
  val read_axm          : Sign.sg -> string * string -> string * term
paulson@1526
    48
  val inferT_axm        : Sign.sg -> string * term -> string * term
paulson@1539
    49
  val add_axioms	: (string * string) list -> theory -> theory
paulson@1539
    50
  val add_axioms_i	: (string * term) list -> theory -> theory
paulson@1539
    51
  val add_thyname	: string -> theory -> theory
paulson@1539
    52
paulson@1539
    53
  val set_oracle	: (Sign.sg * exn -> term) -> theory -> theory
paulson@1526
    54
paulson@1526
    55
  val merge_theories    : theory * theory -> theory
paulson@1526
    56
  val merge_thy_list    : bool -> theory list -> theory
paulson@1526
    57
end;
paulson@1526
    58
paulson@1526
    59
paulson@1526
    60
structure Theory : THEORY =
paulson@1526
    61
struct
paulson@1526
    62
(*** Theories ***)
paulson@1526
    63
paulson@1526
    64
datatype theory =
paulson@1526
    65
  Theory of {
paulson@1526
    66
    sign: Sign.sg,
paulson@1539
    67
    oraopt: (Sign.sg * exn -> term) option,
paulson@1526
    68
    new_axioms: term Symtab.table,
paulson@1526
    69
    parents: theory list};
paulson@1526
    70
paulson@1526
    71
fun rep_theory (Theory args) = args;
paulson@1526
    72
paulson@1526
    73
(*errors involving theories*)
paulson@1526
    74
exception THEORY of string * theory list;
paulson@1526
    75
paulson@1526
    76
paulson@1526
    77
val sign_of = #sign o rep_theory;
paulson@1526
    78
val syn_of = #syn o Sign.rep_sg o sign_of;
paulson@1526
    79
paulson@1526
    80
(*stamps associated with a theory*)
paulson@1526
    81
val stamps_of_thy = #stamps o Sign.rep_sg o sign_of;
paulson@1526
    82
paulson@1526
    83
(*return the immediate ancestors*)
paulson@1526
    84
val parents_of = #parents o rep_theory;
paulson@1526
    85
paulson@1526
    86
paulson@1526
    87
(*compare theories*)
paulson@1526
    88
val subthy = Sign.subsig o pairself sign_of;
paulson@1526
    89
val eq_thy = Sign.eq_sg o pairself sign_of;
paulson@1526
    90
paulson@1526
    91
paulson@1526
    92
(* the Pure theories *)
paulson@1526
    93
paulson@1526
    94
val proto_pure_thy =
paulson@1539
    95
  Theory {sign = Sign.proto_pure, oraopt = None, 
paulson@1539
    96
	  new_axioms = Symtab.null, parents = []};
paulson@1526
    97
paulson@1526
    98
val pure_thy =
paulson@1539
    99
  Theory {sign = Sign.pure, oraopt = None, 
paulson@1539
   100
	  new_axioms = Symtab.null, parents = []};
paulson@1526
   101
paulson@1526
   102
val cpure_thy =
paulson@1539
   103
  Theory {sign = Sign.cpure, oraopt = None, 
paulson@1539
   104
	  new_axioms = Symtab.null, parents = []};
paulson@1526
   105
paulson@1526
   106
paulson@1526
   107
paulson@1526
   108
(** extend theory **)
paulson@1526
   109
paulson@1526
   110
fun err_dup_axms names =
paulson@1526
   111
  error ("Duplicate axiom name(s) " ^ commas_quote names);
paulson@1526
   112
paulson@1539
   113
fun ext_thy (thy as Theory {sign, oraopt, new_axioms, parents}) 
paulson@1539
   114
            sign1 new_axms =
paulson@1526
   115
  let
paulson@1526
   116
    val draft = Sign.is_draft sign;
paulson@1526
   117
    val new_axioms1 =
paulson@1526
   118
      Symtab.extend_new (if draft then new_axioms else Symtab.null, new_axms)
paulson@1526
   119
        handle Symtab.DUPS names => err_dup_axms names;
paulson@1526
   120
    val parents1 = if draft then parents else [thy];
paulson@1526
   121
  in
paulson@1539
   122
    Theory {sign = sign1, oraopt = oraopt, 
paulson@1539
   123
	    new_axioms = new_axioms1, parents = parents1}
paulson@1526
   124
  end;
paulson@1526
   125
paulson@1526
   126
paulson@1526
   127
(* extend signature of a theory *)
paulson@1526
   128
paulson@1526
   129
fun ext_sg extfun decls (thy as Theory {sign, ...}) =
paulson@1526
   130
  ext_thy thy (extfun decls sign) [];
paulson@1526
   131
paulson@1526
   132
val add_classes   = ext_sg Sign.add_classes;
paulson@1526
   133
val add_classrel  = ext_sg Sign.add_classrel;
paulson@1526
   134
val add_defsort   = ext_sg Sign.add_defsort;
paulson@1526
   135
val add_types     = ext_sg Sign.add_types;
paulson@1526
   136
val add_tyabbrs   = ext_sg Sign.add_tyabbrs;
paulson@1526
   137
val add_tyabbrs_i = ext_sg Sign.add_tyabbrs_i;
paulson@1526
   138
val add_arities   = ext_sg Sign.add_arities;
paulson@1526
   139
val add_consts    = ext_sg Sign.add_consts;
paulson@1526
   140
val add_consts_i  = ext_sg Sign.add_consts_i;
paulson@1526
   141
val add_syntax    = ext_sg Sign.add_syntax;
paulson@1526
   142
val add_syntax_i  = ext_sg Sign.add_syntax_i;
paulson@1526
   143
val add_trfuns    = ext_sg Sign.add_trfuns;
paulson@1526
   144
val add_trrules   = ext_sg Sign.add_trrules;
paulson@1526
   145
val add_trrules_i = ext_sg Sign.add_trrules_i;
paulson@1526
   146
val add_thyname   = ext_sg Sign.add_name;
paulson@1526
   147
paulson@1526
   148
paulson@1526
   149
(* prepare axioms *)
paulson@1526
   150
paulson@1526
   151
fun err_in_axm name =
paulson@1526
   152
  error ("The error(s) above occurred in axiom " ^ quote name);
paulson@1526
   153
paulson@1526
   154
fun no_vars tm =
paulson@1526
   155
  if null (term_vars tm) andalso null (term_tvars tm) then tm
paulson@1526
   156
  else error "Illegal schematic variable(s) in term";
paulson@1526
   157
paulson@1526
   158
fun cert_axm sg (name, raw_tm) =
paulson@1526
   159
  let
paulson@1526
   160
    val (t, T, _) = Sign.certify_term sg raw_tm
paulson@1526
   161
      handle TYPE arg => error (Sign.exn_type_msg sg arg)
paulson@1526
   162
	   | TERM (msg, _) => error msg;
paulson@1526
   163
  in
paulson@1526
   164
    assert (T = propT) "Term not of type prop";
paulson@1526
   165
    (name, no_vars t)
paulson@1526
   166
  end
paulson@1526
   167
  handle ERROR => err_in_axm name;
paulson@1526
   168
paulson@1526
   169
(*Some duplication of code with read_def_cterm*)
paulson@1526
   170
fun read_axm sg (name, str) = 
paulson@1526
   171
  let val ts = Syntax.read (#syn (Sign.rep_sg sg)) propT str;
paulson@1526
   172
      val (_, t, _) =
paulson@1526
   173
          Sign.infer_types sg (K None) (K None) [] true (ts,propT);
paulson@1960
   174
  in cert_axm sg (name,t) end
paulson@1960
   175
  handle ERROR => err_in_axm name;
paulson@1526
   176
paulson@1526
   177
fun inferT_axm sg (name, pre_tm) =
paulson@1526
   178
  let val t = #2(Sign.infer_types sg (K None) (K None) [] true
paulson@1526
   179
                                     ([pre_tm], propT))
paulson@1526
   180
  in  (name, no_vars t) end
paulson@1526
   181
  handle ERROR => err_in_axm name;
paulson@1526
   182
paulson@1526
   183
paulson@1526
   184
(* extend axioms of a theory *)
paulson@1526
   185
paulson@1526
   186
fun ext_axms prep_axm axms (thy as Theory {sign, ...}) =
paulson@1526
   187
  let
paulson@1526
   188
    val sign1 = Sign.make_draft sign;
paulson@1526
   189
    val axioms = map (apsnd (Term.compress_term o Logic.varify) o 
paulson@1526
   190
		      prep_axm sign) 
paulson@1526
   191
	         axms;
paulson@1526
   192
  in
paulson@1526
   193
    ext_thy thy sign1 axioms
paulson@1526
   194
  end;
paulson@1526
   195
paulson@1526
   196
val add_axioms = ext_axms read_axm;
paulson@1526
   197
val add_axioms_i = ext_axms cert_axm;
paulson@1526
   198
paulson@1526
   199
paulson@1539
   200
(** Set oracle of theory **)
paulson@1539
   201
paulson@1539
   202
fun set_oracle oracle 
paulson@1539
   203
               (thy as Theory {sign, oraopt = None, new_axioms, parents}) =
paulson@1539
   204
      if Sign.is_draft sign then
paulson@1539
   205
	Theory {sign = sign, 
paulson@1539
   206
		oraopt = Some oracle, 
paulson@1539
   207
		new_axioms = new_axioms, 
paulson@1539
   208
		parents = parents}
paulson@1539
   209
      else raise THEORY ("Can only set oracle of a draft", [thy])
paulson@1539
   210
  | set_oracle _ thy = raise THEORY ("Oracle already set", [thy]);
paulson@1539
   211
paulson@1526
   212
paulson@1526
   213
(** merge theories **)
paulson@1526
   214
paulson@1526
   215
fun merge_thy_list mk_draft thys =
paulson@1526
   216
  let
paulson@1526
   217
    fun is_union thy = forall (fn t => subthy (t, thy)) thys;
paulson@1526
   218
    val is_draft = Sign.is_draft o sign_of;
paulson@1526
   219
paulson@1526
   220
    fun add_sign (sg, Theory {sign, ...}) =
paulson@1526
   221
      Sign.merge (sg, sign) handle TERM (msg, _) => error msg;
paulson@1526
   222
  in
paulson@1539
   223
    case (find_first is_union thys, exists is_draft thys) of
paulson@1526
   224
      (Some thy, _) => thy
paulson@1526
   225
    | (None, true) => raise THEORY ("Illegal merge of draft theories", thys)
paulson@1526
   226
    | (None, false) => Theory {
paulson@1526
   227
        sign =
paulson@1526
   228
          (if mk_draft then Sign.make_draft else I)
paulson@1526
   229
          (foldl add_sign (Sign.proto_pure, thys)),
paulson@1539
   230
	oraopt = None,
paulson@1526
   231
        new_axioms = Symtab.null,
paulson@1539
   232
        parents = thys}
paulson@1526
   233
  end;
paulson@1526
   234
paulson@1526
   235
fun merge_theories (thy1, thy2) = merge_thy_list false [thy1, thy2];
paulson@1526
   236
paulson@1526
   237
paulson@1526
   238
end;
paulson@1526
   239
paulson@1526
   240
open Theory;