rename things + some small changes

1 files changed, 0 insertions, 113 deletions

diff --git a/spartan/core/types.ML b/spartan/core/types.ML
deleted file mode 100644
index 5e0d484..0000000
--- a/spartan/core/types.ML
+++ /dev/null
@@ -1,113 +0,0 @@
-(*  Title:      types.ML
-    Author:     Joshua Chen
-
-Type-checking infrastructure.
-*)
-
-structure Types: sig
-
-val debug_typechk: bool Config.T
-
-val known_ctac: thm list -> int -> context_tactic
-val check_infer: thm list -> int -> context_tactic
-
-end = struct
-
-open Context_Facts
-
-(** [type] attribute **)
-
-val _ = Theory.setup (
-  Attrib.setup \<^binding>\<open>type\<close>
-    (Scan.succeed (Thm.declaration_attribute (fn th =>
-      if Thm.no_prems th then register_known th else register_cond th)))
-    ""
-  #> Global_Theory.add_thms_dynamic (\<^binding>\<open>type\<close>,
-      fn context => let val ctxt = Context.proof_of context in
-        known ctxt @ cond ctxt end)
-)
-
-
-(** Context tactics for type-checking and elaboration **)
-
-val debug_typechk = Attrib.setup_config_bool \<^binding>\<open>debug_typechk\<close> (K false)
-
-fun debug_tac ctxt s =
-  if Config.get ctxt debug_typechk then print_tac ctxt s else all_tac
-
-(*Solves goals without metavariables and type inference problems by assumption
-  from inline premises or resolution with facts*)
-fun known_ctac facts = CONTEXT_SUBGOAL (fn (goal, i) => fn (ctxt, st) =>
-  TACTIC_CONTEXT ctxt
-    let val concl = Logic.strip_assums_concl goal in
-      if Lib.no_vars concl orelse
-        (Lib.is_typing concl andalso Lib.no_vars (Lib.term_of_typing concl))
-      then
-        let val ths = known ctxt @ facts
-        in st |>
-          (assume_tac ctxt ORELSE' resolve_tac ctxt ths THEN_ALL_NEW K no_tac) i
-        end
-      else Seq.empty
-    end)
-
-(*Simple bidirectional typing tactic with some backtracking search over input
-  facts.*)
-fun check_infer_step facts i (ctxt, st) =
-  let
-    val refine_tac = SUBGOAL (fn (goal, i) =>
-      if Lib.rigid_typing_concl goal
-      then
-        let
-          val net = Tactic.build_net (
-            map (Simplifier.norm_hhf ctxt) facts
-            @(cond ctxt)
-            @(Named_Theorems.get ctxt \<^named_theorems>\<open>form\<close>)
-            @(Named_Theorems.get ctxt \<^named_theorems>\<open>intr\<close>)
-            @(map #1 (Elim.rules ctxt)))
-        in resolve_from_net_tac ctxt net i end
-      else no_tac)
-
-    val sub_tac = SUBGOAL (fn (goal, i) =>
-      let val concl = Logic.strip_assums_concl goal in
-      if Lib.is_typing concl
-        andalso Lib.is_rigid (Lib.term_of_typing concl)
-        andalso Lib.no_vars (Lib.type_of_typing concl)
-      then
-        (resolve_tac ctxt @{thms sub}
-        THEN' SUBGOAL (fn (_, i) =>
-          NO_CONTEXT_TACTIC ctxt (check_infer facts i))
-        THEN' compute_tac ctxt facts
-        THEN_ALL_NEW K no_tac) i
-      else no_tac end)
-
-    val ctxt' = ctxt (*TODO: Use this to store already-derived typing judgments*)
-  in
-    TACTIC_CONTEXT ctxt' (
-      (NO_CONTEXT_TACTIC ctxt' o known_ctac facts
-      ORELSE' refine_tac
-      ORELSE' sub_tac) i st)
-  end
-
-and check_infer facts i (cst as (_, st)) =
-  let
-    val ctac = check_infer_step facts
-  in
-    cst |> (ctac i CTHEN
-      CREPEAT_IN_RANGE i (Thm.nprems_of st - i) (CTRY o CREPEAT_ALL_NEW_FWD ctac))
-  end
-
-and compute_tac ctxt facts =
-  let
-    val comps = Named_Theorems.get ctxt \<^named_theorems>\<open>comp\<close>
-    val ss = simpset_of ctxt
-    val ss' = simpset_of (empty_simpset ctxt addsimps comps)
-    val ctxt' = put_simpset (merge_ss (ss, ss')) ctxt
-  in
-    SUBGOAL (fn (_, i) =>
-      ((CHANGED o asm_simp_tac ctxt' ORELSE' EqSubst.eqsubst_tac ctxt [0] comps)
-      THEN_ALL_NEW SUBGOAL (fn (_, i) =>
-        NO_CONTEXT_TACTIC ctxt (check_infer facts i))) i)
-  end
-
-
-end