# HG changeset patch # User wenzelm # Date 1635587963 -7200 # Node ID 994a2b9daf1dcc4caa667f60a6c8e37841f9855f # Parent 8ab92e40dde6d55957049bac0615d97709d257c4 clarified antiquotations; diff -r 8ab92e40dde6 -r 994a2b9daf1d src/HOL/Library/Cancellation/cancel_data.ML --- a/src/HOL/Library/Cancellation/cancel_data.ML Fri Oct 29 21:06:08 2021 +0200 +++ b/src/HOL/Library/Cancellation/cancel_data.ML Sat Oct 30 11:59:23 2021 +0200 @@ -30,10 +30,7 @@ (*No reordering of the arguments.*) fun fast_mk_iterate_add (n, mset) = - let val T = fastype_of mset - in - Const (\<^const_name>\iterate_add\, \<^typ>\nat\ --> T --> T) $ n $ mset - end; + \<^Const>\iterate_add \fastype_of mset\ for n mset\; (*iterate_add is not symmetric, unlike multiplication over natural numbers.*) fun mk_iterate_add (t, u) = @@ -56,16 +53,16 @@ handle TERM _ => find_first_numeral (t::past) terms) | find_first_numeral _ [] = raise TERM("find_first_numeral", []); -fun typed_zero T = Const (\<^const_name>\Groups.zero\, T); -fun typed_one T = HOLogic.numeral_const T $ HOLogic.one_const -val mk_plus = HOLogic.mk_binop \<^const_name>\Groups.plus\; +fun typed_zero T = \<^Const>\Groups.zero T\; +fun typed_one T = \<^Const>\numeral T for \<^Const>\num.One\\; +val mk_plus = HOLogic.mk_binop \<^const_name>\plus\; (*Thus mk_sum[t] yields t+0; longer sums don't have a trailing zero.*) fun mk_sum T [] = typed_zero T | mk_sum _ [t,u] = mk_plus (t, u) | mk_sum T (t :: ts) = mk_plus (t, mk_sum T ts); -val dest_plus = HOLogic.dest_bin \<^const_name>\Groups.plus\ dummyT; +val dest_plus = HOLogic.dest_bin \<^const_name>\plus\ dummyT; (*** Other simproc items ***) diff -r 8ab92e40dde6 -r 994a2b9daf1d src/HOL/Library/Cancellation/cancel_simprocs.ML --- a/src/HOL/Library/Cancellation/cancel_simprocs.ML Fri Oct 29 21:06:08 2021 +0200 +++ b/src/HOL/Library/Cancellation/cancel_simprocs.ML Sat Oct 30 11:59:23 2021 +0200 @@ -26,24 +26,24 @@ structure Eq_Cancel_Comm_Monoid_less = Cancel_Fun (open Cancel_Data - val mk_bal = HOLogic.mk_binrel \<^const_name>\Orderings.less\ - val dest_bal = HOLogic.dest_bin \<^const_name>\Orderings.less\ dummyT + val mk_bal = HOLogic.mk_binrel \<^const_name>\less\ + val dest_bal = HOLogic.dest_bin \<^const_name>\less\ dummyT val bal_add1 = @{thm iterate_add_less_iff1} RS trans val bal_add2 = @{thm iterate_add_less_iff2} RS trans ); structure Eq_Cancel_Comm_Monoid_less_eq = Cancel_Fun (open Cancel_Data - val mk_bal = HOLogic.mk_binrel \<^const_name>\Orderings.less_eq\ - val dest_bal = HOLogic.dest_bin \<^const_name>\Orderings.less_eq\ dummyT + val mk_bal = HOLogic.mk_binrel \<^const_name>\less_eq\ + val dest_bal = HOLogic.dest_bin \<^const_name>\less_eq\ dummyT val bal_add1 = @{thm iterate_add_less_eq_iff1} RS trans val bal_add2 = @{thm iterate_add_less_eq_iff2} RS trans ); structure Diff_Cancel_Comm_Monoid_less_eq = Cancel_Fun (open Cancel_Data - val mk_bal = HOLogic.mk_binop \<^const_name>\Groups.minus\ - val dest_bal = HOLogic.dest_bin \<^const_name>\Groups.minus\ dummyT + val mk_bal = HOLogic.mk_binop \<^const_name>\minus\ + val dest_bal = HOLogic.dest_bin \<^const_name>\minus\ dummyT val bal_add1 = @{thm iterate_add_add_eq1} RS trans val bal_add2 = @{thm iterate_add_diff_add_eq2} RS trans );