src/HOL/Types_To_Sets/Types_To_Sets.thy

more options;

(*  Title:      HOL/Types_To_Sets/Types_To_Sets.thy
    Author:     Ondřej Kunčar, TU München
*)

section \<open>From Types to Sets\<close>

text \<open>This theory extends Isabelle/HOL's logic by two new inference rules
  to allow translation of types to sets as described in
  O. Kunčar, A. Popescu: From Types to Sets by Local Type Definitions in Higher-Order Logic
  available at https://www21.in.tum.de/~kuncar/documents/kuncar-popescu-t2s2016-extended.pdf.\<close>

theory Types_To_Sets
  imports Main
  keywords "unoverload_definition" :: thy_decl
begin

subsection \<open>Rules\<close>

text\<open>The following file implements the Local Typedef Rule (LT) and extends the logic by the rule.\<close>
ML_file \<open>local_typedef.ML\<close>

text\<open>The following file implements the Unoverloading Rule (UO) and extends the logic by the rule.\<close>
ML_file \<open>unoverloading.ML\<close>

text\<open>The following file implements a derived rule that internalizes type class annotations.\<close>
ML_file \<open>internalize_sort.ML\<close>

text\<open>The following file provides some automation to unoverload and internalize the parameters of
  the sort constraints of a type variable.\<close>
ML_file \<open>unoverload_type.ML\<close>

text \<open>The following file provides automation to define unoverloaded constants from overloaded
  definitions.\<close>
named_theorems unoverload_def
ML_file \<open>unoverload_def.ML\<close>

end