Search

23 May 2024: signature NORM_ARITH = sig val norm_arith : Proof.context -> conv val norm_arith_tac : Proof.context -> int -> tactic end structure NormArith : NORM_ARITH = struct open Conv; val bool_eq = op = : bool ... norm b t acc = case Thm.term_of t of

23 May 2024: NONE (y as SOME _) = y | alternative _ NONE NONE = NONE fun varify_nonfixed_terms_global nonfixeds tm = tm |> Term.map_aterms (fn Free (x, T) => if member (op =) nonfixeds x then Var ... distinct (op =) end fun run_sledgehammer (params as {verbose, spy,

23 May 2024: curry (op =) sel o #sel) sel_eqns of NONE => (I, I, I) | SOME {fun_args, rhs_term,. } => ... rhs_opt of SOME rhs => rhs | NONE => filter (curry (op =) ctr o #ctr) sel_eqns |.

19 Apr 2024: VOLUNTARY Andante espressivo from Organ Sonata in G (Op. 28, Mvt 3) Elgar. ... SEAM. VOLUNTARY Improvisation No. 7 (Op. 150) Saint-Saëns. WEEK 3. Thursday 9 May ASCENSION DAY.

23 May 2024: curry (op =) x) xs fun is_data_type_acyclic ({co = false, deep = true,. } : ... values need_vals T = AList.lookup (op =) need_vals T |> the_default NONE |> these fun all_values_are_needed need_vals ({typ, card,. } :

5 Dec 2023: Equals Net Op. Revenue 4136.05 3943.56 3877.47 4564.78 5078.84 4325.94 5270.38 5617.43 5687.26 5492.14 5918.68. ... Op. Profits 121.79 114.42 -1078.08 -929.85 247.16 28.89 595.75 675.24 890.28 786.52 899.45.

20 May 2024: Shostakovich Quartet No.4, Op.83. Liz Johnson Quartet No.5 Dragon Moon (2024). Dvořák Piano Quintet in A major, Op.81.

23 May 2024: s, i), T), t'))) (Term.add_vars t [] |> subtract (op =) except) t; ( "imp_conjL[symmetric]" is important for inductive predicates with multiple assumptions. ) ... of ICoPred (_, _, specs) => union (op =) (map #const specs) | IRec specs => union (op =)

23 Feb 2024: Including measures of chronic kidney disease to improve cardiovascular risk prediction by SCORE2 and SCORE2-OP.

2 May 2024: Computational Projects. Lecture 4: Solution of ODEs. Note: this lecture will cover material likely useful for a core IB project (and several other IB and II projects). Introduction. Computers are often used for solving ordinary differential

23 May 2024: aterms (fn Free (x, _) => cons x | _ => I) tm []; val terms_vs = distinct (op =) o maps term_vs; fun print_failed_mode options p (_, m) is = if show_mode_inference options then ... fastype_of t) andalso forall (member (op =) vs) (term_vs t))

19 Mar 2024: Through my work as Manager of the CSE, I enjoy discussing with students the histories of the a rel="noreferrer noopener"

23 May 2024: app_op_name = const_prefix app_op_name val prefixed_type_tag_name = const_prefix type_tag_name (Escaping of special characters. ... atomic_types_of T)) | iot fool bs (Abs (s, T, t)) = let fun vary s = s |> AList.defined (op =) bs s?

23 May 2024: Legacy.typ_tvars fun type_varsl L = distinct (op =) (fold (curry op @ o type_vars) L []); val alpha = mk_vartype "'a" val strip_prod_type = HOLogic.flatten_tupleT; (--------------------------------------------------------------------------- Terms ---

23 May 2024: structure Mirabelle_Sledgehammer_Filter: MIRABELLE_ACTION = struct fun get args name default_value = case AList.lookup (op =) args name of SOME value => Value.parse_real value | NONE => default_value fun ... Mirabelle.action_context) = let val

23 May 2024: add_boxed_types_for_var", [T'], [])) | _ => exists_subterm (curry (op =) (Var z)) t'? ... forall (op aconv) (ts1 ts2) fun specialize_consts_in_term (hol_ctxt as {ctxt, thy, specialize, def_tables, simp_table, special_funs,. })

29 May 2024: Home page Indexes: The Girton Poetry Group. Not Averse. Concordance. This concordance provides an index to every word in the poems, excluding a list of common "stopwords". It may be useful in finding a half-remembered poem, and perhaps in looking at

23 May 2024: snd) (Symtab.dest (BNF_LFP_Compat.get_all (Proof_Context.theory_of ctxt) Quickcheck_Common.compat_prefs))) fun is_constrt (Const (s, T), ts) = (case (AList.lookup (op =) cnstrs s, ... vars assms genuine = let fun vars_of t = subtract (op =) bound_vars

7 Nov 2023: Spectre-STL [29]. mistrainingstrategy. Cross-address-space. Same-address-space. PHT-CA-IP ï. PHT-CA-OP ï. PHT-SA-IP [48, 50]. ... RSB-SA-IP [59]. RSB-SA-OP [52, 59]. Meltdown-NM [78]. Meltdown-AC î. Meltdown-DE î.

23 May 2024: Ord_List.T fun class_ord ((cs1, _), (cs2, _)) = rev_order (list_ord fast_string_ord (cs1, cs2)) fun dict_insert (cs, x) d = if AList.defined (op =) d cs then d ... else Ord_List.insert class_ord (cs, x) d fun dict_map_default (cs, x) f = dict_insert (cs,

23 May 2024: forall_elim_list cTs o Thm.assume) cterm_asms; in (fold (curry op COMP) allifyied_asm_thms th, cterm_asms) end; ( Given a list of variables that were bound, and a ... x? y ) fun mk_renamings ctxt tgt rule_inst = let val rule_conds = Thm.prems_of rule_inst

23 May 2024: thm fresh_star_empty_elim}]); fun preds_of ps t = inter (op = o apsnd dest_Free) ps (Term.add_frees t []); val perm_bool = mk_meta_eq @{thm perm_bool_def}; ... bool", lhss = [<term>‹perm pi x›], proc = fn _ => fn _ => fn ct => (case Thm.term_of ct of

23 May 2024: mk_verit_strategy default_strategy (AList.merge (op =) (op =) (strategies1, strategies2)) structure Data = Generic_Data ( type T = verit_strategy val empty = empty_data val merge = merge_data ) fun veriT_current_strategy ... ctxt = let val

23 May 2024: exists (member (op =) typedef_ths) deps orelse is_size_def deps th then [] else deps) fun prover_dependencies_of ctxt (params as {verbose, max_facts,. }) ... chained, unknown_proximate] in (mesh_facts (fact_distinct (op aconv)) (eq_snd (gen_eq_thm ctxt))

23 May 2024: tap (tracing o prefix "atp_proof0 = " o string_of_atp_steps) |> distinct (op =) ( Zipperposition generates duplicate lines ) |> (fn lines => fold_rev add_line_pass1 lines []) |> add_lines_pass2 [] |> trace? ... subproofs, facts = (ls, _),. }) = member

23 May 2024: ctxt)); fun preds_of ps t = inter (op = o apsnd dest_Free) ps (Term.add_frees t []); val fresh_prod = @{thm fresh_prod}; val perm_bool = mk_meta_eq @{thm ... name = "perm_bool", lhss = [<term>‹perm pi x›], proc = fn _ => fn _ => fn ct => (case

23 May 2024: remove (op =)) lhs_tfrees rhs_tfrees of [] => () | extras => error ("Extra type variables in representing set: " show_names extras)); val _ = (case Term.add_frees A [] of [] => [] | xs => error ("Illegal variables in representing ... c => insert (op =)

23 May 2024: of bool; val aconv_net = Item_Net.init (op aconv) single; val parse_match_kind = Scan.lift <keyword>‹conclusion› >> K Match_Concl || Scan.lift (<keyword>‹premises› |-- Args.mode "local") >> Match_Prems || ... false) params'; val

23 May 2024: add_edge ((p, mode), req)) (requires_modes (fst mode) cls)) mps) moded_clauses in (gr', (AList.merge (op =) (op =) (pos_modes, pos_modes'), AList.merge (op =) (op =) (neg_modes, neg_modes'), ... AList.merge (op =) (op =) (random, random'))) end in fst

23 May 2024: mk_Trueprop; infix 0 :== ===; infixr 0 ==>; val op :== = Misc_Legacy.mk_defpair; val op === = Trueprop o HOLogic.mk_eq; val op ==> = Logic.mk_implies; ( constructor ) fun mk_ext (name, T) ts = ... let val subst = Term.map_type_tfree (the o AList.lookup

23 May 2024: fold_map Name.variant vs (Name.make_context (fold_aterms (fn Free (v, _) => insert (op =) v | _ => I) body [])); val eqn = curry subst_bounds (map2 (curry Free) vs' Ts |> rev) body; val ... op =) lfrees); check_vars "extra variables on rhs: "

23 May 2024: Ex1_def_raw}), (<const_name>‹Ball›, @{thm Ball_def_raw}), (<const_name>‹Bex›, @{thm Bex_def_raw})] local fun special_quant (Const (n, _)) = AList.lookup (op =) special_quant_table n | ... subset (op aconv) (vs, map Free (Term.add_frees t [])) fun

23 May 2024: dont_spy", "spy"), ("no_assms", "assms"), ("no_debug", "debug"), ("no_overlord", "overlord"), ("non_mono", "mono"), ("non_wf", "wf"), ("quiet", "verbose"), ("satisfy", "falsify")]; fun is_known_raw_param s = AList.defined (op =) ... default_default_params

23 May 2024: int list (term list cl_prf) list; val is_atomic = not o exists_Const (member (op =) Data.operator_names o #1); fun rulify_elim_conv ctxt ct = if is_atomic ... insert_term op = (t, (t, i))) ts' facts; in (case valid ctxt' rules goal dom' facts' (nfacts

20 May 2024: Π3. Σ3. Σ3 Π3. Σ1. Sample: some results for bounded op. ... Approx. sparse normal op. Compact operators “Sparse” operators. • C., “The foundations of infinite-dimensional spectral computations,” PhD diss., University of Cambridge, 2020.•

21 Feb 2024: CCAIM https://ccaim.cam.ac.uk Novel AI to transform healthcare Fri, 18 Feb 2022 11:56:58 0000 en-GB hourly 1 https://wordpress.org/?v=6.2.4 https://ccaim.cam.ac.uk/wp-content/uploads/2020/09/cropped-CCAIM-Symbol-Social-Icon-WhiteBG-1-32x32.png CCAIM

23 May 2024: a) = the (covering g strict j) fun choose xs = set_member_tac ctxt (find_index (curry op = (i, a)) xs) 1 val solve_tac = choose lp THEN less_proof strict (j, ... a) :: rest = lp val (j, b) = the (covering g strict i) fun choose xs = set_member_tac ctxt

23 May 2024: val new_eqn = (cname, (rhs, cargs, eq)) in if has_duplicates (op =) lfrees then raise RecError "repeated variable name in pattern" else if not (subset (op =) (Term.add_frees rhs [], lfrees)) ... ftype, ls, rs, con_info, [new_eqn]) | SOME (fname', _, ls',

23 May 2024: fn (_, _, _, prems) => prems |> (fold o fold_aterms) (fn t as Const (a, _) => if member (op =) rec_names a then I else insert (op =) t | _ => I)) con_ty_lists []; in u $ ... infixes) get a name of the form f_op_nnn. ) (The function variable for a single

5 Dec 2023: Freq. uenc. y w. ithin. 100. 000. sim. ulat. ions. CCGT plant op flexibility. ... atio. ns. Coal plantCCGT plantNuclear plant. Op. flexibility option NPV distribution, 5% DR (£m).

23 May 2024: curry op COMP o prep_RC) RCs lGI val P = Thm.cterm_of ctxt (mk_eq (y, rhsC)) val G_lhs_y = Thm.assume (Thm.cterm_of ctxt (HOLogic.mk_Trueprop ... SOME (Thm.ctyp_of ctxt ranT)] [SOME P2, SOME (Thm.cterm_of ctxt rhsC)] |> curry (op COMP) existence |> curry

23 May 2024: lookup (op =) alias_params name of SOME (name', []) => (name', value) | SOME (param' as (name', _)) => if value <> ["false"] then param' else error ("Parameter " quote name " cannot be set to "false" (cf. " ... single) fun merge data : T = AList.merge

19 Oct 2023: cit., note 11, p. 257. 16 R. Tuck, op. cit., note 2, p. ... Fressoz, op. cit., note 3, p. 20. 29 The text hasn’t changed since 1804: ‘La propriété est le droit de jouir et disposer des choses de la manière la plus.

23 May 2024: Free (the_default name (AList.lookup op= tab name), typ) | rename_free_var _ t = t fun rename_free_vars tab = map_aterms (rename_free_var tab) fun rename_free_tvars tab = ... in Conv.fconv_rule (HOLogic.Trueprop_conv (Conv.fun2_conv

23 May 2024: val is_asymmetric_non_data_type = is_iterator_type orf is_integer_type orf is_bit_type fun data_type_spec (dtypes : data_type_spec list) T = List.find (curry (op =) ... distinct (op =) |> map (scope_from_descriptor hol_ctxt binarize deep_dataTs

23 May 2024: member (op =) whitelist name andalso check_thy pos then SOME {theory_index = thy_index, name = name, pos = pos, pre = Toplevel.proof_of st, post = st'} else NONE end; in if ... thms = Global_Theory.all_thms_of thy true; fun collect (s, _, _) = if s <> ""

21 Feb 2024: CCAIM https://ccaim.cam.ac.uk Novel AI to transform healthcare Mon, 01 Jan 2024 18:59:17 0000 en-GB hourly 1 https://wordpress.org/?v=6.2.4 https://ccaim.cam.ac.uk/wp-content/uploads/2020/09/cropped-CCAIM-Symbol-Social-Icon-WhiteBG-1-32x32.png CCAIM

23 May 2024: lambda_def dest_Free o ATP_Util.hol_open_form I) ll_defs fun un_free (t as Free (s, _)) = (case AList.lookup (op =) lifted s of SOME t => un_term ... min_max_table |> map_filter (fn (c, th) => if exists_Const (curry (op =) c o fst) concl0 then let val s =

6 Sep 2023: Publications since 1978. Showor all types, or:. --. Communications. Sensors. Software Engineering. Systems. 1. Martin Kleppmann, "Moving Elements in List CRDTs," 7th Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC),

23 May 2024: bnf; in permute_like_unique (op =) (deads @ lives) Ts (replicate (length deads) dead_x @ xs) end; (terms) val map_of_bnf = #map o rep_bnf; val sets_of_bnf = #sets o ... let val thy = Proof_Context.theory_of ctxt; val tyenv = Sign.typ_match thy