wneuper/isa: src/Tools/isac/ProgLang/Prog

     1 (* title:  ProgLang/Prog_Expr.thy

     2            functions for expressions (which do NOT contain Prog_Tac and Tactical, by definition))

     3    author: Walther Neuper, Aug.2019

     4    (c) copyright due to lincense terms.

     5 *)

     7 theory Prog_Expr

     8   imports Calculate ListC Program

     9 begin

    11 text \<open>Abstract:

    12   Specific constants are defined for pre-conditions of programs and for program-expressions.

    13   The constants are connected with ML functions for evaluation of respective expressions

    14   (all named eval_*), such that Isac's rewrite engine can handle it.

    15 \<close>

    17 subsection \<open>Power re-defined for a specific type\<close>

    18 abbreviation real_powr :: "real \<Rightarrow> real \<Rightarrow> real"  (infixr "\<up>" 80)

    19 where "x \<up> a \<equiv> x powr a"

    21 subsection \<open>consts of functions in pre-conditions and program-expressions\<close>

    22 consts

    23   lhs             :: "bool => real"           (*of an equality*)

    24   rhs             :: "bool => real"           (*of an equality*)

    25   Vars            :: "'a => real list"        (*get the variables of a term *)

    26   matches         :: "['a, 'a] => bool"

    27   matchsub        :: "['a, 'a] => bool"

    28   some_occur_in  :: "[real list, 'a] => bool" ("some'_of _ occur'_in _")

    29   occurs_in       :: "[real     , 'a] => bool" ("_ occurs'_in _")

    31   abs              :: "real => real"            ("(|| _ ||)")

    32   (* ~~~ FIXXXME Isabelle2002 has abs already !!!*)

    33   absset           :: "real set => real"        ("(||| _ |||)")

    34   (*is numeral constant ?*)

    35   is_const        :: "real => bool"            ("_ is'_const" 10)

    36   (*is_const rename to is_num FIXXXME.WN.16.5.03 *)

    37   is_atom         :: "real => bool"            ("_ is'_atom" 10)

    38   is_even         :: "real => bool"            ("_ is'_even" 10)

    40   (* identity on term level*)

    41   ident            :: "['a, 'a] => bool"        ("(_ =!=/ _)" [51, 51] 50)

    42   argument_in     :: "real => real"            ("argument'_in _" 10)

    43   sameFunId        :: "[real, bool] => bool"    (* "same_funid _ _" 10

    44 	                    WN0609 changed the id, because ".. _ _" inhibits currying *)

    45   filter_sameFunId:: "[real, bool list] => bool list" ("filter'_sameFunId _ _" 10)

    46   boollist2sum     :: "bool list => real"

    47   lastI            :: "'a list \<Rightarrow> 'a"

    49 subsection \<open>ML code for functions in pre-conditions and program-expressions\<close>

    50 ML \<open>

    51 signature PROG_EXPR =

    52   sig

    53 (*//------------------------- from Tools .thy-------------------------------------------------\\*)

    54     val lhs: term -> term

    55     val eval_lhs: 'a -> string -> term -> 'b -> (string * term) option

    56     val eval_matches: string -> string -> term -> theory -> (string * term) option

    57     val matchsub: theory -> term -> term -> bool

    58     val eval_matchsub: string -> string -> term -> theory -> (string * term) option

    59     val rhs: term -> term

    60     val eval_rhs: 'a -> string -> term -> 'b -> (string * term) option

    61     val eval_var: string -> string -> term -> theory -> (string * term) option

    63     val or2list: term -> term

    64 (*\\------------------------- from Tools .thy-------------------------------------------------//*)

    65 (*//------------------------- from Atools .thy------------------------------------------------\\*)

    66     val occurs_in: term -> term -> bool

    67     val eval_occurs_in: 'a -> string -> term -> 'b -> (string * term) option

    68     val some_occur_in: term list -> term -> bool

    69     val eval_some_occur_in: 'a -> string -> term -> 'b -> (string * term) option

    70     val eval_is_atom: string -> string -> term -> 'a -> (string * term) option

    71     val even: int -> bool

    72     val eval_is_even: string -> string -> term -> 'a -> (string * term) option

    73     val eval_const: string -> string -> term -> 'a -> (string * term) option

    74     val eval_equ: string -> string -> term -> 'a -> (string * term) option

    75     val eval_ident: string -> string -> term -> theory -> (string * term) option

    76     val eval_equal: string -> string -> term -> theory -> (string * term) option

    77     val eval_cancel: string -> string -> term -> 'a -> (string * term) option

    78     val eval_argument_in: string -> string -> term -> 'a -> (string * term) option

    79     val same_funid: term -> term -> bool

    80     val eval_sameFunId: string -> string -> term -> 'a -> (string * term) option

    81     val eval_filter_sameFunId: string -> string -> term -> 'a -> (string * term) option

    82     val list2sum: term list -> term

    83     val eval_boollist2sum: string -> string -> term -> 'a -> (string * term) option

    85     val mk_thmid_f: string -> (int * int) * (int * int) -> (int * int) * (int * int) -> string

    86   end

    88 (**)

    89 structure Prog_Expr(**): PROG_EXPR =(**)

    90 struct

    91 (**)

    93 (*+ for Or_to_List +*)

    94 fun or2list (Const ("HOL.True",_)) = ((*tracing"### or2list True";*) UniversalList)

    95   | or2list (Const ("HOL.False",_)) = ((*tracing"### or2list False";*) EmptyList)

    96   | or2list (t as Const ("HOL.eq",_) $ _ $ _) = TermC.list2isalist HOLogic.boolT [t]

    97   | or2list ors =

    98     let

    99       fun get ls (Const ("HOL.disj",_) $ o1 $ o2) =

   100 	        (case o2 of

   101 	         	Const ("HOL.disj",_) $ _ $ _ => get (ls @ [o1]) o2

   102 	        | _ => ls @ [o1, o2])

   103         | get _ t = raise TERM ("or2list: missing pattern in fun.def", [t])

   104     in (((TermC.list2isalist HOLogic.boolT) o (get [])) ors) end

   105 (*>val t = @{term True};

   106 > val t' = or2list t;

   107 > term2str t';

   108 "ListC.UniversalList"

   109 > val t = @{term False};

   110 > val t' = or2list t;

   111 > term2str t';

   112 "[]"

   113 > val t=(Thm.term_of o the o (parse thy)) "x=3";

   114 > val t' = or2list t;

   115 > term2str t';

   116 "[x = 3]"

   117 > val t=(Thm.term_of o the o (parse thy))"(x=3) | (x=-3) | (x=0)";

   118 > val t' = or2list t;

   119 > term2str t';

   120 "[x = #3, x = #-3, x = #0]" : string *)

   123 (** evaluation on the meta-level **)

   125 (*. evaluate the predicate matches (match on whole term only) .*)

   126 (*("matches",("Prog_Expr.matches", eval_matches "#matches_")):calc*)

   127 fun eval_matches (_:string) "Prog_Expr.matches" (t as Const ("Prog_Expr.matches",_) $ pat $ tst) thy =

   128     if TermC.matches thy tst pat

   129     then

   130       let

   131         val prop = HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True}))

   132 	    in SOME (UnparseC.term_in_thy thy prop, prop) end

   133     else

   134       let

   135         val prop = HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False}))

   136 	    in SOME (UnparseC.term_in_thy thy prop, prop) end

   137   | eval_matches _ _ _ _ = NONE;

   138 (*

   139 > val t  = (Thm.term_of o the o (parse thy))

   140 	      "matches (?x = 0) (1 * x \<up> 2 = 0)";

   141 > eval_matches "/thmid/" "/op_/" t thy;

   142 val it =

   143   SOME

   144     ("matches (x = 0) (1 * x \<up> 2 = 0) = False",

   145      Const (#,#) $ (# $ # $ Const #)) : (string * term) option

   147 > val t  = (Thm.term_of o the o (parse thy))

   148 	      "matches (?a = #0) (#1 * x \<up> #2 = #0)";

   149 > eval_matches "/thmid/" "/op_/" t thy;

   150 val it =

   151   SOME

   152     ("matches (?a = #0) (#1 * x \<up> #2 = #0) = True",

   153      Const (#,#) $ (# $ # $ Const #)) : (string * term) option

   155 > val t  = (Thm.term_of o the o (parse thy))

   156 	      "matches (?a * x = #0) (#1 * x \<up> #2 = #0)";

   157 > eval_matches "/thmid/" "/op_/" t thy;

   158 val it =

   159   SOME

   160     ("matches (?a * x = #0) (#1 * x \<up> #2 = #0) = False",

   161      Const (#,#) $ (# $ # $ Const #)) : (string * term) option

   163 > val t  = (Thm.term_of o the o (parse thy))

   164 	      "matches (?a * x \<up> #2 = #0) (#1 * x \<up> #2 = #0)";

   165 > eval_matches "/thmid/" "/op_/" t thy;

   166 val it =

   167   SOME

   168     ("matches (?a * x \<up> #2 = #0) (#1 * x \<up> #2 = #0) = True",

   169      Const (#,#) $ (# $ # $ Const #)) : (string * term) option

   170 ----- before ?patterns ---:

   171 > val t  = (Thm.term_of o the o (parse thy))

   172 	      "matches (a * b \<up> #2 = c) (#3 * x \<up> #2 = #1)";

   173 > eval_matches "/thmid/" "/op_/" t thy;

   174 SOME

   175     ("matches (a * b \<up> #2 = c) (#3 * x \<up> #2 = #1) = True",

   176      Const ("HOL.Trueprop", "bool => prop") $ (Const # $ (# $ #) $ Const (#,#)))

   177   : (string * term) option

   179 > val t = (Thm.term_of o the o (parse thy))

   180 	      "matches (a * b \<up> #2 = c) (#3 * x \<up> #2222 = #1)";

   181 > eval_matches "/thmid/" "/op_/" t thy;

   182 SOME ("matches (a * b \<up> #2 = c) (#3 * x \<up> #2222 = #1) = False",

   183      Const ("HOL.Trueprop", "bool => prop") $ (Const # $ (# $ #) $ Const (#,#)))

   185 > val t = (Thm.term_of o the o (parse thy))

   186                "matches (a = b) (x + #1 + #-1 * #2 = #0)";

   187 > eval_matches "/thmid/" "/op_/" t thy;

   188 SOME ("matches (a = b) (x + #1 + #-1 * #2 = #0) = True",Const # $ (# $ #))

   189 *)

   191 (*.does a pattern match some subterm ?.*)

   192 fun matchsub thy t pat =

   193   let

   194     fun matchs (t as Const _) = TermC.matches thy t pat

   195 	      | matchs (t as Free _) = TermC.matches thy t pat

   196 	      | matchs (t as Var _) = TermC.matches thy t pat

   197 	      | matchs (Bound _) = false

   198 	      | matchs (t as Abs (_, _, body)) =

   199 	          if TermC.matches thy t pat then true else TermC.matches thy body pat

   200 	      | matchs (t as f1 $ f2) =

   201 	          if TermC.matches thy t pat then true

   202 	            else if matchs f1 then true else matchs f2

   203   in matchs t end;

   205 (*("matchsub",("Prog_Expr.matchsub", eval_matchsub "#matchsub_")):calc*)

   206 fun eval_matchsub (_:string) "Prog_Expr.matchsub"

   207       (t as Const ("Prog_Expr.matchsub",_) $ pat $ tst) thy =

   208     if matchsub thy tst pat

   209     then

   210       let val prop = HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True}))

   211       in SOME (UnparseC.term_in_thy thy prop, prop) end

   212     else

   213       let val prop = HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False}))

   214       in SOME (UnparseC.term_in_thy thy prop, prop) end

   215   | eval_matchsub _ _ _ _ = NONE;

   217 (*get the variables in an isabelle-term*)

   218 (*("Vars"    ,("Prog_Expr.Vars"    , eval_var "#Vars_")):calc*)

   219 fun eval_var (thmid:string) "Prog_Expr.Vars" (t as (Const _ $ arg)) thy =

   220     let

   221       val t' = ((TermC.list2isalist HOLogic.realT) o TermC.vars) t;

   222       val thmId = thmid ^ UnparseC.term_in_thy thy arg;

   223     in SOME (thmId, HOLogic.Trueprop $ (TermC.mk_equality (t, t'))) end

   224   | eval_var _ _ _ _ = NONE;

   226 (* refer to Thm.lhs_of *)

   227 fun lhs (Const ("HOL.eq",_) $ l $ _) = l

   228   | lhs t = raise ERROR("lhs called with (" ^ UnparseC.term t ^ ")");

   229 (*("lhs"    ,("Prog_Expr.lhs"    , eval_lhs "")):calc*)

   230 fun eval_lhs _ "Prog_Expr.lhs" (t as (Const ("Prog_Expr.lhs",_) $ (Const ("HOL.eq",_) $ l $ _))) _ =

   231     SOME ((UnparseC.term t) ^ " = " ^ (UnparseC.term l),

   232 	  HOLogic.Trueprop $ (TermC.mk_equality (t, l)))

   233   | eval_lhs _ _ _ _ = NONE;

   234 (*

   235 > val t = (Thm.term_of o the o (parse thy)) "lhs (1 * x \<up> 2 = 0)";

   236 > val SOME (id,t') = eval_lhs 0 0 t 0;

   237 val id = "Prog_Expr.lhs (1 * x \<up> 2 = 0) = 1 * x \<up> 2" : string

   238 > term2str t';

   239 val it = "Prog_Expr.lhs (1 * x \<up> 2 = 0) = 1 * x \<up> 2" : string

   240 *)

   242 fun rhs (Const ("HOL.eq",_) $ _ $ r) = r

   243   | rhs t = raise ERROR("rhs called with (" ^ UnparseC.term t ^ ")");

   244 (*("rhs"    ,("Prog_Expr.rhs"    , eval_rhs "")):calc*)

   245 fun eval_rhs _ "Prog_Expr.rhs" (t as (Const ("Prog_Expr.rhs",_) $ (Const ("HOL.eq",_) $ _ $ r))) _ =

   246     SOME (UnparseC.term t ^ " = " ^ UnparseC.term r,

   247 	  HOLogic.Trueprop $ (TermC.mk_equality (t, r)))

   248   | eval_rhs _ _ _ _ = NONE;

   249 (*\\------------------------- from Prog_Expr.thy-------------------------------------------------//*)

   251 (*//------------------------- from Atools.thy------------------------------------------------\\*)

   252 fun occurs_in v t = member op = (((map strip_thy) o TermC.ids2str) t) (Term.term_name v);

   254 (*("occurs_in", ("Prog_Expr.occurs_in", Prog_Expr.eval_occurs_in ""))*)

   255 fun eval_occurs_in _ "Prog_Expr.occurs_in" (p as (Const ("Prog_Expr.occurs_in",_) $ v $ t)) _ =

   256     ((*tracing("#>@ eval_occurs_in: v= "^(UnparseC.term v));

   257      tracing("#>@ eval_occurs_in: t= "^(UnparseC.term t));*)

   258      if occurs_in v t

   259     then SOME ((UnparseC.term p) ^ " = True",

   260 	  HOLogic.Trueprop $ (TermC.mk_equality (p, @{term True})))

   261     else SOME ((UnparseC.term p) ^ " = False",

   262 	  HOLogic.Trueprop $ (TermC.mk_equality (p, @{term False}))))

   263   | eval_occurs_in _ _ _ _ = NONE;

   265 (*some of the (bound) variables (eg. in an eqsys) "vs" occur in term "t"*)

   266 fun some_occur_in vs t =

   267     let fun occurs_in' a b = occurs_in b a

   268     in foldl or_ (false, map (occurs_in' t) vs) end;

   270 (*("some_occur_in", ("Prog_Expr.some_occur_in",

   271 			eval_some_occur_in "#eval_some_occur_in_"))*)

   272 fun eval_some_occur_in _ "Prog_Expr.some_occur_in"

   273 			  (p as (Const ("Prog_Expr.some_occur_in",_) $ vs $ t)) _ =

   274     if some_occur_in (TermC.isalist2list vs) t

   275     then SOME ((UnparseC.term p) ^ " = True",

   276 	       HOLogic.Trueprop $ (TermC.mk_equality (p, @{term True})))

   277     else SOME ((UnparseC.term p) ^ " = False",

   278 	       HOLogic.Trueprop $ (TermC.mk_equality (p, @{term False})))

   279   | eval_some_occur_in _ _ _ _ = NONE;

   281 (*("is_atom",("Prog_Expr.is_atom", Prog_Expr.eval_is_atom "#is_atom_"))*)

   282 fun eval_is_atom (thmid:string) "Prog_Expr.is_atom"

   283 		 (t as (Const _ $ arg)) _ =

   284     (case arg of

   285 	 Free (n,_) => SOME (TermC.mk_thmid thmid n "",

   286 			      HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))

   287        | _ => SOME (TermC.mk_thmid thmid "" "",

   288 		    HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False}))))

   289   | eval_is_atom _ _ _ _ = NONE;

   291 fun even i = (i div 2) * 2 = i;

   292 (*("is_even",("Prog_Expr.is_even", eval_is_even "#is_even_"))*)

   293 fun eval_is_even (thmid:string) "Prog_Expr.is_even"

   294 		 (t as (Const _ $ arg)) _ =

   295     (case arg of

   296 	Free (n,_) =>

   297 	 (case ThmC_Def.int_opt_of_string n of

   298 	      SOME i =>

   299 	      if even i then SOME (TermC.mk_thmid thmid n "",

   300 				   HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))

   301 	      else SOME (TermC.mk_thmid thmid "" "",

   302 			 HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))

   303 	    | _ => NONE)

   304        | _ => NONE)

   305   | eval_is_even _ _ _ _ = NONE;

   307 (*evaluate 'is_const'*)

   308 (*("is_const",("Prog_Expr.is_const", Prog_Expr.eval_const "#is_const_"))*)

   309 fun eval_const (thmid:string) _ (t as (Const _ $ arg)) _ =

   310     (case arg of

   311        Const (n1, _) =>

   312 	     SOME (TermC.mk_thmid thmid n1 "", HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))

   313      | n1 =>

   314 	     if TermC.is_num n1

   315 	     then SOME (TermC.mk_thmid thmid (TermC.string_of_num n1) "",

   316          HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))

   317 	     else SOME (TermC.mk_thmid thmid (UnparseC.term n1) "",

   318          HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False}))))

   319   | eval_const _ _ _ _ = NONE;

   321 (*. evaluate binary, associative, commutative operators: *,+,^ .*)

   322 (*("PLUS"    ,("Groups.plus_class.plus"        , (**)eval_binop "#add_")),

   323   ("TIMES"   ,("Groups.times_class.times"        , (**)eval_binop "#mult_")),

   324   ("POWER"  ,("Transcendental.powr"  , (**)eval_binop "#power_"))*)

   326 (* val (thmid,op_,t as(Const (op0,t0) $ Free (n1,t1) $ Free(n2,t2)),thy) =

   327        ("xxxxxx",op_,t,thy);

   328    *)

   329 fun mk_thmid_f thmid ((v11, v12), (p11, p12)) ((v21, v22), (p21, p22)) = (* dropped *)

   330   thmid ^ "Float ((" ^

   331   (string_of_int v11)^", "^(string_of_int v12)^"), ("^

   332   (string_of_int p11)^", "^(string_of_int p12)^")) __ (("^

   333   (string_of_int v21)^", "^(string_of_int v22)^"), ("^

   334   (string_of_int p21)^", "^(string_of_int p22)^"))";

   336 (*.evaluate < and <= for numerals.*)

   337 (*("le"      ,("Orderings.ord_class.less"        , Prog_Expr.eval_equ "#less_")),

   338   ("leq"     ,("Orderings.ord_class.less_eq"       , Prog_Expr.eval_equ "#less_equal_"))*)

   339 fun eval_equ (thmid:string) (_(*op_*)) (t as (Const (op0, _)) $ t1 $ t2) _ =

   340     if TermC.is_num t1 andalso TermC.is_num t2 then

   341       let

   342         val n1 = t1 |> HOLogic.dest_number |> snd

   343         val n2 = t2 |> HOLogic.dest_number |> snd

   344       in

   345         if Eval.calc_equ (strip_thy op0) (n1, n2)

   346         then SOME (TermC.mk_thmid thmid (string_of_int n1) (string_of_int n2),

   347     	    HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))

   348         else SOME (TermC.mk_thmid thmid (string_of_int n1) (string_of_int n2),

   349     	   HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))

   350       end

   351     else NONE

   352   | eval_equ _ _ _ _ = NONE;

   355 (*evaluate identity

   356 > reflI;

   357 val it = "(?t = ?t) = True"

   358 > val t = str2term "x = 0";

   359 > val NONE = rewrite_ thy Rewrite_Ord.dummy_ord Rule_Set.empty false reflI t;

   361 > val t = str2term "1 = 0";

   362 > val NONE = rewrite_ thy Rewrite_Ord.dummy_ord Rule_Set.empty false reflI t;

   363 ----------- thus needs Rule.Eval !

   364 > val t = str2term "0 = 0";

   365 > val SOME (t',_) = rewrite_ thy Rewrite_Ord.dummy_ord Rule_Set.empty false reflI t;

   366 > UnparseC.term t';

   367 val it = "HOL.True"

   369 val t = str2term "Not (x = 0)";

   370 atomt t; UnparseC.term t;

   371 *** -------------

   372 *** Const ( Not)

   373 *** . Const ( op =)

   374 *** . . Free ( x, )

   375 *** . . Free ( 0, )

   376 val it = "x ~= 0" : string*)

   378 (*.evaluate identity on the term-level, =!= ,i.e. without evaluation of

   379   the arguments: thus special handling by 'fun eval_binop'*)

   380 (*("ident"   ,("Prog_Expr.ident", Prog_Expr.eval_ident "#ident_")):calc*)

   381 fun eval_ident (thmid:string) "Prog_Expr.ident" (t as

   382 	       (Const _(*op0, t0*) $ t1 $ t2 )) thy =

   383   if t1 = t2

   384   then SOME (TermC.mk_thmid thmid

   385 	              ("(" ^ (UnparseC.term_in_thy thy t1) ^ ")")

   386 	              ("(" ^ (UnparseC.term_in_thy thy t2) ^ ")"),

   387 	     HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))

   388   else SOME (TermC.mk_thmid thmid

   389 	              ("(" ^ (UnparseC.term_in_thy thy t1) ^ ")")

   390 	              ("(" ^ (UnparseC.term_in_thy thy t2) ^ ")"),

   391 	     HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))

   392   | eval_ident _ _ _ _ = NONE;

   393 (* TODO

   394 > val t = str2term "x =!= 0";

   395 > val SOME (str, t') = eval_ident "ident_" "b" t thy;

   396 > UnparseC.term t';

   397 val str = "ident_(x)_(0)" : string

   398 val it = "(x =!= 0) = False" : string

   399 > val t = str2term "1 =!= 0";

   400 > val SOME (str, t') = eval_ident "ident_" "b" t thy;

   401 > UnparseC.term t';

   402 val str = "ident_(1)_(0)" : string

   403 val it = "(1 =!= 0) = False" : string

   404 > val t = str2term "0 =!= 0";

   405 > val SOME (str, t') = eval_ident "ident_" "b" t thy;

   406 > UnparseC.term t';

   407 val str = "ident_(0)_(0)" : string

   408 val it = "(0 =!= 0) = True" : string

   409 *)

   412 (* evaluate identity of terms, which stay ready for further evaluation;

   413   thus returns False only for atoms *)

   414 (*("equal"   ,("HOL.eq", Prog_Expr.eval_equal "#equal_")):calc*)

   415 fun eval_equal (thmid : string) "HOL.eq" (t as (Const _(*op0,t0*) $ t1 $ t2 )) thy =

   416   if t1 = t2

   417   then

   418     SOME (TermC.mk_thmid thmid

   419       ("(" ^ UnparseC.term_in_thy thy t1 ^ ")") ("(" ^ UnparseC.term_in_thy thy t2 ^ ")"),

   420       HOLogic.Trueprop $ (TermC.mk_equality (t, @{term True})))

   421   else

   422     (case (TermC.is_atom t1, TermC.is_atom t2) of

   423       (true, true) =>

   424         if TermC.variable_constant_pair (t1, t2)

   425         then NONE

   426         else SOME (TermC.mk_thmid thmid

   427           ("(" ^ UnparseC.term_in_thy thy t1 ^ ")") ("(" ^ UnparseC.term_in_thy thy t2 ^ ")"),

   428           HOLogic.Trueprop $ (TermC.mk_equality (t, @{term False})))

   429     | _ => NONE)                                              (* NOT is_atom t1,t2 --> rew_sub *)

   430   | eval_equal _ _ _ _ = NONE;                                                   (* error-exit *)

   432 (*. evaluate HOL.divide .*)

   433 (*("DIVIDE" ,("Rings.divide_class.divide"  , eval_cancel "#divide_e"))*)

   434 fun eval_cancel thmid "Rings.divide_class.divide" (t as (Const _ $ t1 $ t2)) _ =

   435     if TermC.is_num t1 andalso TermC.is_num t2 then

   436       let

   437         val (T, _) = HOLogic.dest_number t1;

   438         val (i1, i2) = (Eval.int_of_numeral t1, Eval.int_of_numeral t2);

   439         val res_int as (_, (i1', i2')) = Eval.cancel_int (i1, i2);

   440       in

   441         if (i1', i2') = (i1, i2) then NONE

   442         else

   443           let

   444             val res = TermC.mk_frac T res_int;

   445             val prop = HOLogic.Trueprop $ (HOLogic.mk_eq (t, res));

   446           in SOME (TermC.mk_thmid thmid (string_of_int i1) (string_of_int i2), prop) end

   447       end

   448     else NONE

   449   | eval_cancel _ _ _ _ = NONE;

   451 (* get the argument from a function-definition *)

   452 (*("argument_in" ,("Prog_Expr.argument_in", Prog_Expr.eval_argument_in "Prog_Expr.argument_in"))*)

   453 fun eval_argument_in _ "Prog_Expr.argument_in"

   454 		 (t as (Const ("Prog_Expr.argument_in", _) $ (_(*f*) $ arg))) _ =

   455     if is_Free arg (*could be something to be simplified before*)

   456     then

   457       SOME (UnparseC.term t ^ " = " ^ UnparseC.term arg,

   458 	      HOLogic.Trueprop $ (TermC.mk_equality (t, arg)))

   459     else NONE

   460   | eval_argument_in _ _ _ _ = NONE;

   462 (* check if the function-identifier of the first argument matches

   463    the function-identifier of the lhs of the second argument *)

   464 (*("sameFunId" ,("Prog_Expr.sameFunId", eval_same_funid "Prog_Expr.sameFunId"))*)

   465 fun eval_sameFunId _ "Prog_Expr.sameFunId"

   466 		     (p as Const ("Prog_Expr.sameFunId",_) $  (f1 $ _) $ (Const ("HOL.eq", _) $ (f2 $ _) $ _)) _ =

   467     if f1 = f2

   468     then SOME ((UnparseC.term p) ^ " = True",

   469 	       HOLogic.Trueprop $ (TermC.mk_equality (p, @{term True})))

   470     else SOME ((UnparseC.term p) ^ " = False",

   471 	       HOLogic.Trueprop $ (TermC.mk_equality (p, @{term False})))

   472 | eval_sameFunId _ _ _ _ = NONE;

   475 (*.from a list of fun-definitions "f x = ..." as 2nd argument

   476    filter the elements with the same fun-identfier in "f y"

   477    as the fst argument;

   478    this is, because Isabelles filter takes more than 1 sec.*)

   479 fun same_funid f1 (Const ("HOL.eq", _) $ (f2 $ _) $ _) = f1 = f2

   480   | same_funid f1 t = raise ERROR ("same_funid called with t = ("

   481 		  ^ UnparseC.term f1 ^ ") (" ^ UnparseC.term t ^ ")");

   482 (*("filter_sameFunId" ,("Prog_Expr.filter_sameFunId",

   483 		   eval_filter_sameFunId "Prog_Expr.filter_sameFunId"))*)

   484 fun eval_filter_sameFunId _ "Prog_Expr.filter_sameFunId"

   485 		     (p as Const ("Prog_Expr.filter_sameFunId",_) $

   486 			(fid $ _) $ fs) _ =

   487     let val fs' = ((TermC.list2isalist HOLogic.boolT) o

   488 		   (filter (same_funid fid))) (TermC.isalist2list fs)

   489     in SOME (UnparseC.term (TermC.mk_equality (p, fs')),

   490 	       HOLogic.Trueprop $ (TermC.mk_equality (p, fs'))) end

   491 | eval_filter_sameFunId _ _ _ _ = NONE;

   493 (* make a list of terms to a sum *)

   494 fun list2sum [] = raise ERROR ("list2sum called with []")

   495   | list2sum [s] = s

   496   | list2sum (s::ss) =

   497     let

   498       fun sum su [s'] = Const ("Groups.plus_class.plus",

   499            [HOLogic.realT,HOLogic.realT] ---> HOLogic.realT) $ su $ s'

   500     	  | sum su (s'::ss') = sum (Const ("Groups.plus_class.plus",

   501            [HOLogic.realT,HOLogic.realT] ---> HOLogic.realT) $ su $ s') ss'

   502     	  | sum _ _ = raise ERROR "list2sum: pattern in fun.def is missing"

   503     in sum s ss end;

   505 (* make a list of equalities to the sum of the lhs *)

   506 (*("boollist2sum"    ,("Prog_Expr.boollist2sum"    , eval_boollist2sum "")):calc*)

   507 fun eval_boollist2sum _ "Prog_Expr.boollist2sum"

   508 		  (p as Const ("Prog_Expr.boollist2sum", _) $ (l as Const ("List.list.Cons", _) $ _ $ _)) _ =

   509     let

   510       val isal = TermC.isalist2list l

   511 	    val lhss = map lhs isal

   512 	    val sum = list2sum lhss

   513     in

   514       SOME ((UnparseC.term p) ^ " = " ^ (UnparseC.term sum),

   515 	      HOLogic.Trueprop $ (TermC.mk_equality (p, sum)))

   516     end

   517   | eval_boollist2sum _ _ _ _ = NONE;

   519 (**) end (*struct*)

   520 \<close> text \<open>

   521 open Prog_Expr

   522 \<close> ML \<open>

   523 \<close> ML \<open>

   524 \<close>

   526 subsection \<open>extend rule-set for evaluating pre-conditions and program-expressions\<close>

   527 ML \<open>

   528 val prog_expr = Rule_Set.append_rules "prog_expr" prog_expr [Rule.Eval ("Prog_Expr.rhs", Prog_Expr.eval_rhs "")];

   529 \<close> ML \<open>

   530 \<close> ML \<open>

   531 \<close>

   533 subsection \<open>setup for rule-sets and ML-functions\<close>

   534 setup \<open>KEStore_Elems.add_rlss [("prog_expr", (Context.theory_name @{theory}, prog_expr))]\<close>

   535 setup \<open>KEStore_Elems.add_calcs

   536   [("matches", ("Prog_Expr.matches", Prog_Expr.eval_matches "#matches_")),

   537     ("matchsub", ("Prog_Expr.matchsub", Prog_Expr.eval_matchsub "#matchsub_")),

   538     ("Vars", ("Prog_Expr.Vars", Prog_Expr.eval_var "#Vars_")),

   539     ("lhs", ("Prog_Expr.lhs", Prog_Expr.eval_lhs "")),

   540     ("rhs", ("Prog_Expr.rhs", Prog_Expr.eval_rhs ""))]\<close>

   541 (*\\------------------------- from Tools .thy-------------------------------------------------//*)

   542 ML \<open>

   543 \<close> ML \<open>

   544 \<close> ML \<open>

   545 \<close>

   547 end

author	wneuper <walther.neuper@jku.at>
	Tue, 01 Jun 2021 15:41:23 +0200
changeset 60317	638d02a9a96a
parent 60278	343efa173023
child 60318	e6e7a9b9ced7
permissions	-rw-r--r--