src/HOL/Tools/refute.ML
author webertj
Mon Aug 09 15:27:27 2004 +0200 (2004-08-09)
changeset 15125 5224130bc0d6
parent 14984 edbc81e60809
child 15280 e0e9bf44afad
permissions -rw-r--r--
warning for recursion over IDTs added
webertj@14350
     1
(*  Title:      HOL/Tools/refute.ML
webertj@14350
     2
    ID:         $Id$
webertj@14350
     3
    Author:     Tjark Weber
webertj@14350
     4
    Copyright   2003-2004
webertj@14350
     5
webertj@14965
     6
Finite model generation for HOL formulas, using a SAT solver.
webertj@14350
     7
*)
webertj@14350
     8
webertj@14965
     9
(* TODO: case, recursion, size for IDTs are not supported yet *)
webertj@14456
    10
webertj@14456
    11
(* ------------------------------------------------------------------------- *)
webertj@14456
    12
(* Declares the 'REFUTE' signature as well as a structure 'Refute'.          *)
webertj@14456
    13
(* Documentation is available in the Isabelle/Isar theory 'HOL/Refute.thy'.  *)
webertj@14350
    14
(* ------------------------------------------------------------------------- *)
webertj@14350
    15
webertj@14350
    16
signature REFUTE =
webertj@14350
    17
sig
webertj@14350
    18
webertj@14456
    19
	exception REFUTE of string * string
webertj@14456
    20
webertj@14456
    21
(* ------------------------------------------------------------------------- *)
webertj@14807
    22
(* Model/interpretation related code (translation HOL -> propositional logic *)
webertj@14456
    23
(* ------------------------------------------------------------------------- *)
webertj@14456
    24
webertj@14807
    25
	type params
webertj@14456
    26
	type interpretation
webertj@14456
    27
	type model
webertj@14456
    28
	type arguments
webertj@14456
    29
webertj@14807
    30
	exception CANNOT_INTERPRET of Term.term
webertj@14807
    31
	exception MAXVARS_EXCEEDED
webertj@14456
    32
webertj@14807
    33
	val add_interpreter : string -> (theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) option) -> theory -> theory
webertj@14807
    34
	val add_printer     : string -> (theory -> model -> Term.term -> interpretation -> (int -> bool) -> Term.term option) -> theory -> theory
webertj@14456
    35
webertj@14807
    36
	val interpret : theory -> model -> arguments -> Term.term -> (interpretation * model * arguments)  (* exception CANNOT_INTERPRET *)
webertj@14807
    37
webertj@14807
    38
	val print       : theory -> model -> Term.term -> interpretation -> (int -> bool) -> Term.term
webertj@14456
    39
	val print_model : theory -> model -> (int -> bool) -> string
webertj@14456
    40
webertj@14456
    41
(* ------------------------------------------------------------------------- *)
webertj@14456
    42
(* Interface                                                                 *)
webertj@14456
    43
(* ------------------------------------------------------------------------- *)
webertj@14456
    44
webertj@14456
    45
	val set_default_param  : (string * string) -> theory -> theory
webertj@14456
    46
	val get_default_param  : theory -> string -> string option
webertj@14456
    47
	val get_default_params : theory -> (string * string) list
webertj@14807
    48
	val actual_params      : theory -> (string * string) list -> params
webertj@14456
    49
webertj@14807
    50
	val find_model : theory -> params -> Term.term -> bool -> unit
webertj@14456
    51
webertj@14456
    52
	val satisfy_term   : theory -> (string * string) list -> Term.term -> unit  (* tries to find a model for a formula *)
webertj@14456
    53
	val refute_term    : theory -> (string * string) list -> Term.term -> unit  (* tries to find a model that refutes a formula *)
webertj@14456
    54
	val refute_subgoal : theory -> (string * string) list -> Thm.thm -> int -> unit
webertj@14456
    55
webertj@14456
    56
	val setup : (theory -> theory) list
webertj@14456
    57
end;
webertj@14456
    58
webertj@14456
    59
structure Refute : REFUTE =
webertj@14456
    60
struct
webertj@14456
    61
webertj@14456
    62
	open PropLogic;
webertj@14456
    63
webertj@14350
    64
	(* We use 'REFUTE' only for internal error conditions that should    *)
webertj@14350
    65
	(* never occur in the first place (i.e. errors caused by bugs in our *)
webertj@14350
    66
	(* code).  Otherwise (e.g. to indicate invalid input data) we use    *)
webertj@14350
    67
	(* 'error'.                                                          *)
webertj@14456
    68
	exception REFUTE of string * string;  (* ("in function", "cause") *)
webertj@14350
    69
webertj@14807
    70
	exception CANNOT_INTERPRET of Term.term;
webertj@14350
    71
webertj@14807
    72
	(* should be raised by an interpreter when more variables would be *)
webertj@14807
    73
	(* required than allowed by 'maxvars'                              *)
webertj@14807
    74
	exception MAXVARS_EXCEEDED;
webertj@14350
    75
webertj@14350
    76
(* ------------------------------------------------------------------------- *)
webertj@14350
    77
(* TREES                                                                     *)
webertj@14350
    78
(* ------------------------------------------------------------------------- *)
webertj@14350
    79
webertj@14350
    80
(* ------------------------------------------------------------------------- *)
webertj@14350
    81
(* tree: implements an arbitrarily (but finitely) branching tree as a list   *)
webertj@14350
    82
(*       of (lists of ...) elements                                          *)
webertj@14350
    83
(* ------------------------------------------------------------------------- *)
webertj@14350
    84
webertj@14350
    85
	datatype 'a tree =
webertj@14350
    86
		  Leaf of 'a
webertj@14350
    87
		| Node of ('a tree) list;
webertj@14350
    88
webertj@14350
    89
	(* ('a -> 'b) -> 'a tree -> 'b tree *)
webertj@14350
    90
webertj@14350
    91
	fun tree_map f tr =
webertj@14350
    92
		case tr of
webertj@14350
    93
		  Leaf x  => Leaf (f x)
webertj@14350
    94
		| Node xs => Node (map (tree_map f) xs);
webertj@14350
    95
webertj@14350
    96
	(* ('a * 'b -> 'a) -> 'a * ('b tree) -> 'a *)
webertj@14350
    97
webertj@14350
    98
	fun tree_foldl f =
webertj@14350
    99
	let
webertj@14350
   100
		fun itl (e, Leaf x)  = f(e,x)
webertj@14350
   101
		  | itl (e, Node xs) = foldl (tree_foldl f) (e,xs)
webertj@14350
   102
	in
webertj@14350
   103
		itl
webertj@14350
   104
	end;
webertj@14350
   105
webertj@14350
   106
	(* 'a tree * 'b tree -> ('a * 'b) tree *)
webertj@14350
   107
webertj@14350
   108
	fun tree_pair (t1,t2) =
webertj@14350
   109
		case t1 of
webertj@14350
   110
		  Leaf x =>
webertj@14350
   111
			(case t2 of
webertj@14350
   112
				  Leaf y => Leaf (x,y)
webertj@14350
   113
				| Node _ => raise REFUTE ("tree_pair", "trees are of different height (second tree is higher)"))
webertj@14350
   114
		| Node xs =>
webertj@14350
   115
			(case t2 of
webertj@14807
   116
				  (* '~~' will raise an exception if the number of branches in   *)
webertj@14807
   117
				  (* both trees is different at the current node                 *)
webertj@14350
   118
				  Node ys => Node (map tree_pair (xs ~~ ys))
webertj@14350
   119
				| Leaf _  => raise REFUTE ("tree_pair", "trees are of different height (first tree is higher)"));
webertj@14350
   120
webertj@14456
   121
webertj@14350
   122
(* ------------------------------------------------------------------------- *)
webertj@14807
   123
(* params: parameters that control the translation into a propositional      *)
webertj@14807
   124
(*         formula/model generation                                          *)
webertj@14807
   125
(*                                                                           *)
webertj@14807
   126
(* The following parameters are supported (and required (!), except for      *)
webertj@14807
   127
(* "sizes"):                                                                 *)
webertj@14807
   128
(*                                                                           *)
webertj@14807
   129
(* Name          Type    Description                                         *)
webertj@14807
   130
(*                                                                           *)
webertj@14807
   131
(* "sizes"       (string * int) list                                         *)
webertj@14807
   132
(*                       Size of ground types (e.g. 'a=2), or depth of IDTs. *)
webertj@14807
   133
(* "minsize"     int     If >0, minimal size of each ground type/IDT depth.  *)
webertj@14807
   134
(* "maxsize"     int     If >0, maximal size of each ground type/IDT depth.  *)
webertj@14807
   135
(* "maxvars"     int     If >0, use at most 'maxvars' Boolean variables      *)
webertj@14807
   136
(*                       when transforming the term into a propositional     *)
webertj@14807
   137
(*                       formula.                                            *)
webertj@14807
   138
(* "maxtime"     int     If >0, terminate after at most 'maxtime' seconds.   *)
webertj@14807
   139
(* "satsolver"   string  SAT solver to be used.                              *)
webertj@14807
   140
(* ------------------------------------------------------------------------- *)
webertj@14807
   141
webertj@14807
   142
	type params =
webertj@14807
   143
		{
webertj@14807
   144
			sizes    : (string * int) list,
webertj@14807
   145
			minsize  : int,
webertj@14807
   146
			maxsize  : int,
webertj@14807
   147
			maxvars  : int,
webertj@14807
   148
			maxtime  : int,
webertj@14807
   149
			satsolver: string
webertj@14807
   150
		};
webertj@14807
   151
webertj@14807
   152
(* ------------------------------------------------------------------------- *)
webertj@14456
   153
(* interpretation: a term's interpretation is given by a variable of type    *)
webertj@14456
   154
(*                 'interpretation'                                          *)
webertj@14350
   155
(* ------------------------------------------------------------------------- *)
webertj@14350
   156
webertj@14456
   157
	type interpretation =
webertj@14456
   158
		prop_formula list tree;
webertj@14350
   159
webertj@14350
   160
(* ------------------------------------------------------------------------- *)
webertj@14456
   161
(* model: a model specifies the size of types and the interpretation of      *)
webertj@14456
   162
(*        terms                                                              *)
webertj@14350
   163
(* ------------------------------------------------------------------------- *)
webertj@14350
   164
webertj@14456
   165
	type model =
webertj@14456
   166
		(Term.typ * int) list * (Term.term * interpretation) list;
webertj@14350
   167
webertj@14456
   168
(* ------------------------------------------------------------------------- *)
webertj@14456
   169
(* arguments: additional arguments required during interpretation of terms   *)
webertj@14456
   170
(* ------------------------------------------------------------------------- *)
webertj@14807
   171
webertj@14456
   172
	type arguments =
webertj@14807
   173
		{
webertj@14807
   174
			(* just passed unchanged from 'params' *)
webertj@14807
   175
			maxvars   : int,
webertj@14807
   176
			(* these may change during the translation *)
webertj@14807
   177
			next_idx  : int,
webertj@14807
   178
			bounds    : interpretation list,
webertj@14807
   179
			wellformed: prop_formula
webertj@14807
   180
		};
webertj@14456
   181
webertj@14350
   182
webertj@14456
   183
	structure RefuteDataArgs =
webertj@14456
   184
	struct
webertj@14456
   185
		val name = "HOL/refute";
webertj@14456
   186
		type T =
webertj@14456
   187
			{interpreters: (string * (theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) option)) list,
webertj@14807
   188
			 printers: (string * (theory -> model -> Term.term -> interpretation -> (int -> bool) -> Term.term option)) list,
webertj@14456
   189
			 parameters: string Symtab.table};
webertj@14456
   190
		val empty = {interpreters = [], printers = [], parameters = Symtab.empty};
webertj@14456
   191
		val copy = I;
webertj@14456
   192
		val prep_ext = I;
webertj@14456
   193
		fun merge
webertj@14456
   194
			({interpreters = in1, printers = pr1, parameters = pa1},
webertj@14456
   195
			 {interpreters = in2, printers = pr2, parameters = pa2}) =
webertj@14456
   196
			{interpreters = rev (merge_alists (rev in1) (rev in2)),
webertj@14456
   197
			 printers = rev (merge_alists (rev pr1) (rev pr2)),
webertj@14456
   198
			 parameters = Symtab.merge (op=) (pa1, pa2)};
webertj@14456
   199
		fun print sg {interpreters, printers, parameters} =
webertj@14456
   200
			Pretty.writeln (Pretty.chunks
webertj@14456
   201
				[Pretty.strs ("default parameters:" :: flat (map (fn (name,value) => [name, "=", value]) (Symtab.dest parameters))),
webertj@14456
   202
				 Pretty.strs ("interpreters:" :: map fst interpreters),
webertj@14456
   203
				 Pretty.strs ("printers:" :: map fst printers)]);
webertj@14456
   204
	end;
webertj@14456
   205
webertj@14456
   206
	structure RefuteData = TheoryDataFun(RefuteDataArgs);
webertj@14456
   207
webertj@14350
   208
webertj@14350
   209
(* ------------------------------------------------------------------------- *)
webertj@14456
   210
(* interpret: tries to interpret the term 't' using a suitable interpreter;  *)
webertj@14456
   211
(*            returns the interpretation and a (possibly extended) model     *)
webertj@14456
   212
(*            that keeps track of the interpretation of subterms             *)
webertj@14807
   213
(* Note: exception 'CANNOT_INTERPRET t' is raised if the term cannot be      *)
webertj@14456
   214
(*       interpreted by any interpreter                                      *)
webertj@14350
   215
(* ------------------------------------------------------------------------- *)
webertj@14350
   216
webertj@14807
   217
	(* theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) *)
webertj@14456
   218
webertj@14456
   219
	fun interpret thy model args t =
webertj@14456
   220
		(case get_first (fn (_, f) => f thy model args t) (#interpreters (RefuteData.get thy)) of
webertj@14807
   221
		  None   => raise (CANNOT_INTERPRET t)
webertj@14456
   222
		| Some x => x);
webertj@14456
   223
webertj@14456
   224
(* ------------------------------------------------------------------------- *)
webertj@14807
   225
(* print: tries to convert the constant denoted by the term 't' into a term  *)
webertj@14807
   226
(*        using a suitable printer                                           *)
webertj@14456
   227
(* ------------------------------------------------------------------------- *)
webertj@14350
   228
webertj@14807
   229
	(* theory -> model -> Term.term -> interpretation -> (int -> bool) -> Term.term *)
webertj@14456
   230
webertj@14456
   231
	fun print thy model t intr assignment =
webertj@14456
   232
		(case get_first (fn (_, f) => f thy model t intr assignment) (#printers (RefuteData.get thy)) of
webertj@14807
   233
		  None   => Const ("<<no printer available>>", fastype_of t)
webertj@14807
   234
		| Some x => x);
webertj@14456
   235
webertj@14456
   236
(* ------------------------------------------------------------------------- *)
webertj@14456
   237
(* print_model: turns the model into a string, using a fixed interpretation  *)
webertj@14807
   238
(*              (given by an assignment for Boolean variables) and suitable  *)
webertj@14456
   239
(*              printers                                                     *)
webertj@14456
   240
(* ------------------------------------------------------------------------- *)
webertj@14456
   241
webertj@14807
   242
	(* theory -> model -> (int -> bool) -> string *)
webertj@14807
   243
webertj@14456
   244
	fun print_model thy model assignment =
webertj@14456
   245
	let
webertj@14456
   246
		val (typs, terms) = model
webertj@14807
   247
		val typs_msg =
webertj@14807
   248
			if null typs then
webertj@14807
   249
				"empty universe (no type variables in term)\n"
webertj@14807
   250
			else
webertj@14807
   251
				"Size of types: " ^ commas (map (fn (T,i) => Sign.string_of_typ (sign_of thy) T ^ ": " ^ string_of_int i) typs) ^ "\n"
webertj@14807
   252
		val show_consts_msg =
webertj@14807
   253
			if not (!show_consts) andalso Library.exists (is_Const o fst) terms then
webertj@14807
   254
				"set \"show_consts\" to show the interpretation of constants\n"
webertj@14807
   255
			else
webertj@14807
   256
				""
webertj@14807
   257
		val terms_msg =
webertj@14807
   258
			if null terms then
webertj@14807
   259
				"empty interpretation (no free variables in term)\n"
webertj@14807
   260
			else
webertj@14807
   261
				space_implode "\n" (mapfilter (fn (t,intr) =>
webertj@14807
   262
					(* print constants only if 'show_consts' is true *)
webertj@14807
   263
					if (!show_consts) orelse not (is_Const t) then
webertj@14807
   264
						Some (Sign.string_of_term (sign_of thy) t ^ ": " ^ Sign.string_of_term (sign_of thy) (print thy model t intr assignment))
webertj@14807
   265
					else
webertj@14807
   266
						None) terms) ^ "\n"
webertj@14456
   267
	in
webertj@14807
   268
		typs_msg ^ show_consts_msg ^ terms_msg
webertj@14456
   269
	end;
webertj@14456
   270
webertj@14456
   271
webertj@14456
   272
(* ------------------------------------------------------------------------- *)
webertj@14456
   273
(* PARAMETER MANAGEMENT                                                      *)
webertj@14456
   274
(* ------------------------------------------------------------------------- *)
webertj@14456
   275
webertj@14456
   276
	(* string -> (theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) option) -> theory -> theory *)
webertj@14456
   277
webertj@14456
   278
	fun add_interpreter name f thy =
webertj@14456
   279
	let
webertj@14456
   280
		val {interpreters, printers, parameters} = RefuteData.get thy
webertj@14456
   281
	in
webertj@14456
   282
		case assoc (interpreters, name) of
webertj@14456
   283
		  None   => RefuteData.put {interpreters = (name, f) :: interpreters, printers = printers, parameters = parameters} thy
webertj@14456
   284
		| Some _ => error ("Interpreter " ^ name ^ " already declared")
webertj@14456
   285
	end;
webertj@14456
   286
webertj@14807
   287
	(* string -> (theory -> model -> Term.term -> interpretation -> (int -> bool) -> Term.term option) -> theory -> theory *)
webertj@14456
   288
webertj@14456
   289
	fun add_printer name f thy =
webertj@14456
   290
	let
webertj@14456
   291
		val {interpreters, printers, parameters} = RefuteData.get thy
webertj@14456
   292
	in
webertj@14456
   293
		case assoc (printers, name) of
webertj@14456
   294
		  None   => RefuteData.put {interpreters = interpreters, printers = (name, f) :: printers, parameters = parameters} thy
webertj@14456
   295
		| Some _ => error ("Printer " ^ name ^ " already declared")
webertj@14456
   296
	end;
webertj@14456
   297
webertj@14456
   298
(* ------------------------------------------------------------------------- *)
webertj@14456
   299
(* set_default_param: stores the '(name, value)' pair in RefuteData's        *)
webertj@14456
   300
(*                    parameter table                                        *)
webertj@14456
   301
(* ------------------------------------------------------------------------- *)
webertj@14456
   302
webertj@14456
   303
	(* (string * string) -> theory -> theory *)
webertj@14456
   304
webertj@14456
   305
	fun set_default_param (name, value) thy =
webertj@14456
   306
	let
webertj@14456
   307
		val {interpreters, printers, parameters} = RefuteData.get thy
webertj@14456
   308
	in
webertj@14456
   309
		case Symtab.lookup (parameters, name) of
webertj@14456
   310
		  None   => RefuteData.put
webertj@14456
   311
			{interpreters = interpreters, printers = printers, parameters = Symtab.extend (parameters, [(name, value)])} thy
webertj@14456
   312
		| Some _ => RefuteData.put
webertj@14456
   313
			{interpreters = interpreters, printers = printers, parameters = Symtab.update ((name, value), parameters)} thy
webertj@14350
   314
	end;
webertj@14350
   315
webertj@14350
   316
(* ------------------------------------------------------------------------- *)
webertj@14456
   317
(* get_default_param: retrieves the value associated with 'name' from        *)
webertj@14456
   318
(*                    RefuteData's parameter table                           *)
webertj@14456
   319
(* ------------------------------------------------------------------------- *)
webertj@14456
   320
webertj@14456
   321
	(* theory -> string -> string option *)
webertj@14456
   322
webertj@14456
   323
	fun get_default_param thy name = Symtab.lookup ((#parameters o RefuteData.get) thy, name);
webertj@14456
   324
webertj@14456
   325
(* ------------------------------------------------------------------------- *)
webertj@14456
   326
(* get_default_params: returns a list of all '(name, value)' pairs that are  *)
webertj@14456
   327
(*                     stored in RefuteData's parameter table                *)
webertj@14456
   328
(* ------------------------------------------------------------------------- *)
webertj@14456
   329
webertj@14456
   330
	(* theory -> (string * string) list *)
webertj@14456
   331
webertj@14456
   332
	fun get_default_params thy = (Symtab.dest o #parameters o RefuteData.get) thy;
webertj@14456
   333
webertj@14456
   334
(* ------------------------------------------------------------------------- *)
webertj@14456
   335
(* actual_params: takes a (possibly empty) list 'params' of parameters that  *)
webertj@14456
   336
(*      override the default parameters currently specified in 'thy', and    *)
webertj@14807
   337
(*      returns a record that can be passed to 'find_model'.                 *)
webertj@14456
   338
(* ------------------------------------------------------------------------- *)
webertj@14456
   339
webertj@14807
   340
	(* theory -> (string * string) list -> params *)
webertj@14456
   341
webertj@14807
   342
	fun actual_params thy override =
webertj@14456
   343
	let
webertj@14456
   344
		(* (string * string) list * string -> int *)
webertj@14456
   345
		fun read_int (parms, name) =
webertj@14456
   346
			case assoc_string (parms, name) of
webertj@14456
   347
			  Some s => (case Int.fromString s of
webertj@14456
   348
				  SOME i => i
webertj@14456
   349
				| NONE   => error ("parameter " ^ quote name ^ " (value is " ^ quote s ^ ") must be an integer value"))
webertj@14456
   350
			| None   => error ("parameter " ^ quote name ^ " must be assigned a value")
webertj@14456
   351
		(* (string * string) list * string -> string *)
webertj@14456
   352
		fun read_string (parms, name) =
webertj@14456
   353
			case assoc_string (parms, name) of
webertj@14456
   354
			  Some s => s
webertj@14456
   355
			| None   => error ("parameter " ^ quote name ^ " must be assigned a value")
webertj@14456
   356
		(* (string * string) list *)
webertj@14807
   357
		val allparams = override @ (get_default_params thy)  (* 'override' first, defaults last *)
webertj@14456
   358
		(* int *)
webertj@14456
   359
		val minsize   = read_int (allparams, "minsize")
webertj@14456
   360
		val maxsize   = read_int (allparams, "maxsize")
webertj@14456
   361
		val maxvars   = read_int (allparams, "maxvars")
webertj@14807
   362
      val maxtime   = read_int (allparams, "maxtime")
webertj@14456
   363
		(* string *)
webertj@14456
   364
		val satsolver = read_string (allparams, "satsolver")
webertj@14807
   365
		(* all remaining parameters of the form "string=int" are collected in  *)
webertj@14807
   366
		(* 'sizes'                                                             *)
webertj@14807
   367
		(* TODO: it is currently not possible to specify a size for a type     *)
webertj@14807
   368
		(*       whose name is one of the other parameters (e.g. 'maxvars')    *)
webertj@14807
   369
		(* (string * int) list *)
webertj@14807
   370
		val sizes     = mapfilter
webertj@14807
   371
			(fn (name,value) => (case Int.fromString value of SOME i => Some (name, i) | NONE => None))
webertj@14807
   372
			(filter (fn (name,_) => name<>"minsize" andalso name<>"maxsize" andalso name<>"maxvars" andalso name<>"maxtime" andalso name<>"satsolver")
webertj@14807
   373
				allparams)
webertj@14456
   374
	in
webertj@14807
   375
		{sizes=sizes, minsize=minsize, maxsize=maxsize, maxvars=maxvars, maxtime=maxtime, satsolver=satsolver}
webertj@14807
   376
	end;
webertj@14807
   377
webertj@14807
   378
webertj@14807
   379
(* ------------------------------------------------------------------------- *)
webertj@14807
   380
(* TRANSLATION HOL -> PROPOSITIONAL LOGIC, BOOLEAN ASSIGNMENT -> MODEL       *)
webertj@14807
   381
(* ------------------------------------------------------------------------- *)
webertj@14807
   382
webertj@14807
   383
(* ------------------------------------------------------------------------- *)
webertj@14807
   384
(* collect_axioms: collects (monomorphic, universally quantified versions    *)
webertj@14807
   385
(*                 of) all HOL axioms that are relevant w.r.t 't'            *)
webertj@14807
   386
(* ------------------------------------------------------------------------- *)
webertj@14807
   387
webertj@14807
   388
	(* TODO: to make the collection of axioms more easily extensible, this    *)
webertj@14807
   389
	(*       function could be based on user-supplied "axiom collectors",     *)
webertj@14807
   390
	(*       similar to 'interpret'/interpreters or 'print'/printers          *)
webertj@14807
   391
webertj@14807
   392
	(* theory -> Term.term -> Term.term list *)
webertj@14807
   393
webertj@14807
   394
	(* Which axioms are "relevant" for a particular term/type goes hand in    *)
webertj@14807
   395
	(* hand with the interpretation of that term/type by its interpreter (see *)
webertj@14807
   396
	(* way below): if the interpretation respects an axiom anyway, the axiom  *)
webertj@14807
   397
	(* does not need to be added as a constraint here.                        *)
webertj@14807
   398
webertj@14807
   399
	(* When an axiom is added as relevant, further axioms may need to be      *)
webertj@14807
   400
	(* added as well (e.g. when a constant is defined in terms of other       *)
webertj@14807
   401
	(* constants).  To avoid infinite recursion (which should not happen for  *)
webertj@14807
   402
	(* constants anyway, but it could happen for "typedef"-related axioms,    *)
webertj@14807
   403
	(* since they contain the type again), we use an accumulator 'axs' and    *)
webertj@14807
   404
	(* add a relevant axiom only if it is not in 'axs' yet.                   *)
webertj@14807
   405
webertj@14807
   406
	fun collect_axioms thy t =
webertj@14807
   407
	let
wenzelm@14984
   408
		val _ = immediate_output "Adding axioms..."
webertj@14807
   409
		(* (string * Term.term) list *)
webertj@14807
   410
		val axioms = flat (map (Symtab.dest o #axioms o Theory.rep_theory) (thy :: Theory.ancestors_of thy))
webertj@14807
   411
		(* given a constant 's' of type 'T', which is a subterm of 't', where  *)
webertj@14807
   412
		(* 't' has a (possibly) more general type, the schematic type          *)
webertj@14807
   413
		(* variables in 't' are instantiated to match the type 'T'             *)
webertj@14807
   414
		(* (string * Term.typ) * Term.term -> Term.term *)
webertj@14807
   415
		fun specialize_type ((s, T), t) =
webertj@14807
   416
		let
webertj@14807
   417
			fun find_typeSubs (Const (s', T')) =
webertj@14807
   418
				(if s=s' then
webertj@14807
   419
					Some (Type.typ_match (Sign.tsig_of (sign_of thy)) (Vartab.empty, (T', T)))
webertj@14807
   420
				else
webertj@14807
   421
					None
webertj@14807
   422
				handle Type.TYPE_MATCH => None)
webertj@14807
   423
			  | find_typeSubs (Free _)           = None
webertj@14807
   424
			  | find_typeSubs (Var _)            = None
webertj@14807
   425
			  | find_typeSubs (Bound _)          = None
webertj@14807
   426
			  | find_typeSubs (Abs (_, _, body)) = find_typeSubs body
webertj@14807
   427
			  | find_typeSubs (t1 $ t2)          = (case find_typeSubs t1 of Some x => Some x | None => find_typeSubs t2)
webertj@14807
   428
			val typeSubs = (case find_typeSubs t of
webertj@14807
   429
				  Some x => x
webertj@14807
   430
				| None   => raise REFUTE ("collect_axioms", "no type instantiation found for " ^ quote s ^ " in " ^ Sign.string_of_term (sign_of thy) t))
webertj@14807
   431
		in
webertj@14807
   432
			map_term_types
webertj@14807
   433
				(map_type_tvar
webertj@14807
   434
					(fn (v,_) =>
webertj@14807
   435
						case Vartab.lookup (typeSubs, v) of
webertj@14807
   436
						  None =>
webertj@14807
   437
							(* schematic type variable not instantiated *)
webertj@14807
   438
							raise REFUTE ("collect_axioms", "term " ^ Sign.string_of_term (sign_of thy) t ^ " still has a polymorphic type (after instantiating type of " ^ quote s ^ ")")
webertj@14807
   439
						| Some typ =>
webertj@14807
   440
							typ))
webertj@14807
   441
					t
webertj@14807
   442
		end
webertj@14807
   443
		(* Term.term list * Term.typ -> Term.term list *)
webertj@14807
   444
		fun collect_type_axioms (axs, T) =
webertj@14807
   445
			case T of
webertj@14807
   446
			(* simple types *)
webertj@14807
   447
			  Type ("prop", [])      => axs
webertj@14807
   448
			| Type ("fun", [T1, T2]) => collect_type_axioms (collect_type_axioms (axs, T1), T2)
webertj@14807
   449
			| Type ("set", [T1])     => collect_type_axioms (axs, T1)
webertj@14807
   450
			| Type (s, Ts)           =>
webertj@14807
   451
				let
webertj@14807
   452
					(* look up the definition of a type, as created by "typedef" *)
webertj@14807
   453
					(* (string * Term.term) list -> (string * Term.term) option *)
webertj@14807
   454
					fun get_typedefn [] =
webertj@14807
   455
						None
webertj@14807
   456
					  | get_typedefn ((axname,ax)::axms) =
webertj@14807
   457
						(let
webertj@14807
   458
							(* Term.term -> Term.typ option *)
webertj@14807
   459
							fun type_of_type_definition (Const (s', T')) =
webertj@14807
   460
								if s'="Typedef.type_definition" then
webertj@14807
   461
									Some T'
webertj@14807
   462
								else
webertj@14807
   463
									None
webertj@14807
   464
							  | type_of_type_definition (Free _)           = None
webertj@14807
   465
							  | type_of_type_definition (Var _)            = None
webertj@14807
   466
							  | type_of_type_definition (Bound _)          = None
webertj@14807
   467
							  | type_of_type_definition (Abs (_, _, body)) = type_of_type_definition body
webertj@14807
   468
							  | type_of_type_definition (t1 $ t2)          = (case type_of_type_definition t1 of Some x => Some x | None => type_of_type_definition t2)
webertj@14807
   469
						in
webertj@14807
   470
							case type_of_type_definition ax of
webertj@14807
   471
							  Some T' =>
webertj@14807
   472
								let
webertj@14807
   473
									val T''      = (domain_type o domain_type) T'
webertj@14807
   474
									val typeSubs = Type.typ_match (Sign.tsig_of (sign_of thy)) (Vartab.empty, (T'', T))
webertj@14807
   475
									val unvar_ax = map_term_types
webertj@14807
   476
										(map_type_tvar
webertj@14807
   477
											(fn (v,_) =>
webertj@14807
   478
												case Vartab.lookup (typeSubs, v) of
webertj@14807
   479
												  None =>
webertj@14807
   480
													(* schematic type variable not instantiated *)
webertj@14807
   481
													raise ERROR
webertj@14807
   482
												| Some typ =>
webertj@14807
   483
													typ))
webertj@14807
   484
										ax
webertj@14807
   485
								in
webertj@14807
   486
									Some (axname, unvar_ax)
webertj@14807
   487
								end
webertj@14807
   488
							| None =>
webertj@14807
   489
								get_typedefn axms
webertj@14807
   490
						end
webertj@14807
   491
						handle ERROR           => get_typedefn axms
webertj@14807
   492
						     | MATCH           => get_typedefn axms
webertj@14807
   493
						     | Type.TYPE_MATCH => get_typedefn axms)
webertj@14807
   494
				in
webertj@14807
   495
					case DatatypePackage.datatype_info thy s of
webertj@14807
   496
					  Some info =>  (* inductive datatype *)
webertj@14807
   497
							(* only collect relevant type axioms for the argument types *)
webertj@14807
   498
							foldl collect_type_axioms (axs, Ts)
webertj@14807
   499
					| None =>
webertj@14807
   500
						(case get_typedefn axioms of
webertj@14807
   501
						  Some (axname, ax) => 
webertj@14807
   502
							if mem_term (ax, axs) then
webertj@14807
   503
								(* collect relevant type axioms for the argument types *)
webertj@14807
   504
								foldl collect_type_axioms (axs, Ts)
webertj@14807
   505
							else
wenzelm@14984
   506
								(immediate_output (" " ^ axname);
webertj@14807
   507
								collect_term_axioms (ax :: axs, ax))
webertj@14807
   508
						| None =>
webertj@14807
   509
							(* at least collect relevant type axioms for the argument types *)
webertj@14807
   510
							foldl collect_type_axioms (axs, Ts))
webertj@14807
   511
				end
webertj@14807
   512
			(* TODO: include sort axioms *)
wenzelm@14984
   513
			| TFree (_, sorts)       => ((*if not (null sorts) then immediate_output " *ignoring sorts*" else ();*) axs)
wenzelm@14984
   514
			| TVar  (_, sorts)       => ((*if not (null sorts) then immediate_output " *ignoring sorts*" else ();*) axs)
webertj@14807
   515
		(* Term.term list * Term.term -> Term.term list *)
webertj@14807
   516
		and collect_term_axioms (axs, t) =
webertj@14807
   517
			case t of
webertj@14807
   518
			(* Pure *)
webertj@14807
   519
			  Const ("all", _)                => axs
webertj@14807
   520
			| Const ("==", _)                 => axs
webertj@14807
   521
			| Const ("==>", _)                => axs
webertj@14807
   522
			(* HOL *)
webertj@14807
   523
			| Const ("Trueprop", _)           => axs
webertj@14807
   524
			| Const ("Not", _)                => axs
webertj@14807
   525
			| Const ("True", _)               => axs  (* redundant, since 'True' is also an IDT constructor *)
webertj@14807
   526
			| Const ("False", _)              => axs  (* redundant, since 'False' is also an IDT constructor *)
webertj@14807
   527
			| Const ("arbitrary", T)          => collect_type_axioms (axs, T)
webertj@14807
   528
			| Const ("The", T)                =>
webertj@14807
   529
				let
webertj@14807
   530
					val ax = specialize_type (("The", T), (the o assoc) (axioms, "HOL.the_eq_trivial"))
webertj@14807
   531
				in
webertj@14807
   532
					if mem_term (ax, axs) then
webertj@14807
   533
						collect_type_axioms (axs, T)
webertj@14807
   534
					else
wenzelm@14984
   535
						(immediate_output " HOL.the_eq_trivial";
webertj@14807
   536
						collect_term_axioms (ax :: axs, ax))
webertj@14807
   537
				end
webertj@14807
   538
			| Const ("Hilbert_Choice.Eps", T) =>
webertj@14807
   539
				let
webertj@14807
   540
					val ax = specialize_type (("Hilbert_Choice.Eps", T), (the o assoc) (axioms, "Hilbert_Choice.someI"))
webertj@14807
   541
				in
webertj@14807
   542
					if mem_term (ax, axs) then
webertj@14807
   543
						collect_type_axioms (axs, T)
webertj@14807
   544
					else
wenzelm@14984
   545
						(immediate_output " Hilbert_Choice.someI";
webertj@14807
   546
						collect_term_axioms (ax :: axs, ax))
webertj@14807
   547
				end
webertj@14807
   548
			| Const ("All", _) $ t1           => collect_term_axioms (axs, t1)
webertj@14807
   549
			| Const ("Ex", _) $ t1            => collect_term_axioms (axs, t1)
webertj@14807
   550
			| Const ("op =", T)               => collect_type_axioms (axs, T)
webertj@14807
   551
			| Const ("op &", _)               => axs
webertj@14807
   552
			| Const ("op |", _)               => axs
webertj@14807
   553
			| Const ("op -->", _)             => axs
webertj@14807
   554
			(* sets *)
webertj@14807
   555
			| Const ("Collect", T)            => collect_type_axioms (axs, T)
webertj@14807
   556
			| Const ("op :", T)               => collect_type_axioms (axs, T)
webertj@14807
   557
			(* other optimizations *)
webertj@14807
   558
			| Const ("Finite_Set.card", T)    => collect_type_axioms (axs, T)
webertj@14807
   559
			(* simply-typed lambda calculus *)
webertj@14807
   560
			| Const (s, T)                    =>
webertj@14807
   561
				let
webertj@14807
   562
					(* look up the definition of a constant, as created by "constdefs" *)
webertj@14807
   563
					(* string -> Term.typ -> (string * Term.term) list -> (string * Term.term) option *)
webertj@14807
   564
					fun get_defn [] =
webertj@14807
   565
						None
webertj@14807
   566
					  | get_defn ((axname,ax)::axms) =
webertj@14807
   567
						(let
webertj@14807
   568
							val (lhs, _) = Logic.dest_equals ax  (* equations only *)
webertj@14807
   569
							val c        = head_of lhs
webertj@14807
   570
							val (s', T') = dest_Const c
webertj@14807
   571
						in
webertj@14807
   572
							if s=s' then
webertj@14807
   573
								let
webertj@14807
   574
									val typeSubs = Type.typ_match (Sign.tsig_of (sign_of thy)) (Vartab.empty, (T', T))
webertj@14807
   575
									val unvar_ax = map_term_types
webertj@14807
   576
										(map_type_tvar
webertj@14807
   577
											(fn (v,_) =>
webertj@14807
   578
												case Vartab.lookup (typeSubs, v) of
webertj@14807
   579
												  None =>
webertj@14807
   580
													(* schematic type variable not instantiated *)
webertj@14807
   581
													raise ERROR
webertj@14807
   582
												| Some typ =>
webertj@14807
   583
													typ))
webertj@14807
   584
										ax
webertj@14807
   585
								in
webertj@14807
   586
									Some (axname, unvar_ax)
webertj@14807
   587
								end
webertj@14807
   588
							else
webertj@14807
   589
								get_defn axms
webertj@14807
   590
						end
webertj@14807
   591
						handle ERROR           => get_defn axms
webertj@14807
   592
						     | TERM _          => get_defn axms
webertj@14807
   593
						     | Type.TYPE_MATCH => get_defn axms)
webertj@14807
   594
						(* unit -> bool *)
webertj@14807
   595
						fun is_IDT_constructor () =
webertj@14807
   596
							(case body_type T of
webertj@14807
   597
							  Type (s', _) =>
webertj@14807
   598
								(case DatatypePackage.constrs_of thy s' of
webertj@14807
   599
								  Some constrs =>
webertj@14807
   600
									Library.exists (fn c =>
webertj@14807
   601
										(case c of
webertj@14807
   602
										  Const (cname, ctype) =>
webertj@14810
   603
											cname = s andalso Type.typ_instance (Sign.tsig_of (sign_of thy)) (T, ctype)
webertj@14807
   604
										| _ =>
webertj@14807
   605
											raise REFUTE ("collect_axioms", "IDT constructor is not a constant")))
webertj@14807
   606
										constrs
webertj@14807
   607
								| None =>
webertj@14807
   608
									false)
webertj@14807
   609
							| _  =>
webertj@14807
   610
								false)
webertj@14807
   611
						(* unit -> bool *)
webertj@14807
   612
						fun is_IDT_recursor () =
webertj@14807
   613
							(* the type of a recursion operator: [T1,...,Tn,IDT]--->TResult (where *)
webertj@14807
   614
							(* the T1,...,Tn depend on the types of the datatype's constructors)   *)
webertj@14807
   615
							((case last_elem (binder_types T) of
webertj@14807
   616
							  Type (s', _) =>
webertj@14807
   617
								(case DatatypePackage.datatype_info thy s' of
webertj@14807
   618
								  Some info =>
webertj@15125
   619
									(* TODO: I'm not quite sure if comparing the names is sufficient, or if *)
webertj@14807
   620
									(*       we should also check the type                                  *)
webertj@14807
   621
									s mem (#rec_names info)
webertj@14807
   622
								| None =>  (* not an inductive datatype *)
webertj@14807
   623
									false)
webertj@14807
   624
							| _ =>  (* a (free or schematic) type variable *)
webertj@14807
   625
								false)
webertj@14807
   626
							handle LIST "last_elem" => false)  (* not even a function type *)
webertj@14807
   627
				in
webertj@15125
   628
					if is_IDT_constructor () then
webertj@14807
   629
						(* only collect relevant type axioms *)
webertj@14807
   630
						collect_type_axioms (axs, T)
webertj@15125
   631
					else if is_IDT_recursor () then (
webertj@15125
   632
						(* TODO: we must add the definition of the recursion operator to the axioms, or *)
webertj@15125
   633
						(*       (better yet, since simply unfolding the definition won't work for      *)
webertj@15125
   634
						(*       initial fragments of recursive IDTs) write an interpreter that         *)
webertj@15125
   635
						(*       respects it                                                            *)
webertj@15125
   636
						warning "Term contains recursion over a datatype; countermodel(s) may be spurious!";
webertj@15125
   637
						(* only collect relevant type axioms *)
webertj@15125
   638
						collect_type_axioms (axs, T)
webertj@15125
   639
					) else
webertj@14807
   640
						(case get_defn axioms of
webertj@14807
   641
						  Some (axname, ax) => 
webertj@14807
   642
							if mem_term (ax, axs) then
webertj@14807
   643
								(* collect relevant type axioms *)
webertj@14807
   644
								collect_type_axioms (axs, T)
webertj@14807
   645
							else
wenzelm@14984
   646
								(immediate_output (" " ^ axname);
webertj@14807
   647
								collect_term_axioms (ax :: axs, ax))
webertj@14807
   648
						| None =>
webertj@14807
   649
							(* collect relevant type axioms *)
webertj@14807
   650
							collect_type_axioms (axs, T))
webertj@14807
   651
				end
webertj@14807
   652
			| Free (_, T)                     => collect_type_axioms (axs, T)
webertj@14807
   653
			| Var (_, T)                      => collect_type_axioms (axs, T)
webertj@14807
   654
			| Bound i                         => axs
webertj@14807
   655
			| Abs (_, T, body)                => collect_term_axioms (collect_type_axioms (axs, T), body)
webertj@14807
   656
			| t1 $ t2                         => collect_term_axioms (collect_term_axioms (axs, t1), t2)
webertj@14807
   657
		(* universal closure over schematic variables *)
webertj@14807
   658
		(* Term.term -> Term.term *)
webertj@14807
   659
		fun close_form t =
webertj@14807
   660
		let
webertj@14807
   661
			(* (Term.indexname * Term.typ) list *)
webertj@14807
   662
			val vars = sort_wrt (fst o fst) (map dest_Var (term_vars t))
webertj@14807
   663
		in
webertj@14807
   664
			foldl
webertj@14807
   665
				(fn (t', ((x,i),T)) => (Term.all T) $ Abs (x, T, abstract_over (Var((x,i),T), t')))
webertj@14807
   666
				(t, vars)
webertj@14807
   667
		end
webertj@14807
   668
		(* Term.term list *)
webertj@14807
   669
		val result = map close_form (collect_term_axioms ([], t))
webertj@14807
   670
		val _ = writeln " ...done."
webertj@14807
   671
	in
webertj@14807
   672
		result
webertj@14456
   673
	end;
webertj@14456
   674
webertj@14456
   675
(* ------------------------------------------------------------------------- *)
webertj@14807
   676
(* ground_types: collects all ground types in a term (including argument     *)
webertj@14807
   677
(*               types of other types), suppressing duplicates.  Does not    *)
webertj@14807
   678
(*               return function types, set types, non-recursive IDTs, or    *)
webertj@14807
   679
(*               'propT'.  For IDTs, also the argument types of constructors *)
webertj@14807
   680
(*               are considered.                                             *)
webertj@14807
   681
(* ------------------------------------------------------------------------- *)
webertj@14807
   682
webertj@14807
   683
	(* theory -> Term.term -> Term.typ list *)
webertj@14807
   684
webertj@14807
   685
	fun ground_types thy t =
webertj@14807
   686
	let
webertj@14807
   687
		(* Term.typ * Term.typ list -> Term.typ list *)
webertj@14807
   688
		fun collect_types (T, acc) =
webertj@14807
   689
			if T mem acc then
webertj@14807
   690
				acc  (* prevent infinite recursion (for IDTs) *)
webertj@14807
   691
			else
webertj@14807
   692
				(case T of
webertj@14807
   693
				  Type ("fun", [T1, T2]) => collect_types (T1, collect_types (T2, acc))
webertj@14807
   694
				| Type ("prop", [])      => acc
webertj@14807
   695
				| Type ("set", [T1])     => collect_types (T1, acc)
webertj@14807
   696
				| Type (s, Ts)           =>
webertj@14807
   697
					(case DatatypePackage.datatype_info thy s of
webertj@14807
   698
					  Some info =>  (* inductive datatype *)
webertj@14807
   699
						let
webertj@14807
   700
							val index               = #index info
webertj@14807
   701
							val descr               = #descr info
webertj@14807
   702
							val (_, dtyps, constrs) = (the o assoc) (descr, index)
webertj@14807
   703
							val typ_assoc           = dtyps ~~ Ts
webertj@14807
   704
							(* sanity check: every element in 'dtyps' must be a 'DtTFree' *)
webertj@14807
   705
							val _ = (if Library.exists (fn d =>
webertj@14807
   706
									case d of DatatypeAux.DtTFree _ => false | _ => true) dtyps
webertj@14807
   707
								then
webertj@14807
   708
									raise REFUTE ("ground_types", "datatype argument (for type " ^ Sign.string_of_typ (sign_of thy) (Type (s, Ts)) ^ ") is not a variable")
webertj@14807
   709
								else
webertj@14807
   710
									())
webertj@14807
   711
							(* DatatypeAux.descr -> (DatatypeAux.dtyp * Term.typ) list -> DatatypeAux.dtyp -> Term.typ *)
webertj@14807
   712
							fun typ_of_dtyp descr typ_assoc (DatatypeAux.DtTFree a) =
webertj@14807
   713
								(* replace a 'DtTFree' variable by the associated type *)
webertj@14807
   714
								(the o assoc) (typ_assoc, DatatypeAux.DtTFree a)
webertj@14807
   715
							  | typ_of_dtyp descr typ_assoc (DatatypeAux.DtRec i) =
webertj@14807
   716
								let
webertj@14807
   717
									val (s, ds, _) = (the o assoc) (descr, i)
webertj@14807
   718
								in
webertj@14807
   719
									Type (s, map (typ_of_dtyp descr typ_assoc) ds)
webertj@14807
   720
								end
webertj@14807
   721
							  | typ_of_dtyp descr typ_assoc (DatatypeAux.DtType (s, ds)) =
webertj@14807
   722
								Type (s, map (typ_of_dtyp descr typ_assoc) ds)
webertj@14807
   723
							(* if the current type is a recursive IDT (i.e. a depth is required), add it to 'acc' *)
webertj@14807
   724
							val acc' = (if Library.exists (fn (_, ds) => Library.exists DatatypeAux.is_rec_type ds) constrs then
webertj@14807
   725
									T ins acc
webertj@14807
   726
								else
webertj@14807
   727
									acc)
webertj@14807
   728
							(* collect argument types *)
webertj@14807
   729
							val acc_args = foldr collect_types (Ts, acc')
webertj@14807
   730
							(* collect constructor types *)
webertj@14807
   731
							val acc_constrs = foldr collect_types (flat (map (fn (_, ds) => map (typ_of_dtyp descr typ_assoc) ds) constrs), acc_args)
webertj@14807
   732
						in
webertj@14807
   733
							acc_constrs
webertj@14807
   734
						end
webertj@14807
   735
					| None =>  (* not an inductive datatype, e.g. defined via "typedef" or "typedecl" *)
webertj@14807
   736
						T ins (foldr collect_types (Ts, acc)))
webertj@14807
   737
				| TFree _                => T ins acc
webertj@14807
   738
				| TVar _                 => T ins acc)
webertj@14807
   739
	in
webertj@14807
   740
		it_term_types collect_types (t, [])
webertj@14807
   741
	end;
webertj@14807
   742
webertj@14807
   743
(* ------------------------------------------------------------------------- *)
webertj@14807
   744
(* string_of_typ: (rather naive) conversion from types to strings, used to   *)
webertj@14807
   745
(*                look up the size of a type in 'sizes'.  Parameterized      *)
webertj@14807
   746
(*                types with different parameters (e.g. "'a list" vs. "bool  *)
webertj@14807
   747
(*                list") are identified.                                     *)
webertj@14807
   748
(* ------------------------------------------------------------------------- *)
webertj@14807
   749
webertj@14807
   750
	(* Term.typ -> string *)
webertj@14807
   751
webertj@14807
   752
	fun string_of_typ (Type (s, _))     = s
webertj@14807
   753
	  | string_of_typ (TFree (s, _))    = s
webertj@14807
   754
	  | string_of_typ (TVar ((s,_), _)) = s;
webertj@14807
   755
webertj@14807
   756
(* ------------------------------------------------------------------------- *)
webertj@14807
   757
(* first_universe: returns the "first" (i.e. smallest) universe by assigning *)
webertj@14807
   758
(*                 'minsize' to every type for which no size is specified in *)
webertj@14807
   759
(*                 'sizes'                                                   *)
webertj@14807
   760
(* ------------------------------------------------------------------------- *)
webertj@14807
   761
webertj@14807
   762
	(* Term.typ list -> (string * int) list -> int -> (Term.typ * int) list *)
webertj@14807
   763
webertj@14807
   764
	fun first_universe xs sizes minsize =
webertj@14807
   765
	let
webertj@14807
   766
		fun size_of_typ T =
webertj@14807
   767
			case assoc (sizes, string_of_typ T) of
webertj@14807
   768
			  Some n => n
webertj@14807
   769
			| None   => minsize
webertj@14807
   770
	in
webertj@14807
   771
		map (fn T => (T, size_of_typ T)) xs
webertj@14807
   772
	end;
webertj@14807
   773
webertj@14807
   774
(* ------------------------------------------------------------------------- *)
webertj@14807
   775
(* next_universe: enumerates all universes (i.e. assignments of sizes to     *)
webertj@14807
   776
(*                types), where the minimal size of a type is given by       *)
webertj@14807
   777
(*                'minsize', the maximal size is given by 'maxsize', and a   *)
webertj@14807
   778
(*                type may have a fixed size given in 'sizes'                *)
webertj@14456
   779
(* ------------------------------------------------------------------------- *)
webertj@14456
   780
webertj@14807
   781
	(* (Term.typ * int) list -> (string * int) list -> int -> int -> (Term.typ * int) list option *)
webertj@14456
   782
webertj@14807
   783
	fun next_universe xs sizes minsize maxsize =
webertj@14456
   784
	let
webertj@14807
   785
		(* int -> int list -> int list option *)
webertj@14807
   786
		fun add1 _ [] =
webertj@14807
   787
			None  (* overflow *)
webertj@14807
   788
		  | add1 max (x::xs) =
webertj@14807
   789
		 	if x<max orelse max<0 then
webertj@14807
   790
				Some ((x+1)::xs)  (* add 1 to the head *)
webertj@14807
   791
			else
webertj@14807
   792
				apsome (fn xs' => 0 :: xs') (add1 max xs)  (* carry-over *)
webertj@14807
   793
		(* int -> int list * int list -> int list option *)
webertj@14807
   794
		fun shift _ (_, []) =
webertj@14807
   795
			None
webertj@14807
   796
		  | shift max (zeros, x::xs) =
webertj@14807
   797
			if x=0 then
webertj@14807
   798
				shift max (0::zeros, xs)
webertj@14456
   799
			else
webertj@14807
   800
				apsome (fn xs' => (x-1) :: (zeros @ xs')) (add1 max xs)
webertj@14807
   801
		(* creates the "first" list of length 'len', where the sum of all list *)
webertj@14807
   802
		(* elements is 'sum', and the length of the list is 'len'              *)
webertj@14807
   803
		(* int -> int -> int -> int list option *)
webertj@14807
   804
		fun make_first 0 sum _ =
webertj@14807
   805
			if sum=0 then
webertj@14807
   806
				Some []
webertj@14807
   807
			else
webertj@14807
   808
				None
webertj@14807
   809
		  | make_first len sum max =
webertj@14807
   810
			if sum<=max orelse max<0 then
webertj@14807
   811
				apsome (fn xs' => sum :: xs') (make_first (len-1) 0 max)
webertj@14807
   812
			else
webertj@14807
   813
				apsome (fn xs' => max :: xs') (make_first (len-1) (sum-max) max)
webertj@14807
   814
		(* enumerates all int lists with a fixed length, where 0<=x<='max' for *)
webertj@14807
   815
		(* all list elements x (unless 'max'<0)                                *)
webertj@14807
   816
		(* int -> int list -> int list option *)
webertj@14807
   817
		fun next max xs =
webertj@14807
   818
			(case shift max ([], xs) of
webertj@14807
   819
			  Some xs' =>
webertj@14807
   820
				Some xs'
webertj@14807
   821
			| None =>
webertj@14456
   822
				let
webertj@14807
   823
					val (len, sum) = foldl (fn ((l, s), x) => (l+1, s+x)) ((0, 0), xs)
webertj@14456
   824
				in
webertj@14807
   825
					make_first len (sum+1) max  (* increment 'sum' by 1 *)
webertj@14807
   826
				end)
webertj@14807
   827
		(* only consider those types for which the size is not fixed *)
webertj@14807
   828
		val mutables = filter (fn (T, _) => assoc (sizes, string_of_typ T) = None) xs
webertj@14807
   829
		(* subtract 'minsize' from every size (will be added again at the end) *)
webertj@14807
   830
		val diffs = map (fn (_, n) => n-minsize) mutables
webertj@14807
   831
	in
webertj@14807
   832
		case next (maxsize-minsize) diffs of
webertj@14807
   833
		  Some diffs' =>
webertj@14807
   834
			(* merge with those types for which the size is fixed *)
webertj@14807
   835
			Some (snd (foldl_map (fn (ds, (T, _)) =>
webertj@14807
   836
				case assoc (sizes, string_of_typ T) of
webertj@14807
   837
				  Some n => (ds, (T, n))                      (* return the fixed size *)
webertj@14807
   838
				| None   => (tl ds, (T, minsize + (hd ds))))  (* consume the head of 'ds', add 'minsize' *)
webertj@14807
   839
				(diffs', xs)))
webertj@14807
   840
		| None =>
webertj@14807
   841
			None
webertj@14807
   842
	end;
webertj@14807
   843
webertj@14807
   844
(* ------------------------------------------------------------------------- *)
webertj@14807
   845
(* toTrue: converts the interpretation of a Boolean value to a propositional *)
webertj@14807
   846
(*         formula that is true iff the interpretation denotes "true"        *)
webertj@14807
   847
(* ------------------------------------------------------------------------- *)
webertj@14807
   848
webertj@14807
   849
	(* interpretation -> prop_formula *)
webertj@14807
   850
webertj@14807
   851
	fun toTrue (Leaf [fm,_]) = fm
webertj@14807
   852
	  | toTrue _             = raise REFUTE ("toTrue", "interpretation does not denote a Boolean value");
webertj@14807
   853
webertj@14807
   854
(* ------------------------------------------------------------------------- *)
webertj@14807
   855
(* toFalse: converts the interpretation of a Boolean value to a              *)
webertj@14807
   856
(*          propositional formula that is true iff the interpretation        *)
webertj@14807
   857
(*          denotes "false"                                                  *)
webertj@14807
   858
(* ------------------------------------------------------------------------- *)
webertj@14807
   859
webertj@14807
   860
	(* interpretation -> prop_formula *)
webertj@14807
   861
webertj@14807
   862
	fun toFalse (Leaf [_,fm]) = fm
webertj@14807
   863
	  | toFalse _             = raise REFUTE ("toFalse", "interpretation does not denote a Boolean value");
webertj@14807
   864
webertj@14807
   865
(* ------------------------------------------------------------------------- *)
webertj@14807
   866
(* find_model: repeatedly calls 'interpret' with appropriate parameters,     *)
webertj@14807
   867
(*             applies a SAT solver, and (in case a model is found) displays *)
webertj@14807
   868
(*             the model to the user by calling 'print_model'                *)
webertj@14807
   869
(* thy       : the current theory                                            *)
webertj@14807
   870
(* {...}     : parameters that control the translation/model generation      *)
webertj@14807
   871
(* t         : term to be translated into a propositional formula            *)
webertj@14807
   872
(* negate    : if true, find a model that makes 't' false (rather than true) *)
webertj@14807
   873
(* Note: exception 'TimeOut' is raised if the algorithm does not terminate   *)
webertj@14807
   874
(*       within 'maxtime' seconds (if 'maxtime' >0)                          *)
webertj@14807
   875
(* ------------------------------------------------------------------------- *)
webertj@14807
   876
webertj@14807
   877
	(* theory -> params -> Term.term -> bool -> unit *)
webertj@14807
   878
webertj@14807
   879
	fun find_model thy {sizes, minsize, maxsize, maxvars, maxtime, satsolver} t negate =
webertj@14807
   880
	let
webertj@14807
   881
		(* unit -> unit *)
webertj@14807
   882
		fun wrapper () =
webertj@14807
   883
		let
webertj@14807
   884
			(* Term.term list *)
webertj@14807
   885
			val axioms = collect_axioms thy t
webertj@14807
   886
			(* Term.typ list *)
webertj@14807
   887
			val types  = foldl (fn (acc, t') => acc union (ground_types thy t')) ([], t :: axioms)
webertj@14807
   888
			val _      = writeln ("Ground types: "
webertj@14807
   889
				^ (if null types then "none."
webertj@14807
   890
				   else commas (map (Sign.string_of_typ (sign_of thy)) types)))
webertj@14807
   891
			(* (Term.typ * int) list -> unit *)
webertj@14807
   892
			fun find_model_loop universe =
webertj@14807
   893
			(let
webertj@14807
   894
				val init_model             = (universe, [])
webertj@14807
   895
				val init_args              = {maxvars = maxvars, next_idx = 1, bounds = [], wellformed = True}
wenzelm@14984
   896
				val _                      = immediate_output ("Translating term (sizes: " ^ commas (map (fn (_, n) => string_of_int n) universe) ^ ") ...")
webertj@14807
   897
				(* translate 't' and all axioms *)
webertj@14807
   898
				val ((model, args), intrs) = foldl_map (fn ((m, a), t') =>
webertj@14807
   899
					let
webertj@14807
   900
						val (i, m', a') = interpret thy m a t'
webertj@14807
   901
					in
webertj@14807
   902
						((m', a'), i)
webertj@14807
   903
					end) ((init_model, init_args), t :: axioms)
webertj@14807
   904
				(* make 't' either true or false, and make all axioms true, and *)
webertj@14807
   905
				(* add the well-formedness side condition                       *)
webertj@14807
   906
				val fm_t  = (if negate then toFalse else toTrue) (hd intrs)
webertj@14807
   907
				val fm_ax = PropLogic.all (map toTrue (tl intrs))
webertj@14807
   908
				val fm    = PropLogic.all [#wellformed args, fm_ax, fm_t]
webertj@14456
   909
			in
wenzelm@14984
   910
				immediate_output " invoking SAT solver...";
webertj@14965
   911
				(case SatSolver.invoke_solver satsolver fm of
webertj@14965
   912
				  SatSolver.SATISFIABLE assignment =>
webertj@14965
   913
					writeln ("\n*** Model found: ***\n" ^ print_model thy model (fn i => case assignment i of Some b => b | None => true))
webertj@14965
   914
				| _ =>  (* SatSolver.UNSATISFIABLE, SatSolver.UNKNOWN *)
wenzelm@14984
   915
					(immediate_output " no model found.\n";
webertj@14807
   916
					case next_universe universe sizes minsize maxsize of
webertj@14807
   917
					  Some universe' => find_model_loop universe'
webertj@14965
   918
					| None           => writeln "Search terminated, no larger universe within the given limits."))
webertj@14965
   919
				handle SatSolver.NOT_CONFIGURED =>
webertj@14965
   920
					error ("SAT solver " ^ quote satsolver ^ " is not configured.")
webertj@14807
   921
			end handle MAXVARS_EXCEEDED =>
webertj@14807
   922
				writeln ("\nSearch terminated, number of Boolean variables (" ^ string_of_int maxvars ^ " allowed) exceeded.")
webertj@14807
   923
			| CANNOT_INTERPRET t' =>
webertj@14807
   924
				error ("Unable to interpret term " ^ Sign.string_of_term (sign_of thy) t'))
webertj@14807
   925
			in
webertj@14807
   926
				find_model_loop (first_universe types sizes minsize)
webertj@14456
   927
			end
webertj@14807
   928
		in
webertj@14807
   929
			(* some parameter sanity checks *)
webertj@14807
   930
			assert (minsize>=1) ("\"minsize\" is " ^ string_of_int minsize ^ ", must be at least 1");
webertj@14807
   931
			assert (maxsize>=1) ("\"maxsize\" is " ^ string_of_int maxsize ^ ", must be at least 1");
webertj@14807
   932
			assert (maxsize>=minsize) ("\"maxsize\" (=" ^ string_of_int maxsize ^ ") is less than \"minsize\" (=" ^ string_of_int minsize ^ ").");
webertj@14807
   933
			assert (maxvars>=0) ("\"maxvars\" is " ^ string_of_int maxvars ^ ", must be at least 0");
webertj@14807
   934
			assert (maxtime>=0) ("\"maxtime\" is " ^ string_of_int maxtime ^ ", must be at least 0");
webertj@14807
   935
			(* enter loop with/without time limit *)
webertj@14807
   936
			writeln ("Trying to find a model that " ^ (if negate then "refutes" else "satisfies") ^ ": "
webertj@14807
   937
				^ Sign.string_of_term (sign_of thy) t);
webertj@14807
   938
			if maxtime>0 then
webertj@14965
   939
				(TimeLimit.timeLimit (Time.fromSeconds (Int.toLarge maxtime))
webertj@14807
   940
					wrapper ()
webertj@14965
   941
				handle TimeLimit.TimeOut =>
webertj@14807
   942
					writeln ("\nSearch terminated, time limit ("
webertj@14965
   943
						^ string_of_int maxtime ^ (if maxtime=1 then " second" else " seconds")
webertj@14965
   944
						^ ") exceeded."))
webertj@14807
   945
			else
webertj@14807
   946
				wrapper ()
webertj@14807
   947
		end;
webertj@14456
   948
webertj@14456
   949
webertj@14456
   950
(* ------------------------------------------------------------------------- *)
webertj@14456
   951
(* INTERFACE, PART 2: FINDING A MODEL                                        *)
webertj@14350
   952
(* ------------------------------------------------------------------------- *)
webertj@14350
   953
webertj@14350
   954
(* ------------------------------------------------------------------------- *)
webertj@14456
   955
(* satisfy_term: calls 'find_model' to find a model that satisfies 't'       *)
webertj@14456
   956
(* params      : list of '(name, value)' pairs used to override default      *)
webertj@14456
   957
(*               parameters                                                  *)
webertj@14350
   958
(* ------------------------------------------------------------------------- *)
webertj@14350
   959
webertj@14456
   960
	(* theory -> (string * string) list -> Term.term -> unit *)
webertj@14350
   961
webertj@14456
   962
	fun satisfy_term thy params t =
webertj@14807
   963
		find_model thy (actual_params thy params) t false;
webertj@14350
   964
webertj@14350
   965
(* ------------------------------------------------------------------------- *)
webertj@14456
   966
(* refute_term: calls 'find_model' to find a model that refutes 't'          *)
webertj@14456
   967
(* params     : list of '(name, value)' pairs used to override default       *)
webertj@14456
   968
(*              parameters                                                   *)
webertj@14350
   969
(* ------------------------------------------------------------------------- *)
webertj@14350
   970
webertj@14456
   971
	(* theory -> (string * string) list -> Term.term -> unit *)
webertj@14350
   972
webertj@14456
   973
	fun refute_term thy params t =
webertj@14350
   974
	let
webertj@14807
   975
		(* disallow schematic type variables, since we cannot properly negate  *)
webertj@14807
   976
		(* terms containing them (their logical meaning is that there EXISTS a *)
webertj@14807
   977
		(* type s.t. ...; to refute such a formula, we would have to show that *)
webertj@14807
   978
		(* for ALL types, not ...)                                             *)
webertj@14456
   979
		val _ = assert (null (term_tvars t)) "Term to be refuted contains schematic type variables"
webertj@14456
   980
		(* existential closure over schematic variables *)
webertj@14456
   981
		(* (Term.indexname * Term.typ) list *)
webertj@14456
   982
		val vars = sort_wrt (fst o fst) (map dest_Var (term_vars t))
webertj@14456
   983
		(* Term.term *)
webertj@14456
   984
		val ex_closure = foldl
webertj@14456
   985
			(fn (t', ((x,i),T)) => (HOLogic.exists_const T) $ Abs (x, T, abstract_over (Var((x,i),T), t')))
webertj@14456
   986
			(t, vars)
webertj@14456
   987
		(* If 't' is of type 'propT' (rather than 'boolT'), applying  *)
webertj@14456
   988
		(* 'HOLogic.exists_const' is not type-correct.  However, this *)
webertj@14807
   989
		(* is not really a problem as long as 'find_model' still      *)
webertj@14456
   990
		(* interprets the resulting term correctly, without checking  *)
webertj@14456
   991
		(* its type.                                                  *)
webertj@14350
   992
	in
webertj@14807
   993
		find_model thy (actual_params thy params) ex_closure true
webertj@14350
   994
	end;
webertj@14350
   995
webertj@14350
   996
(* ------------------------------------------------------------------------- *)
webertj@14456
   997
(* refute_subgoal: calls 'refute_term' on a specific subgoal                 *)
webertj@14456
   998
(* params        : list of '(name, value)' pairs used to override default    *)
webertj@14456
   999
(*                 parameters                                                *)
webertj@14456
  1000
(* subgoal       : 0-based index specifying the subgoal number               *)
webertj@14350
  1001
(* ------------------------------------------------------------------------- *)
webertj@14350
  1002
webertj@14456
  1003
	(* theory -> (string * string) list -> Thm.thm -> int -> unit *)
webertj@14350
  1004
webertj@14456
  1005
	fun refute_subgoal thy params thm subgoal =
webertj@14456
  1006
		refute_term thy params (nth_elem (subgoal, prems_of thm));
webertj@14350
  1007
webertj@14350
  1008
webertj@14350
  1009
(* ------------------------------------------------------------------------- *)
webertj@14456
  1010
(* INTERPRETERS                                                              *)
webertj@14350
  1011
(* ------------------------------------------------------------------------- *)
webertj@14350
  1012
webertj@14350
  1013
(* ------------------------------------------------------------------------- *)
webertj@14807
  1014
(* make_constants: returns all interpretations that have the same tree       *)
webertj@14807
  1015
(*                 structure as 'intr', but consist of unit vectors with     *)
webertj@14807
  1016
(*                 'True'/'False' only (no Boolean variables)                *)
webertj@14350
  1017
(* ------------------------------------------------------------------------- *)
webertj@14350
  1018
webertj@14807
  1019
	(* interpretation -> interpretation list *)
webertj@14350
  1020
webertj@14807
  1021
	fun make_constants intr =
webertj@14456
  1022
	let
webertj@14350
  1023
		(* returns a list with all unit vectors of length n *)
webertj@14456
  1024
		(* int -> interpretation list *)
webertj@14350
  1025
		fun unit_vectors n =
webertj@14350
  1026
		let
webertj@14350
  1027
			(* returns the k-th unit vector of length n *)
webertj@14456
  1028
			(* int * int -> interpretation *)
webertj@14350
  1029
			fun unit_vector (k,n) =
webertj@14350
  1030
				Leaf ((replicate (k-1) False) @ (True :: (replicate (n-k) False)))
webertj@14456
  1031
			(* int -> interpretation list -> interpretation list *)
webertj@14350
  1032
			fun unit_vectors_acc k vs =
webertj@14350
  1033
				if k>n then [] else (unit_vector (k,n))::(unit_vectors_acc (k+1) vs)
webertj@14350
  1034
		in
webertj@14350
  1035
			unit_vectors_acc 1 []
webertj@14350
  1036
		end
webertj@14350
  1037
		(* concatenates 'x' with every list in 'xss', returning a new list of lists *)
webertj@14350
  1038
		(* 'a -> 'a list list -> 'a list list *)
webertj@14350
  1039
		fun cons_list x xss =
webertj@14350
  1040
			map (fn xs => x::xs) xss
webertj@14350
  1041
		(* returns a list of lists, each one consisting of n (possibly identical) elements from 'xs' *)
webertj@14350
  1042
		(* int -> 'a list -> 'a list list *)
webertj@14350
  1043
		fun pick_all 1 xs =
webertj@14350
  1044
			map (fn x => [x]) xs
webertj@14350
  1045
		  | pick_all n xs =
webertj@14350
  1046
			let val rec_pick = pick_all (n-1) xs in
webertj@14350
  1047
				foldl (fn (acc,x) => (cons_list x rec_pick) @ acc) ([],xs)
webertj@14350
  1048
			end
webertj@14807
  1049
	in
webertj@14807
  1050
		case intr of
webertj@14807
  1051
		  Leaf xs => unit_vectors (length xs)
webertj@14807
  1052
		| Node xs => map (fn xs' => Node xs') (pick_all (length xs) (make_constants (hd xs)))
webertj@14807
  1053
	end;
webertj@14807
  1054
webertj@14807
  1055
(* ------------------------------------------------------------------------- *)
webertj@14807
  1056
(* size_of_type: returns the number of constants in a type (i.e. 'length     *)
webertj@14807
  1057
(*               (make_constants intr)', but implemented more efficiently)   *)
webertj@14807
  1058
(* ------------------------------------------------------------------------- *)
webertj@14807
  1059
webertj@14807
  1060
	(* interpretation -> int *)
webertj@14807
  1061
webertj@14807
  1062
	fun size_of_type intr =
webertj@14807
  1063
	let
webertj@14807
  1064
		(* power(a,b) computes a^b, for a>=0, b>=0 *)
webertj@14807
  1065
		(* int * int -> int *)
webertj@14807
  1066
		fun power (a,0) = 1
webertj@14807
  1067
		  | power (a,1) = a
webertj@14807
  1068
		  | power (a,b) = let val ab = power(a,b div 2) in ab * ab * power(a,b mod 2) end
webertj@14807
  1069
	in
webertj@14807
  1070
		case intr of
webertj@14807
  1071
		  Leaf xs => length xs
webertj@14807
  1072
		| Node xs => power (size_of_type (hd xs), length xs)
webertj@14807
  1073
	end;
webertj@14807
  1074
webertj@14807
  1075
(* ------------------------------------------------------------------------- *)
webertj@14807
  1076
(* TT/FF: interpretations that denote "true" or "false", respectively        *)
webertj@14807
  1077
(* ------------------------------------------------------------------------- *)
webertj@14807
  1078
webertj@14807
  1079
	(* interpretation *)
webertj@14807
  1080
webertj@14807
  1081
	val TT = Leaf [True, False];
webertj@14807
  1082
webertj@14807
  1083
	val FF = Leaf [False, True];
webertj@14807
  1084
webertj@14807
  1085
(* ------------------------------------------------------------------------- *)
webertj@14807
  1086
(* make_equality: returns an interpretation that denotes (extensional)       *)
webertj@14807
  1087
(*                equality of two interpretations                            *)
webertj@14807
  1088
(* ------------------------------------------------------------------------- *)
webertj@14807
  1089
webertj@14807
  1090
	(* We could in principle represent '=' on a type T by a particular        *)
webertj@14807
  1091
	(* interpretation.  However, the size of that interpretation is quadratic *)
webertj@14807
  1092
	(* in the size of T.  Therefore comparing the interpretations 'i1' and    *)
webertj@14807
  1093
	(* 'i2' directly is more efficient than constructing the interpretation   *)
webertj@14807
  1094
	(* for equality on T first, and "applying" this interpretation to 'i1'    *)
webertj@14807
  1095
	(* and 'i2' in the usual way (cf. 'interpretation_apply') then.           *)
webertj@14807
  1096
webertj@14807
  1097
	(* interpretation * interpretation -> interpretation *)
webertj@14807
  1098
webertj@14807
  1099
	fun make_equality (i1, i2) =
webertj@14807
  1100
	let
webertj@14807
  1101
		(* interpretation * interpretation -> prop_formula *)
webertj@14807
  1102
		fun equal (i1, i2) =
webertj@14807
  1103
			(case i1 of
webertj@14807
  1104
			  Leaf xs =>
webertj@14807
  1105
				(case i2 of
webertj@14807
  1106
				  Leaf ys => PropLogic.dot_product (xs, ys)
webertj@14807
  1107
				| Node _  => raise REFUTE ("make_equality", "second interpretation is higher"))
webertj@14807
  1108
			| Node xs =>
webertj@14807
  1109
				(case i2 of
webertj@14807
  1110
				  Leaf _  => raise REFUTE ("make_equality", "first interpretation is higher")
webertj@14807
  1111
				| Node ys => PropLogic.all (map equal (xs ~~ ys))))
webertj@14807
  1112
		(* interpretation * interpretation -> prop_formula *)
webertj@14807
  1113
		fun not_equal (i1, i2) =
webertj@14807
  1114
			(case i1 of
webertj@14807
  1115
			  Leaf xs =>
webertj@14807
  1116
				(case i2 of
webertj@14807
  1117
				  Leaf ys => PropLogic.all ((PropLogic.exists xs) :: (PropLogic.exists ys) ::
webertj@14807
  1118
					(map (fn (x,y) => SOr (SNot x, SNot y)) (xs ~~ ys)))  (* defined and not equal *)
webertj@14807
  1119
				| Node _  => raise REFUTE ("make_equality", "second interpretation is higher"))
webertj@14807
  1120
			| Node xs =>
webertj@14807
  1121
				(case i2 of
webertj@14807
  1122
				  Leaf _  => raise REFUTE ("make_equality", "first interpretation is higher")
webertj@14807
  1123
				| Node ys => PropLogic.exists (map not_equal (xs ~~ ys))))
webertj@14350
  1124
	in
webertj@14807
  1125
		(* a value may be undefined; therefore 'not_equal' is not just the     *)
webertj@14807
  1126
		(* negation of 'equal':                                                *)
webertj@14807
  1127
		(* - two interpretations are 'equal' iff they are both defined and     *)
webertj@14807
  1128
		(*   denote the same value                                             *)
webertj@14807
  1129
		(* - two interpretations are 'not_equal' iff they are both defined at  *)
webertj@14807
  1130
		(*   least partially, and a defined part denotes different values      *)
webertj@14807
  1131
		(* - an undefined interpretation is neither 'equal' nor 'not_equal' to *)
webertj@14807
  1132
		(*   another value                                                     *)
webertj@14807
  1133
		Leaf [equal (i1, i2), not_equal (i1, i2)]
webertj@14807
  1134
	end;
webertj@14807
  1135
webertj@14807
  1136
webertj@14807
  1137
	(* theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) option *)
webertj@14807
  1138
webertj@14807
  1139
	(* simply typed lambda calculus: Isabelle's basic term syntax, with type  *)
webertj@14807
  1140
	(* variables, function types, and propT                                   *)
webertj@14807
  1141
webertj@14807
  1142
	fun stlc_interpreter thy model args t =
webertj@14807
  1143
	let
webertj@14807
  1144
		val (typs, terms)                           = model
webertj@14807
  1145
		val {maxvars, next_idx, bounds, wellformed} = args
webertj@14807
  1146
		(* Term.typ -> (interpretation * model * arguments) option *)
webertj@14807
  1147
		fun interpret_groundterm T =
webertj@14807
  1148
		let
webertj@14807
  1149
			(* unit -> (interpretation * model * arguments) option *)
webertj@14807
  1150
			fun interpret_groundtype () =
webertj@14807
  1151
			let
webertj@14807
  1152
				val size = (if T = Term.propT then 2 else (the o assoc) (typs, T))  (* the model MUST specify a size for ground types *)
webertj@14807
  1153
				val next = (if size=2 then next_idx+1 else next_idx+size)  (* optimization for types with size 2 *)
webertj@14807
  1154
				val _    = (if next-1>maxvars andalso maxvars>0 then raise MAXVARS_EXCEEDED else ())  (* check if 'maxvars' is large enough *)
webertj@14807
  1155
				(* prop_formula list *)
webertj@14807
  1156
				val fms  = (if size=2 then [BoolVar next_idx, Not (BoolVar next_idx)]
webertj@14807
  1157
					else (map BoolVar (next_idx upto (next_idx+size-1))))
webertj@14807
  1158
				(* interpretation *)
webertj@14807
  1159
				val intr = Leaf fms
webertj@14807
  1160
				(* prop_formula list -> prop_formula *)
webertj@14807
  1161
				fun one_of_two_false []      = True
webertj@14807
  1162
				  | one_of_two_false (x::xs) = SAnd (PropLogic.all (map (fn x' => SOr (SNot x, SNot x')) xs), one_of_two_false xs)
webertj@14807
  1163
				(* prop_formula list -> prop_formula *)
webertj@14807
  1164
				fun exactly_one_true xs = SAnd (PropLogic.exists xs, one_of_two_false xs)
webertj@14807
  1165
				(* prop_formula *)
webertj@14807
  1166
				val wf   = (if size=2 then True else exactly_one_true fms)
webertj@14807
  1167
			in
webertj@14807
  1168
				(* extend the model, increase 'next_idx', add well-formedness condition *)
webertj@14807
  1169
				Some (intr, (typs, (t, intr)::terms), {maxvars = maxvars, next_idx = next, bounds = bounds, wellformed = SAnd (wellformed, wf)})
webertj@14807
  1170
			end
webertj@14807
  1171
		in
webertj@14807
  1172
			case T of
webertj@14807
  1173
			  Type ("fun", [T1, T2]) =>
webertj@14807
  1174
				let
webertj@14807
  1175
					(* we create 'size_of_type (interpret (... T1))' different copies *)
webertj@14807
  1176
					(* of the interpretation for 'T2', which are then combined into a *)
webertj@14807
  1177
					(* single new interpretation                                      *)
webertj@14807
  1178
					val (i1, _, _) =
webertj@14807
  1179
						(interpret thy model {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", T1))
webertj@14807
  1180
						handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1181
					(* make fresh copies, with different variable indices *)
webertj@14807
  1182
					(* 'idx': next variable index                         *)
webertj@14807
  1183
					(* 'n'  : number of copies                            *)
webertj@14807
  1184
					(* int -> int -> (int * interpretation list * prop_formula *)
webertj@14807
  1185
					fun make_copies idx 0 =
webertj@14807
  1186
						(idx, [], True)
webertj@14807
  1187
					  | make_copies idx n =
webertj@14807
  1188
						let
webertj@14807
  1189
							val (copy, _, new_args) =
webertj@14807
  1190
								(interpret thy (typs, []) {maxvars = maxvars, next_idx = idx, bounds = [], wellformed = True} (Free ("dummy", T2))
webertj@14807
  1191
								handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1192
							val (idx', copies, wf') = make_copies (#next_idx new_args) (n-1)
webertj@14807
  1193
						in
webertj@14807
  1194
							(idx', copy :: copies, SAnd (#wellformed new_args, wf'))
webertj@14807
  1195
						end
webertj@14807
  1196
					val (next, copies, wf) = make_copies next_idx (size_of_type i1)
webertj@14807
  1197
					(* combine copies into a single interpretation *)
webertj@14807
  1198
					val intr = Node copies
webertj@14807
  1199
				in
webertj@14807
  1200
					(* extend the model, increase 'next_idx', add well-formedness condition *)
webertj@14807
  1201
					Some (intr, (typs, (t, intr)::terms), {maxvars = maxvars, next_idx = next, bounds = bounds, wellformed = SAnd (wellformed, wf)})
webertj@14807
  1202
				end
webertj@14807
  1203
			| Type _  => interpret_groundtype ()
webertj@14807
  1204
			| TFree _ => interpret_groundtype ()
webertj@14807
  1205
			| TVar  _ => interpret_groundtype ()
webertj@14807
  1206
		end
webertj@14807
  1207
	in
webertj@14807
  1208
		case assoc (terms, t) of
webertj@14807
  1209
		  Some intr =>
webertj@14807
  1210
			(* return an existing interpretation *)
webertj@14807
  1211
			Some (intr, model, args)
webertj@14807
  1212
		| None =>
webertj@14807
  1213
			(case t of
webertj@14807
  1214
			  Const (_, T)     =>
webertj@14807
  1215
				interpret_groundterm T
webertj@14807
  1216
			| Free (_, T)      =>
webertj@14807
  1217
				interpret_groundterm T
webertj@14807
  1218
			| Var (_, T)       =>
webertj@14807
  1219
				interpret_groundterm T
webertj@14807
  1220
			| Bound i          =>
webertj@14807
  1221
				Some (nth_elem (i, #bounds args), model, args)
webertj@14807
  1222
			| Abs (x, T, body) =>
webertj@14807
  1223
				let
webertj@14807
  1224
					(* create all constants of type 'T' *)
webertj@14807
  1225
					val (i, _, _) =
webertj@14807
  1226
						(interpret thy model {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", T))
webertj@14807
  1227
						handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1228
					val constants = make_constants i
webertj@14807
  1229
					(* interpret the 'body' separately for each constant *)
webertj@14807
  1230
					val ((model', args'), bodies) = foldl_map
webertj@14807
  1231
						(fn ((m,a), c) =>
webertj@14807
  1232
							let
webertj@14807
  1233
								(* add 'c' to 'bounds' *)
webertj@14807
  1234
								val (i', m', a') = interpret thy m {maxvars = #maxvars a, next_idx = #next_idx a, bounds = (c :: #bounds a), wellformed = #wellformed a} body
webertj@14807
  1235
							in
webertj@14807
  1236
								(* keep the new model m' and 'next_idx' and 'wellformed', but use old 'bounds' *)
webertj@14807
  1237
								((m', {maxvars = maxvars, next_idx = #next_idx a', bounds = bounds, wellformed = #wellformed a'}), i')
webertj@14807
  1238
							end)
webertj@14807
  1239
						((model, args), constants)
webertj@14807
  1240
				in
webertj@14807
  1241
					Some (Node bodies, model', args')
webertj@14807
  1242
				end
webertj@14807
  1243
			| t1 $ t2          =>
webertj@14807
  1244
				let
webertj@14807
  1245
					(* auxiliary functions *)
webertj@14807
  1246
					(* interpretation * interpretation -> interpretation *)
webertj@14807
  1247
					fun interpretation_disjunction (tr1,tr2) =
webertj@14807
  1248
						tree_map (fn (xs,ys) => map (fn (x,y) => SOr(x,y)) (xs ~~ ys)) (tree_pair (tr1,tr2))
webertj@14807
  1249
					(* prop_formula * interpretation -> interpretation *)
webertj@14807
  1250
					fun prop_formula_times_interpretation (fm,tr) =
webertj@14807
  1251
						tree_map (map (fn x => SAnd (fm,x))) tr
webertj@14807
  1252
					(* prop_formula list * interpretation list -> interpretation *)
webertj@14807
  1253
					fun prop_formula_list_dot_product_interpretation_list ([fm],[tr]) =
webertj@14807
  1254
						prop_formula_times_interpretation (fm,tr)
webertj@14807
  1255
					  | prop_formula_list_dot_product_interpretation_list (fm::fms,tr::trees) =
webertj@14807
  1256
						interpretation_disjunction (prop_formula_times_interpretation (fm,tr), prop_formula_list_dot_product_interpretation_list (fms,trees))
webertj@14807
  1257
					  | prop_formula_list_dot_product_interpretation_list (_,_) =
webertj@14807
  1258
						raise REFUTE ("stlc_interpreter", "empty list (in dot product)")
webertj@14807
  1259
					(* concatenates 'x' with every list in 'xss', returning a new list of lists *)
webertj@14807
  1260
					(* 'a -> 'a list list -> 'a list list *)
webertj@14807
  1261
					fun cons_list x xss =
webertj@14807
  1262
						map (fn xs => x::xs) xss
webertj@14807
  1263
					(* returns a list of lists, each one consisting of one element from each element of 'xss' *)
webertj@14807
  1264
					(* 'a list list -> 'a list list *)
webertj@14807
  1265
					fun pick_all [xs] =
webertj@14807
  1266
						map (fn x => [x]) xs
webertj@14807
  1267
					  | pick_all (xs::xss) =
webertj@14807
  1268
						let val rec_pick = pick_all xss in
webertj@14807
  1269
							foldl (fn (acc,x) => (cons_list x rec_pick) @ acc) ([],xs)
webertj@14807
  1270
						end
webertj@14807
  1271
					  | pick_all _ =
webertj@14807
  1272
						raise REFUTE ("stlc_interpreter", "empty list (in pick_all)")
webertj@14807
  1273
					(* interpretation -> prop_formula list *)
webertj@14807
  1274
					fun interpretation_to_prop_formula_list (Leaf xs) =
webertj@14807
  1275
						xs
webertj@14807
  1276
					  | interpretation_to_prop_formula_list (Node trees) =
webertj@14807
  1277
						map PropLogic.all (pick_all (map interpretation_to_prop_formula_list trees))
webertj@14807
  1278
					(* interpretation * interpretation -> interpretation *)
webertj@14807
  1279
					fun interpretation_apply (tr1,tr2) =
webertj@14807
  1280
						(case tr1 of
webertj@14807
  1281
						  Leaf _ =>
webertj@14807
  1282
							raise REFUTE ("stlc_interpreter", "first interpretation is a leaf")
webertj@14807
  1283
						| Node xs =>
webertj@14807
  1284
							prop_formula_list_dot_product_interpretation_list (interpretation_to_prop_formula_list tr2, xs))
webertj@14807
  1285
					(* interpret 't1' and 't2' separately *)
webertj@14807
  1286
					val (intr1, model1, args1) = interpret thy model args t1
webertj@14807
  1287
					val (intr2, model2, args2) = interpret thy model1 args1 t2
webertj@14807
  1288
				in
webertj@14807
  1289
					Some (interpretation_apply (intr1,intr2), model2, args2)
webertj@14807
  1290
				end)
webertj@14807
  1291
	end;
webertj@14807
  1292
webertj@14807
  1293
	(* theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) option *)
webertj@14807
  1294
webertj@14807
  1295
	fun Pure_interpreter thy model args t =
webertj@14456
  1296
		case t of
webertj@14807
  1297
		  Const ("all", _) $ t1 =>  (* in the meta-logic, 'all' MUST be followed by an argument term *)
webertj@14807
  1298
			let
webertj@14807
  1299
				val (i, m, a) = interpret thy model args t1
webertj@14807
  1300
			in
webertj@14807
  1301
				case i of
webertj@14807
  1302
				  Node xs =>
webertj@14807
  1303
					let
webertj@14807
  1304
						val fmTrue  = PropLogic.all (map toTrue xs)
webertj@14807
  1305
						val fmFalse = PropLogic.exists (map toFalse xs)
webertj@14807
  1306
					in
webertj@14807
  1307
						Some (Leaf [fmTrue, fmFalse], m, a)
webertj@14807
  1308
					end
webertj@14807
  1309
				| _ =>
webertj@14807
  1310
					raise REFUTE ("Pure_interpreter", "\"all\" is not followed by a function")
webertj@14807
  1311
			end
webertj@14807
  1312
		| Const ("==", _) $ t1 $ t2 =>
webertj@14807
  1313
			let
webertj@14807
  1314
				val (i1, m1, a1) = interpret thy model args t1
webertj@14807
  1315
				val (i2, m2, a2) = interpret thy m1 a1 t2
webertj@14807
  1316
			in
webertj@14807
  1317
				Some (make_equality (i1, i2), m2, a2)
webertj@14807
  1318
			end
webertj@14807
  1319
		| Const ("==>", _) =>  (* simpler than translating 'Const ("==>", _) $ t1 $ t2' *)
webertj@14807
  1320
			Some (Node [Node [TT, FF], Node [TT, TT]], model, args)
webertj@14807
  1321
		| _ => None;
webertj@14807
  1322
webertj@14807
  1323
	(* theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) option *)
webertj@14807
  1324
webertj@14807
  1325
	fun HOLogic_interpreter thy model args t =
webertj@14807
  1326
	let
webertj@14807
  1327
		(* Term.term -> int -> Term.term *)
webertj@14807
  1328
		fun eta_expand t i =
webertj@14807
  1329
		let
webertj@14807
  1330
			val Ts = binder_types (fastype_of t)
webertj@14807
  1331
		in
webertj@14807
  1332
			foldr (fn (T, t) => Abs ("<eta_expand>", T, t))
webertj@14807
  1333
				(take (i, Ts), list_comb (t, map Bound (i-1 downto 0)))
webertj@14807
  1334
		end
webertj@14807
  1335
	in
webertj@14807
  1336
	(* ------------------------------------------------------------------------- *)
webertj@14807
  1337
	(* Providing interpretations directly is more efficient than unfolding the   *)
webertj@14807
  1338
	(* logical constants.  IN HOL however, logical constants can themselves be   *)
webertj@14807
  1339
	(* arguments.  "All" and "Ex" are then translated just like any other        *)
webertj@14807
  1340
	(* constant, with the relevant axiom being added by 'collect_axioms'.        *)
webertj@14807
  1341
	(* ------------------------------------------------------------------------- *)
webertj@14807
  1342
		case t of
webertj@14807
  1343
		  Const ("Trueprop", _) =>
webertj@14807
  1344
			Some (Node [TT, FF], model, args)
webertj@14807
  1345
		| Const ("Not", _) =>
webertj@14807
  1346
			Some (Node [FF, TT], model, args)
webertj@14807
  1347
		| Const ("True", _) =>  (* redundant, since 'True' is also an IDT constructor *)
webertj@14807
  1348
			Some (TT, model, args)
webertj@14807
  1349
		| Const ("False", _) =>  (* redundant, since 'False' is also an IDT constructor *)
webertj@14807
  1350
			Some (FF, model, args)
webertj@14807
  1351
		| Const ("All", _) $ t1 =>
webertj@14350
  1352
			let
webertj@14807
  1353
				val (i, m, a) = interpret thy model args t1
webertj@14807
  1354
			in
webertj@14807
  1355
				case i of
webertj@14807
  1356
				  Node xs =>
webertj@14807
  1357
					let
webertj@14807
  1358
						val fmTrue  = PropLogic.all (map toTrue xs)
webertj@14807
  1359
						val fmFalse = PropLogic.exists (map toFalse xs)
webertj@14807
  1360
					in
webertj@14807
  1361
						Some (Leaf [fmTrue, fmFalse], m, a)
webertj@14807
  1362
					end
webertj@14807
  1363
				| _ =>
webertj@14807
  1364
					raise REFUTE ("HOLogic_interpreter", "\"All\" is not followed by a function")
webertj@14807
  1365
			end
webertj@14807
  1366
		| Const ("Ex", _) $ t1 =>
webertj@14807
  1367
			let
webertj@14807
  1368
				val (i, m, a) = interpret thy model args t1
webertj@14807
  1369
			in
webertj@14807
  1370
				case i of
webertj@14807
  1371
				  Node xs =>
webertj@14807
  1372
					let
webertj@14807
  1373
						val fmTrue  = PropLogic.exists (map toTrue xs)
webertj@14807
  1374
						val fmFalse = PropLogic.all (map toFalse xs)
webertj@14807
  1375
					in
webertj@14807
  1376
						Some (Leaf [fmTrue, fmFalse], m, a)
webertj@14807
  1377
					end
webertj@14807
  1378
				| _ =>
webertj@14807
  1379
					raise REFUTE ("HOLogic_interpreter", "\"Ex\" is not followed by a function")
webertj@14807
  1380
			end
webertj@14807
  1381
		| Const ("op =", _) $ t1 $ t2 =>
webertj@14807
  1382
			let
webertj@14807
  1383
				val (i1, m1, a1) = interpret thy model args t1
webertj@14807
  1384
				val (i2, m2, a2) = interpret thy m1 a1 t2
webertj@14807
  1385
			in
webertj@14807
  1386
				Some (make_equality (i1, i2), m2, a2)
webertj@14807
  1387
			end
webertj@14807
  1388
		| Const ("op =", _) $ t1 =>
webertj@14807
  1389
			(Some (interpret thy model args (eta_expand t 1)) handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1390
		| Const ("op =", _) =>
webertj@14807
  1391
			(Some (interpret thy model args (eta_expand t 2)) handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1392
		| Const ("op &", _) =>
webertj@14807
  1393
			Some (Node [Node [TT, FF], Node [FF, FF]], model, args)
webertj@14807
  1394
		| Const ("op |", _) =>
webertj@14807
  1395
			Some (Node [Node [TT, TT], Node [TT, FF]], model, args)
webertj@14807
  1396
		| Const ("op -->", _) =>
webertj@14807
  1397
			Some (Node [Node [TT, FF], Node [TT, TT]], model, args)
webertj@14807
  1398
		| _ => None
webertj@14807
  1399
	end;
webertj@14807
  1400
webertj@14807
  1401
	(* theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) option *)
webertj@14807
  1402
webertj@14807
  1403
	fun set_interpreter thy model args t =
webertj@14807
  1404
	(* "T set" is isomorphic to "T --> bool" *)
webertj@14807
  1405
	let
webertj@14807
  1406
		val (typs, terms) = model
webertj@14807
  1407
		(* Term.term -> int -> Term.term *)
webertj@14807
  1408
		fun eta_expand t i =
webertj@14807
  1409
		let
webertj@14807
  1410
			val Ts = binder_types (fastype_of t)
webertj@14807
  1411
		in
webertj@14807
  1412
			foldr (fn (T, t) => Abs ("<eta_expand>", T, t))
webertj@14807
  1413
				(take (i, Ts), list_comb (t, map Bound (i-1 downto 0)))
webertj@14807
  1414
		end
webertj@14807
  1415
	in
webertj@14807
  1416
		case assoc (terms, t) of
webertj@14807
  1417
		  Some intr =>
webertj@14807
  1418
			(* return an existing interpretation *)
webertj@14807
  1419
			Some (intr, model, args)
webertj@14807
  1420
		| None =>
webertj@14807
  1421
			(case t of
webertj@14807
  1422
			  Free (x, Type ("set", [T])) =>
webertj@14807
  1423
				(let
webertj@14807
  1424
					val (intr, _, args') = interpret thy (typs, []) args (Free (x, T --> HOLogic.boolT))
webertj@14807
  1425
				in
webertj@14807
  1426
					Some (intr, (typs, (t, intr)::terms), args')
webertj@14807
  1427
				end handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1428
			| Var ((x,i), Type ("set", [T])) =>
webertj@14807
  1429
				(let
webertj@14807
  1430
					val (intr, _, args') = interpret thy (typs, []) args (Var ((x,i), T --> HOLogic.boolT))
webertj@14807
  1431
				in
webertj@14807
  1432
					Some (intr, (typs, (t, intr)::terms), args')
webertj@14807
  1433
				end handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1434
			| Const (s, Type ("set", [T])) =>
webertj@14807
  1435
				(let
webertj@14807
  1436
					val (intr, _, args') = interpret thy (typs, []) args (Const (s, T --> HOLogic.boolT))
webertj@14807
  1437
				in
webertj@14807
  1438
					Some (intr, (typs, (t, intr)::terms), args')
webertj@14807
  1439
				end handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1440
			(* 'Collect' == identity *)
webertj@14807
  1441
			| Const ("Collect", _) $ t1 =>
webertj@14807
  1442
				Some (interpret thy model args t1)
webertj@14807
  1443
			| Const ("Collect", _) =>
webertj@14807
  1444
				(Some (interpret thy model args (eta_expand t 1)) handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1445
			(* 'op :' == application *)
webertj@14807
  1446
			| Const ("op :", _) $ t1 $ t2 =>
webertj@14807
  1447
				Some (interpret thy model args (t2 $ t1))
webertj@14807
  1448
			| Const ("op :", _) $ t1 =>
webertj@14807
  1449
				(Some (interpret thy model args (eta_expand t 1)) handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1450
			| Const ("op :", _) =>
webertj@14807
  1451
				(Some (interpret thy model args (eta_expand t 2)) handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1452
			| _ => None)
webertj@14807
  1453
	end;
webertj@14807
  1454
webertj@14807
  1455
	(* theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) option *)
webertj@14807
  1456
webertj@14807
  1457
	fun IDT_interpreter thy model args t =
webertj@14807
  1458
	let
webertj@14807
  1459
		val (typs, terms) = model
webertj@14807
  1460
		(* DatatypeAux.descr -> (DatatypeAux.dtyp * Term.typ) list -> DatatypeAux.dtyp -> Term.typ *)
webertj@14807
  1461
		fun typ_of_dtyp descr typ_assoc (DatatypeAux.DtTFree a) =
webertj@14807
  1462
			(* replace a 'DtTFree' variable by the associated type *)
webertj@14807
  1463
			(the o assoc) (typ_assoc, DatatypeAux.DtTFree a)
webertj@14807
  1464
		  | typ_of_dtyp descr typ_assoc (DatatypeAux.DtRec i) =
webertj@14807
  1465
			let
webertj@14807
  1466
				val (s, ds, _) = (the o assoc) (descr, i)
webertj@14807
  1467
			in
webertj@14807
  1468
				Type (s, map (typ_of_dtyp descr typ_assoc) ds)
webertj@14807
  1469
			end
webertj@14807
  1470
		  | typ_of_dtyp descr typ_assoc (DatatypeAux.DtType (s, ds)) =
webertj@14807
  1471
			Type (s, map (typ_of_dtyp descr typ_assoc) ds)
webertj@14807
  1472
		(* int list -> int *)
webertj@14807
  1473
		fun sum xs = foldl op+ (0, xs)
webertj@14807
  1474
		(* int list -> int *)
webertj@14807
  1475
		fun product xs = foldl op* (1, xs)
webertj@14807
  1476
		(* the size of an IDT is the sum (over its constructors) of the        *)
webertj@14807
  1477
		(* product (over their arguments) of the size of the argument type     *)
webertj@14807
  1478
		(* (Term.typ * int) list -> DatatypeAux.descr -> (DatatypeAux.dtyp * Term.typ) list -> (string * DatatypeAux.dtyp list) list -> int *)
webertj@14807
  1479
		fun size_of_dtyp typs descr typ_assoc constrs =
webertj@14807
  1480
			sum (map (fn (_, ds) =>
webertj@14807
  1481
				product (map (fn d =>
webertj@14807
  1482
					let
webertj@14807
  1483
						val T         = typ_of_dtyp descr typ_assoc d
webertj@14807
  1484
						val (i, _, _) =
webertj@14807
  1485
							(interpret thy (typs, []) {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", T))
webertj@14807
  1486
							handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1487
					in
webertj@14807
  1488
						size_of_type i
webertj@14807
  1489
					end) ds)) constrs)
webertj@14807
  1490
		(* Term.typ -> (interpretation * model * arguments) option *)
webertj@14807
  1491
		fun interpret_variable (Type (s, Ts)) =
webertj@14807
  1492
			(case DatatypePackage.datatype_info thy s of
webertj@14807
  1493
			  Some info =>  (* inductive datatype *)
webertj@14807
  1494
				let
webertj@14807
  1495
					val (typs, terms) = model
webertj@14807
  1496
					(* int option -- only recursive IDTs have an associated depth *)
webertj@14807
  1497
					val depth         = assoc (typs, Type (s, Ts))
webertj@14807
  1498
				in
webertj@14807
  1499
					if depth = (Some 0) then  (* termination condition to avoid infinite recursion *)
webertj@14807
  1500
						(* return a leaf of size 0 *)
webertj@14807
  1501
						Some (Leaf [], model, args)
webertj@14807
  1502
					else
webertj@14807
  1503
						let
webertj@14807
  1504
							val index               = #index info
webertj@14807
  1505
							val descr               = #descr info
webertj@14807
  1506
							val (_, dtyps, constrs) = (the o assoc) (descr, index)
webertj@14807
  1507
							val typ_assoc           = dtyps ~~ Ts
webertj@14807
  1508
							(* sanity check: every element in 'dtyps' must be a 'DtTFree' *)
webertj@14807
  1509
							val _ = (if Library.exists (fn d =>
webertj@14807
  1510
									case d of DatatypeAux.DtTFree _ => false | _ => true) dtyps
webertj@14807
  1511
								then
webertj@14807
  1512
									raise REFUTE ("IDT_interpreter", "datatype argument (for type " ^ Sign.string_of_typ (sign_of thy) (Type (s, Ts)) ^ ") is not a variable")
webertj@14807
  1513
								else
webertj@14807
  1514
									())
webertj@14807
  1515
							(* if the model specifies a depth for the current type, decrement it to avoid infinite recursion *)
webertj@14807
  1516
							val typs'    = (case depth of None => typs | Some n => overwrite (typs, (Type (s, Ts), n-1)))
webertj@14807
  1517
							(* recursively compute the size of the datatype *)
webertj@14807
  1518
							val size     = size_of_dtyp typs' descr typ_assoc constrs
webertj@14807
  1519
							val next_idx = #next_idx args
webertj@14807
  1520
							val next     = (if size=2 then next_idx+1 else next_idx+size)  (* optimization for types with size 2 *)
webertj@14807
  1521
							val _        = (if next-1>(#maxvars args) andalso (#maxvars args)>0 then raise MAXVARS_EXCEEDED else ())  (* check if 'maxvars' is large enough *)
webertj@14807
  1522
							(* prop_formula list *)
webertj@14807
  1523
							val fms      = (if size=2 then [BoolVar next_idx, Not (BoolVar next_idx)]
webertj@14807
  1524
								else (map BoolVar (next_idx upto (next_idx+size-1))))
webertj@14807
  1525
							(* interpretation *)
webertj@14807
  1526
							val intr     = Leaf fms
webertj@14807
  1527
							(* prop_formula list -> prop_formula *)
webertj@14807
  1528
							fun one_of_two_false []      = True
webertj@14807
  1529
							  | one_of_two_false (x::xs) = SAnd (PropLogic.all (map (fn x' => SOr (SNot x, SNot x')) xs), one_of_two_false xs)
webertj@14807
  1530
							(* prop_formula list -> prop_formula *)
webertj@14807
  1531
							fun exactly_one_true xs = SAnd (PropLogic.exists xs, one_of_two_false xs)
webertj@14807
  1532
							(* prop_formula *)
webertj@14807
  1533
							val wf       = (if size=2 then True else exactly_one_true fms)
webertj@14807
  1534
						in
webertj@14807
  1535
							(* extend the model, increase 'next_idx', add well-formedness condition *)
webertj@14807
  1536
							Some (intr, (typs, (t, intr)::terms), {maxvars = #maxvars args, next_idx = next, bounds = #bounds args, wellformed = SAnd (#wellformed args, wf)})
webertj@14807
  1537
						end
webertj@14807
  1538
				end
webertj@14807
  1539
			| None =>  (* not an inductive datatype *)
webertj@14807
  1540
				None)
webertj@14807
  1541
		  | interpret_variable _ =  (* a (free or schematic) type variable *)
webertj@14807
  1542
			None
webertj@14807
  1543
	in
webertj@14807
  1544
		case assoc (terms, t) of
webertj@14807
  1545
		  Some intr =>
webertj@14807
  1546
			(* return an existing interpretation *)
webertj@14807
  1547
			Some (intr, model, args)
webertj@14807
  1548
		| None =>
webertj@14807
  1549
			(case t of
webertj@14807
  1550
			  Free (_, T)  => interpret_variable T
webertj@14807
  1551
			| Var (_, T)   => interpret_variable T
webertj@14807
  1552
			| Const (s, T) =>
webertj@14807
  1553
				(* TODO: case, recursion, size *)
webertj@14807
  1554
				let
webertj@14807
  1555
					(* unit -> (interpretation * model * arguments) option *)
webertj@14807
  1556
					fun interpret_constructor () =
webertj@14807
  1557
						(case body_type T of
webertj@14807
  1558
						  Type (s', Ts') =>
webertj@14807
  1559
							(case DatatypePackage.datatype_info thy s' of
webertj@14807
  1560
							  Some info =>  (* body type is an inductive datatype *)
webertj@14807
  1561
								let
webertj@14807
  1562
									val index               = #index info
webertj@14807
  1563
									val descr               = #descr info
webertj@14807
  1564
									val (_, dtyps, constrs) = (the o assoc) (descr, index)
webertj@14807
  1565
									val typ_assoc           = dtyps ~~ Ts'
webertj@14807
  1566
									(* sanity check: every element in 'dtyps' must be a 'DtTFree' *)
webertj@14807
  1567
									val _ = (if Library.exists (fn d =>
webertj@14807
  1568
											case d of DatatypeAux.DtTFree _ => false | _ => true) dtyps
webertj@14807
  1569
										then
webertj@14807
  1570
											raise REFUTE ("IDT_interpreter", "datatype argument (for type " ^ Sign.string_of_typ (sign_of thy) (Type (s', Ts')) ^ ") is not a variable")
webertj@14807
  1571
										else
webertj@14807
  1572
											())
webertj@14807
  1573
									(* split the constructors into those occuring before/after 'Const (s, T)' *)
webertj@14807
  1574
									val (constrs1, constrs2) = take_prefix (fn (cname, ctypes) =>
webertj@14810
  1575
										not (cname = s andalso Type.typ_instance (Sign.tsig_of (sign_of thy)) (T,
webertj@14807
  1576
											map (typ_of_dtyp descr typ_assoc) ctypes ---> Type (s', Ts')))) constrs
webertj@14807
  1577
								in
webertj@14807
  1578
									case constrs2 of
webertj@14807
  1579
									  [] =>
webertj@14807
  1580
										(* 'Const (s, T)' is not a constructor of this datatype *)
webertj@14807
  1581
										None
webertj@14807
  1582
									| c::cs =>
webertj@14807
  1583
										let
webertj@14807
  1584
											(* int option -- only recursive IDTs have an associated depth *)
webertj@14807
  1585
											val depth = assoc (typs, Type (s', Ts'))
webertj@14807
  1586
											val typs' = (case depth of None => typs | Some n => overwrite (typs, (Type (s', Ts'), n-1)))
webertj@14807
  1587
											(* constructors before 'Const (s, T)' generate elements of the datatype *)
webertj@14807
  1588
											val offset  = size_of_dtyp typs' descr typ_assoc constrs1
webertj@14807
  1589
											(* 'Const (s, T)' and constructors after it generate elements of the datatype *)
webertj@14807
  1590
											val total   = offset + (size_of_dtyp typs' descr typ_assoc constrs2)
webertj@14807
  1591
											(* create an interpretation that corresponds to the constructor 'Const (s, T)' *)
webertj@14807
  1592
											(* by recursion over its argument types                                        *)
webertj@14807
  1593
											(* DatatypeAux.dtyp list -> interpretation *)
webertj@14807
  1594
											fun make_partial [] =
webertj@14807
  1595
												(* all entries of the leaf are 'False' *)
webertj@14807
  1596
												Leaf (replicate total False)
webertj@14807
  1597
											  | make_partial (d::ds) =
webertj@14807
  1598
												let
webertj@14807
  1599
													(* compute the "new" size of the type 'd' *)
webertj@14807
  1600
													val T         = typ_of_dtyp descr typ_assoc d
webertj@14807
  1601
													val (i, _, _) =
webertj@14807
  1602
														(interpret thy (typs, []) {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", T))
webertj@14807
  1603
														handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1604
												in
webertj@14807
  1605
													(* all entries of the whole subtree are 'False' *)
webertj@14807
  1606
													Node (replicate (size_of_type i) (make_partial ds))
webertj@14807
  1607
												end
webertj@14807
  1608
											(* int * DatatypeAux.dtyp list -> int * interpretation *)
webertj@14807
  1609
											fun make_constr (offset, []) =
webertj@14807
  1610
												if offset<total then
webertj@14807
  1611
													(offset+1, Leaf ((replicate offset False) @ True :: (replicate (total-offset-1) False)))
webertj@14807
  1612
												else
webertj@14807
  1613
													raise REFUTE ("IDT_interpreter", "internal error: offset >= total")
webertj@14807
  1614
											  | make_constr (offset, d::ds) =
webertj@14807
  1615
												let
webertj@14807
  1616
													(* compute the "new" and "old" size of the type 'd' *)
webertj@14807
  1617
													val T         = typ_of_dtyp descr typ_assoc d
webertj@14807
  1618
													val (i, _, _) =
webertj@14807
  1619
														(interpret thy (typs, []) {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", T))
webertj@14807
  1620
														handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1621
													val (i', _, _) =
webertj@14807
  1622
														(interpret thy (typs', []) {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", T))
webertj@14807
  1623
														handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1624
													val size  = size_of_type i
webertj@14807
  1625
													val size' = size_of_type i'
webertj@14807
  1626
													val _ = if size<size' then
webertj@14807
  1627
															raise REFUTE ("IDT_interpreter", "internal error: new size < old size")
webertj@14807
  1628
														else
webertj@14807
  1629
															()
webertj@14807
  1630
													val (new_offset, intrs) = foldl_map make_constr (offset, replicate size' ds)
webertj@14807
  1631
												in
webertj@14807
  1632
													(* the first size' elements of the type actually yield a result *)
webertj@14807
  1633
													(* element, while the remaining size-size' elements don't       *)
webertj@14807
  1634
													(new_offset, Node (intrs @ (replicate (size-size') (make_partial ds))))
webertj@14807
  1635
												end
webertj@14807
  1636
										in
webertj@14807
  1637
											Some ((snd o make_constr) (offset, snd c), model, args)
webertj@14807
  1638
										end
webertj@14807
  1639
								end
webertj@14807
  1640
							| None =>  (* body type is not an inductive datatype *)
webertj@14807
  1641
								None)
webertj@14807
  1642
						| _ =>  (* body type is a (free or schematic) type variable *)
webertj@14807
  1643
							None)
webertj@14807
  1644
				in
webertj@14807
  1645
					case interpret_constructor () of
webertj@14807
  1646
					  Some x => Some x
webertj@14807
  1647
					| None   => interpret_variable T
webertj@14807
  1648
				end
webertj@14807
  1649
			| _ => None)
webertj@14807
  1650
	end;
webertj@14807
  1651
webertj@14807
  1652
	(* theory -> model -> arguments -> Term.term -> (interpretation * model * arguments) option *)
webertj@14807
  1653
webertj@14807
  1654
	(* only an optimization: 'card' could in principle be interpreted with    *)
webertj@14807
  1655
	(* interpreters available already (using its definition), but the code    *)
webertj@14807
  1656
	(* below is much more efficient                                           *)
webertj@14807
  1657
webertj@14807
  1658
	fun Finite_Set_card_interpreter thy model args t =
webertj@14807
  1659
		case t of
webertj@14807
  1660
		  Const ("Finite_Set.card", Type ("fun", [Type ("set", [T]), Type ("nat", [])])) =>
webertj@14807
  1661
			let
webertj@14807
  1662
				val (i_nat, _, _) =
webertj@14807
  1663
					(interpret thy model {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", Type ("nat", [])))
webertj@14807
  1664
						handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1665
				val size_nat      = size_of_type i_nat
webertj@14807
  1666
				val (i_set, _, _) =
webertj@14807
  1667
					(interpret thy model {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", Type ("set", [T])))
webertj@14807
  1668
						handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1669
				val constants     = make_constants i_set
webertj@14807
  1670
				(* interpretation -> int *)
webertj@14807
  1671
				fun number_of_elements (Node xs) =
webertj@14807
  1672
					foldl (fn (n, x) =>
webertj@14807
  1673
						if x=TT then n+1 else if x=FF then n else raise REFUTE ("Finite_Set_card_interpreter", "interpretation for set type does not yield a Boolean")) (0, xs)
webertj@14807
  1674
				  | number_of_elements (Leaf _) =
webertj@14807
  1675
					raise REFUTE ("Finite_Set_card_interpreter", "interpretation for set type is a leaf")
webertj@14807
  1676
				(* takes an interpretation for a set and returns an interpretation for a 'nat' *)
webertj@14807
  1677
				(* interpretation -> interpretation *)
webertj@14807
  1678
				fun card i =
webertj@14807
  1679
					let
webertj@14807
  1680
						val n = number_of_elements i
webertj@14807
  1681
					in
webertj@14807
  1682
						if n<size_nat then
webertj@14807
  1683
							Leaf ((replicate n False) @ True :: (replicate (size_nat-n-1) False))
webertj@14456
  1684
						else
webertj@14807
  1685
							Leaf (replicate size_nat False)
webertj@14807
  1686
					end
webertj@14350
  1687
			in
webertj@14807
  1688
				Some (Node (map card constants), model, args)
webertj@14350
  1689
			end
webertj@14807
  1690
		| _ =>
webertj@14807
  1691
			None;
webertj@14807
  1692
webertj@14807
  1693
webertj@14807
  1694
(* ------------------------------------------------------------------------- *)
webertj@14807
  1695
(* PRINTERS                                                                  *)
webertj@14807
  1696
(* ------------------------------------------------------------------------- *)
webertj@14807
  1697
webertj@14807
  1698
	(* theory -> model -> Term.term -> interpretation -> (int -> bool) -> Term.term option *)
webertj@14807
  1699
webertj@14807
  1700
	fun stlc_printer thy model t intr assignment =
webertj@14807
  1701
	let
webertj@14807
  1702
		(* Term.term -> Term.typ option *)
webertj@14807
  1703
		fun typeof (Free (_, T))  = Some T
webertj@14807
  1704
		  | typeof (Var (_, T))   = Some T
webertj@14807
  1705
		  | typeof (Const (_, T)) = Some T
webertj@14807
  1706
		  | typeof _              = None
webertj@14807
  1707
		(* string -> string *)
webertj@14807
  1708
		fun strip_leading_quote s =
webertj@14807
  1709
			(implode o (fn ss => case ss of [] => [] | x::xs => if x="'" then xs else ss) o explode) s
webertj@14807
  1710
		(* Term.typ -> string *)
webertj@14807
  1711
		fun string_of_typ (Type (s, _))     = s
webertj@14807
  1712
		  | string_of_typ (TFree (x, _))    = strip_leading_quote x
webertj@14807
  1713
		  | string_of_typ (TVar ((x,i), _)) = strip_leading_quote x ^ string_of_int i
webertj@14807
  1714
		(* interpretation -> int *)
webertj@14807
  1715
		fun index_from_interpretation (Leaf xs) =
webertj@14350
  1716
			let
webertj@14807
  1717
				val idx = find_index (PropLogic.eval assignment) xs
webertj@14350
  1718
			in
webertj@14807
  1719
				if idx<0 then
webertj@14807
  1720
					raise REFUTE ("stlc_printer", "illegal interpretation: no value assigned (SAT solver unsound?)")
webertj@14807
  1721
				else
webertj@14807
  1722
					idx
webertj@14350
  1723
			end
webertj@14807
  1724
		  | index_from_interpretation _ =
webertj@14807
  1725
			raise REFUTE ("stlc_printer", "interpretation for ground type is not a leaf")
webertj@14807
  1726
	in
webertj@14807
  1727
		case typeof t of
webertj@14807
  1728
		  Some T =>
webertj@14807
  1729
			(case T of
webertj@14807
  1730
			  Type ("fun", [T1, T2]) =>
webertj@14807
  1731
				(let
webertj@14807
  1732
					(* create all constants of type 'T1' *)
webertj@14807
  1733
					val (i, _, _) = interpret thy model {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", T1))
webertj@14807
  1734
					val constants = make_constants i
webertj@14807
  1735
					(* interpretation list *)
webertj@14807
  1736
					val results = (case intr of
webertj@14807
  1737
						  Node xs => xs
webertj@14807
  1738
						| _       => raise REFUTE ("stlc_printer", "interpretation for function type is a leaf"))
webertj@14807
  1739
					(* Term.term list *)
webertj@14807
  1740
					val pairs = map (fn (arg, result) =>
webertj@14807
  1741
						HOLogic.mk_prod
webertj@14807
  1742
							(print thy model (Free ("dummy", T1)) arg assignment,
webertj@14807
  1743
							 print thy model (Free ("dummy", T2)) result assignment))
webertj@14807
  1744
						(constants ~~ results)
webertj@14807
  1745
					(* Term.typ *)
webertj@14807
  1746
					val HOLogic_prodT = HOLogic.mk_prodT (T1, T2)
webertj@14807
  1747
					val HOLogic_setT  = HOLogic.mk_setT HOLogic_prodT
webertj@14807
  1748
					(* Term.term *)
webertj@14807
  1749
					val HOLogic_empty_set = Const ("{}", HOLogic_setT)
webertj@14807
  1750
					val HOLogic_insert    = Const ("insert", HOLogic_prodT --> HOLogic_setT --> HOLogic_setT)
webertj@14807
  1751
				in
webertj@14807
  1752
					Some (foldr (fn (pair, acc) => HOLogic_insert $ pair $ acc) (pairs, HOLogic_empty_set))
webertj@14807
  1753
				end handle CANNOT_INTERPRET _ => None)
webertj@14807
  1754
			| Type ("prop", [])      =>
webertj@14807
  1755
				(case index_from_interpretation intr of
webertj@14807
  1756
				  0 => Some (HOLogic.mk_Trueprop HOLogic.true_const)
webertj@14807
  1757
				| 1 => Some (HOLogic.mk_Trueprop HOLogic.false_const)
webertj@14807
  1758
				| _ => raise REFUTE ("stlc_interpreter", "illegal interpretation for a propositional value"))
webertj@14807
  1759
			| Type _  => Some (Const (string_of_typ T ^ string_of_int (index_from_interpretation intr), T))
webertj@14807
  1760
			| TFree _ => Some (Const (string_of_typ T ^ string_of_int (index_from_interpretation intr), T))
webertj@14807
  1761
			| TVar _  => Some (Const (string_of_typ T ^ string_of_int (index_from_interpretation intr), T)))
webertj@14807
  1762
		| None =>
webertj@14807
  1763
			None
webertj@14350
  1764
	end;
webertj@14350
  1765
webertj@14456
  1766
	(* theory -> model -> Term.term -> interpretation -> (int -> bool) -> string option *)
webertj@14350
  1767
webertj@14807
  1768
	fun set_printer thy model t intr assignment =
webertj@14807
  1769
	let
webertj@14807
  1770
		(* Term.term -> Term.typ option *)
webertj@14807
  1771
		fun typeof (Free (_, T))  = Some T
webertj@14807
  1772
		  | typeof (Var (_, T))   = Some T
webertj@14807
  1773
		  | typeof (Const (_, T)) = Some T
webertj@14807
  1774
		  | typeof _              = None
webertj@14807
  1775
	in
webertj@14807
  1776
		case typeof t of
webertj@14807
  1777
		  Some (Type ("set", [T])) =>
webertj@14807
  1778
			(let
webertj@14807
  1779
				(* create all constants of type 'T' *)
webertj@14807
  1780
				val (i, _, _) = interpret thy model {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", T))
webertj@14807
  1781
				val constants = make_constants i
webertj@14807
  1782
				(* interpretation list *)
webertj@14807
  1783
				val results = (case intr of
webertj@14807
  1784
					  Node xs => xs
webertj@14807
  1785
					| _       => raise REFUTE ("set_printer", "interpretation for set type is a leaf"))
webertj@14807
  1786
				(* Term.term list *)
webertj@14807
  1787
				val elements = mapfilter (fn (arg, result) =>
webertj@14807
  1788
					case result of
webertj@14807
  1789
					  Leaf [fmTrue, fmFalse] =>
webertj@14807
  1790
						if PropLogic.eval assignment fmTrue then
webertj@14807
  1791
							Some (print thy model (Free ("dummy", T)) arg assignment)
webertj@14807
  1792
						else if PropLogic.eval assignment fmFalse then
webertj@14807
  1793
							None
webertj@14807
  1794
						else
webertj@14807
  1795
							raise REFUTE ("set_printer", "illegal interpretation: no value assigned (SAT solver unsound?)")
webertj@14807
  1796
					| _ =>
webertj@14807
  1797
						raise REFUTE ("set_printer", "illegal interpretation for a Boolean value"))
webertj@14807
  1798
					(constants ~~ results)
webertj@14807
  1799
				(* Term.typ *)
webertj@14807
  1800
				val HOLogic_setT  = HOLogic.mk_setT T
webertj@14807
  1801
				(* Term.term *)
webertj@14807
  1802
				val HOLogic_empty_set = Const ("{}", HOLogic_setT)
webertj@14807
  1803
				val HOLogic_insert    = Const ("insert", T --> HOLogic_setT --> HOLogic_setT)
webertj@14807
  1804
			in
webertj@14807
  1805
				Some (foldl (fn (acc, elem) => HOLogic_insert $ elem $ acc) (HOLogic_empty_set, elements))
webertj@14807
  1806
			end handle CANNOT_INTERPRET _ => None)
webertj@14456
  1807
		| _ =>
webertj@14807
  1808
			None
webertj@14807
  1809
	end;
webertj@14350
  1810
webertj@14807
  1811
	(* theory -> model -> Term.term -> interpretation -> (int -> bool) -> Term.term option *)
webertj@14350
  1812
webertj@14807
  1813
	fun IDT_printer thy model t intr assignment =
webertj@14350
  1814
	let
webertj@14807
  1815
		(* Term.term -> Term.typ option *)
webertj@14807
  1816
		fun typeof (Free (_, T))  = Some T
webertj@14807
  1817
		  | typeof (Var (_, T))   = Some T
webertj@14807
  1818
		  | typeof (Const (_, T)) = Some T
webertj@14807
  1819
		  | typeof _              = None
webertj@14350
  1820
	in
webertj@14807
  1821
		case typeof t of
webertj@14807
  1822
		  Some (Type (s, Ts)) =>
webertj@14807
  1823
			(case DatatypePackage.datatype_info thy s of
webertj@14807
  1824
			  Some info =>  (* inductive datatype *)
webertj@14807
  1825
				let
webertj@14807
  1826
					val (typs, _)           = model
webertj@14807
  1827
					val index               = #index info
webertj@14807
  1828
					val descr               = #descr info
webertj@14807
  1829
					val (_, dtyps, constrs) = (the o assoc) (descr, index)
webertj@14807
  1830
					val typ_assoc           = dtyps ~~ Ts
webertj@14807
  1831
					(* sanity check: every element in 'dtyps' must be a 'DtTFree' *)
webertj@14807
  1832
					val _ = (if Library.exists (fn d =>
webertj@14807
  1833
							case d of DatatypeAux.DtTFree _ => false | _ => true) dtyps
webertj@14807
  1834
						then
webertj@14807
  1835
							raise REFUTE ("IDT_printer", "datatype argument (for type " ^ Sign.string_of_typ (sign_of thy) (Type (s, Ts)) ^ ") is not a variable")
webertj@14807
  1836
						else
webertj@14807
  1837
							())
webertj@14807
  1838
					(* the index of the element in the datatype *)
webertj@14807
  1839
					val element = (case intr of
webertj@14807
  1840
						  Leaf xs => find_index (PropLogic.eval assignment) xs
webertj@14807
  1841
						| Node _  => raise REFUTE ("IDT_printer", "interpretation is not a leaf"))
webertj@14807
  1842
					val _ = (if element<0 then raise REFUTE ("IDT_printer", "invalid interpretation (no value assigned)") else ())
webertj@14807
  1843
					(* int option -- only recursive IDTs have an associated depth *)
webertj@14807
  1844
					val depth = assoc (typs, Type (s, Ts))
webertj@14807
  1845
					val typs' = (case depth of None => typs | Some n => overwrite (typs, (Type (s, Ts), n-1)))
webertj@14807
  1846
					(* DatatypeAux.descr -> (DatatypeAux.dtyp * Term.typ) list -> DatatypeAux.dtyp -> Term.typ *)
webertj@14807
  1847
					fun typ_of_dtyp descr typ_assoc (DatatypeAux.DtTFree a) =
webertj@14807
  1848
						(* replace a 'DtTFree' variable by the associated type *)
webertj@14807
  1849
						(the o assoc) (typ_assoc, DatatypeAux.DtTFree a)
webertj@14807
  1850
					  | typ_of_dtyp descr typ_assoc (DatatypeAux.DtRec i) =
webertj@14807
  1851
						let
webertj@14807
  1852
							val (s, ds, _) = (the o assoc) (descr, i)
webertj@14807
  1853
						in
webertj@14807
  1854
							Type (s, map (typ_of_dtyp descr typ_assoc) ds)
webertj@14807
  1855
						end
webertj@14807
  1856
					  | typ_of_dtyp descr typ_assoc (DatatypeAux.DtType (s, ds)) =
webertj@14807
  1857
						Type (s, map (typ_of_dtyp descr typ_assoc) ds)
webertj@14807
  1858
					(* int list -> int *)
webertj@14807
  1859
					fun sum xs = foldl op+ (0, xs)
webertj@14807
  1860
					(* int list -> int *)
webertj@14807
  1861
					fun product xs = foldl op* (1, xs)
webertj@14807
  1862
					(* the size of an IDT is the sum (over its constructors) of the        *)
webertj@14807
  1863
					(* product (over their arguments) of the size of the argument type     *)
webertj@14807
  1864
					(* (Term.typ * int) list -> DatatypeAux.descr -> (DatatypeAux.dtyp * Term.typ) list -> (string * DatatypeAux.dtyp list) list -> int *)
webertj@14807
  1865
					fun size_of_dtyp typs descr typ_assoc xs =
webertj@14807
  1866
						sum (map (fn (_, ds) =>
webertj@14807
  1867
							product (map (fn d =>
webertj@14807
  1868
								let
webertj@14807
  1869
									val T         = typ_of_dtyp descr typ_assoc d
webertj@14807
  1870
									val (i, _, _) =
webertj@14807
  1871
										(interpret thy (typs, []) {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", T))
webertj@14807
  1872
										handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14456
  1873
					in
webertj@14807
  1874
						size_of_type i
webertj@14807
  1875
					end) ds)) xs)
webertj@14807
  1876
					(* int -> DatatypeAux.dtyp list -> Term.term list *)
webertj@14807
  1877
					fun make_args n [] =
webertj@14807
  1878
						if n<>0 then
webertj@14807
  1879
							raise REFUTE ("IDT_printer", "error computing the element: remainder is not 0")
webertj@14456
  1880
						else
webertj@14807
  1881
							[]
webertj@14807
  1882
					  | make_args n (d::ds) =
webertj@14350
  1883
						let
webertj@14807
  1884
							val dT        = typ_of_dtyp descr typ_assoc d
webertj@14807
  1885
							val (i, _, _) =
webertj@14807
  1886
								(interpret thy (typs', []) {maxvars=0, next_idx=1, bounds=[], wellformed=True} (Free ("dummy", dT))
webertj@14807
  1887
								handle CANNOT_INTERPRET _ => raise CANNOT_INTERPRET t)
webertj@14807
  1888
							val size      = size_of_type i
webertj@14807
  1889
							val consts    = make_constants i  (* we only need the (n mod size)-th element of *)
webertj@14807
  1890
								(* this list, so there might be a more efficient implementation that does not *)
webertj@14807
  1891
								(* generate all constants                                                     *)
webertj@14807
  1892
						in
webertj@14807
  1893
							(print thy (typs', []) (Free ("dummy", dT)) (nth_elem (n mod size, consts)) assignment)::(make_args (n div size) ds)
webertj@14807
  1894
						end
webertj@14807
  1895
					(* int -> (string * DatatypeAux.dtyp list) list -> Term.term *)
webertj@14807
  1896
					fun make_term _ [] =
webertj@14807
  1897
						raise REFUTE ("IDT_printer", "invalid interpretation (value too large - not enough constructors)")
webertj@14807
  1898
					  | make_term n (c::cs) =
webertj@14807
  1899
						let
webertj@14807
  1900
							val c_size = size_of_dtyp typs' descr typ_assoc [c]
webertj@14807
  1901
						in
webertj@14807
  1902
							if n<c_size then
webertj@14456
  1903
								let
webertj@14807
  1904
									val (cname, cargs) = c
webertj@14807
  1905
									val c_term = Const (cname, (map (typ_of_dtyp descr typ_assoc) cargs) ---> Type (s, Ts))
webertj@14456
  1906
								in
webertj@14807
  1907
									foldl op$ (c_term, rev (make_args n (rev cargs)))
webertj@14456
  1908
								end
webertj@14807
  1909
							else
webertj@14807
  1910
								make_term (n-c_size) cs
webertj@14350
  1911
						end
webertj@14807
  1912
				in
webertj@14807
  1913
					Some (make_term element constrs)
webertj@14807
  1914
				end
webertj@14807
  1915
			| None =>  (* not an inductive datatype *)
webertj@14807
  1916
				None)
webertj@14807
  1917
		| _ =>  (* a (free or schematic) type variable *)
webertj@14456
  1918
			None
webertj@14350
  1919
	end;
webertj@14350
  1920
webertj@14350
  1921
webertj@14350
  1922
(* ------------------------------------------------------------------------- *)
webertj@14456
  1923
(* use 'setup Refute.setup' in an Isabelle theory to initialize the 'Refute' *)
webertj@14456
  1924
(* structure                                                                 *)
webertj@14350
  1925
(* ------------------------------------------------------------------------- *)
webertj@14350
  1926
webertj@14350
  1927
(* ------------------------------------------------------------------------- *)
webertj@14456
  1928
(* Note: the interpreters and printers are used in reverse order; however,   *)
webertj@14456
  1929
(*       an interpreter that can handle non-atomic terms ends up being       *)
webertj@14807
  1930
(*       applied before the 'stlc_interpreter' breaks the term apart into    *)
webertj@14807
  1931
(*       subterms that are then passed to other interpreters!                *)
webertj@14350
  1932
(* ------------------------------------------------------------------------- *)
webertj@14350
  1933
webertj@14456
  1934
	(* (theory -> theory) list *)
webertj@14350
  1935
webertj@14456
  1936
	val setup =
webertj@14456
  1937
		[RefuteData.init,
webertj@14807
  1938
		 add_interpreter "stlc"            stlc_interpreter,
webertj@14807
  1939
		 add_interpreter "Pure"            Pure_interpreter,
webertj@14807
  1940
		 add_interpreter "HOLogic"         HOLogic_interpreter,
webertj@14807
  1941
		 add_interpreter "set"             set_interpreter,
webertj@14807
  1942
		 add_interpreter "IDT"             IDT_interpreter,
webertj@14807
  1943
		 add_interpreter "Finite_Set.card" Finite_Set_card_interpreter,
webertj@14807
  1944
		 add_printer "stlc" stlc_printer,
webertj@14807
  1945
		 add_printer "set"  set_printer,
webertj@14807
  1946
		 add_printer "IDT"  IDT_printer];
webertj@14350
  1947
webertj@14350
  1948
end