Datasets:
Tasks:
Text Generation
Modalities:
Text
Sub-tasks:
language-modeling
Languages:
English
Size:
100K - 1M
License:
File size: 7,491 Bytes
4365a98 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 |
(* ========================================================================= *)
(* Isabelle Light *)
(* Isabelle/Procedural style additions and other user-friendly shortcuts. *)
(* *)
(* Petros Papapanagiotou, Jacques Fleuriot *)
(* Center of Intelligent Systems and their Applications *)
(* University of Edinburgh *)
(* 2009-2015 *)
(* ========================================================================= *)
(* FILE : support.ml *)
(* DESCRIPTION : Support functions and various shortcuts. *)
(* ========================================================================= *)
(* ------------------------------------------------------------------------- *)
(* Functions to deal with triplets: *)
(* ------------------------------------------------------------------------- *)
let fst3 (x,_,_) = x;;
let snd3 (_,x,_) = x;;
let thd3 (_,_,x) = x;;
(* ------------------------------------------------------------------------- *)
(* terms_match: term list -> term -> term list -> instantiation *)
(* Tries to apply term_match to the first possible term in a list. *)
(* Returns the instantiation. *)
(* ------------------------------------------------------------------------- *)
let (terms_match: term list -> term -> term list -> instantiation ) =
fun consts key tlist ->
try (tryfind (term_match consts key) tlist)
with Failure _ -> failwith "terms_match: No terms match!";;
(* ------------------------------------------------------------------------- *)
(* try_type: hol_type -> term -> term *)
(* Tries to instantiate a term to the given type. Returns the original term *)
(* upon failure. *)
(* ------------------------------------------------------------------------- *)
let try_type tp tm =
try inst (type_match (type_of tm) tp []) tm
with Failure _ -> tm;;
(* ------------------------------------------------------------------------- *)
(* thm_mk_primed_vars: term list -> thm -> thm *)
(* Renames all free variables in a theorem to avoid specified and constant *)
(* names. *)
(* ------------------------------------------------------------------------- *)
let thm_mk_primed_vars avoids thm =
let fvars = thm_frees thm in
let new_vars = map (mk_primed_var avoids) fvars in
let insts = List.combine new_vars fvars in
INST insts thm;;
(* ------------------------------------------------------------------------- *)
(* gl_frees: goal -> term list *)
(* Finds the free variables in a subgoal (assumptions and goal). *)
(* ------------------------------------------------------------------------- *)
let gl_frees : goal -> term list =
fun (asl,w) -> itlist (union o thm_frees o snd) asl (frees w);;
(* ------------------------------------------------------------------------- *)
(* ADD_HYP: thm -> thm -> thm *)
(* Trivially adds the hypotheses of a theorem to the premises of another. *)
(* ------------------------------------------------------------------------- *)
(* (+) Used in the justification of erule and drule to add the eliminated *)
(* assumption to the proven subgoals. *)
(* (+) Could have been based on ADD_ASSUM but it's more convenient this way. *)
(* ------------------------------------------------------------------------- *)
let ADD_HYP hyp_thm thm = CONJUNCT2 (CONJ hyp_thm thm);;
(* ------------------------------------------------------------------------- *)
(* DISCHL: term list -> thm -> thm *)
(* Applies DISCH for several terms. *)
(* ------------------------------------------------------------------------- *)
let rec (DISCHL: term list -> thm -> thm) =
fun tms thm ->
if (tms = []) then thm
else DISCH (hd tms) (DISCHL (tl tms) thm);;
(* ------------------------------------------------------------------------- *)
(* top_metas : goalstack -> term list *)
(* Returns the list of metavariables in the current goalstate. *)
(* ------------------------------------------------------------------------- *)
let top_metas (gs:goalstack) = (fst o (fun (x,_,_) -> x) o hd) gs;;
(* ------------------------------------------------------------------------- *)
(* print_varandtype, show_types, hide_types: *)
(* Prints the type after each variable. Useful for "debugging" type issues. *)
(* ------------------------------------------------------------------------- *)
(* Source: *)
(* http://code.google.com/p/flyspeck/wiki/TipsAndTricks#Investigating_Types *)
(* ------------------------------------------------------------------------- *)
let print_varandtype fmt tm =
let hop,args = strip_comb tm in
let s = name_of hop
and ty = type_of hop in
if is_var hop & args = [] then
(pp_print_string fmt "(";
pp_print_string fmt s;
pp_print_string fmt ":";
pp_print_type fmt ty;
pp_print_string fmt ")")
else fail() ;;
let show_types,hide_types =
(fun () -> install_user_printer ("Show Types",print_varandtype)),
(fun () -> try delete_user_printer "Show Types"
with Failure _ -> failwith ("hide_types: "^
"Types are already hidden."));;
(* ------------------------------------------------------------------------- *)
(* print_goalstack : *)
(* Upgrade to print_goalstack that also prints a list of metavariables with *)
(* their types. *)
(* ------------------------------------------------------------------------- *)
let (print_goalstack_meta:goalstack->unit) =
let print_goalstate k gs =
let ((mvs,_),gl,_) = gs in
let n = length gl in
let s = if n = 0 then "No subgoals" else
(string_of_int k)^" subgoal"^(if k > 1 then "s" else "")
^" ("^(string_of_int n)^" total)" in
let print_mv v = print_string " `" ; print_varandtype std_formatter v ; print_string "`;" in
print_string s; print_newline();
if (length mvs > 0) then (
print_string "Metas:" ; let _ = map print_mv mvs in () ; print_newline()
) ;
if gl = [] then () else
do_list (print_goal o C el gl) (rev(0--(k-1))) in
fun l ->
if l = [] then print_string "Empty goalstack"
else if tl l = [] then
let (_,gl,_ as gs) = hd l in
print_goalstate 1 gs
else
let (_,gl,_ as gs) = hd l
and (_,gl0,_) = hd(tl l) in
let p = length gl - length gl0 in
let p' = if p < 1 then 1 else p + 1 in
print_goalstate p' gs;;
#install_printer print_goalstack_meta;;
|