src/HOL/Library/DAList.thy
author wenzelm
Thu Feb 16 22:53:24 2012 +0100 (2012-02-16)
changeset 46507 1b24c24017dd
parent 46238 9ace9e5b79be
child 47143 212f7a975d49
permissions -rw-r--r--
tuned proofs;
bulwahn@46237
     1
(*  Title:      HOL/Library/DAList.thy
bulwahn@46167
     2
    Author:     Lukas Bulwahn, TU Muenchen *)
bulwahn@46167
     3
bulwahn@46167
     4
header {* Abstract type of association lists with unique keys *}
bulwahn@46167
     5
bulwahn@46237
     6
theory DAList
bulwahn@46238
     7
imports AList
bulwahn@46167
     8
begin
bulwahn@46167
     9
bulwahn@46167
    10
text {* This was based on some existing fragments in the AFP-Collection framework. *}
bulwahn@46167
    11
bulwahn@46167
    12
subsection {* Type @{text "('key, 'value) alist" } *}
bulwahn@46167
    13
bulwahn@46167
    14
typedef (open) ('key, 'value) alist = "{xs :: ('key \<times> 'value) list. distinct (map fst xs)}"
wenzelm@46507
    15
  morphisms impl_of Alist
wenzelm@46507
    16
proof
wenzelm@46507
    17
  show "[] \<in> {xs. distinct (map fst xs)}" by simp
wenzelm@46507
    18
qed
bulwahn@46167
    19
bulwahn@46167
    20
lemma alist_ext: "impl_of xs = impl_of ys \<Longrightarrow> xs = ys"
bulwahn@46167
    21
by(simp add: impl_of_inject)
bulwahn@46167
    22
bulwahn@46167
    23
lemma alist_eq_iff: "xs = ys \<longleftrightarrow> impl_of xs = impl_of ys"
bulwahn@46167
    24
by(simp add: impl_of_inject)
bulwahn@46167
    25
bulwahn@46167
    26
lemma impl_of_distinct [simp, intro]: "distinct (map fst (impl_of xs))"
bulwahn@46167
    27
using impl_of[of xs] by simp
bulwahn@46167
    28
bulwahn@46167
    29
lemma Alist_impl_of [code abstype]: "Alist (impl_of xs) = xs"
bulwahn@46167
    30
by(rule impl_of_inverse)
bulwahn@46167
    31
bulwahn@46167
    32
subsection {* Primitive operations *}
bulwahn@46167
    33
bulwahn@46167
    34
definition lookup :: "('key, 'value) alist \<Rightarrow> 'key \<Rightarrow> 'value option"
bulwahn@46167
    35
where [code]: "lookup xs = map_of (impl_of xs)" 
bulwahn@46167
    36
bulwahn@46167
    37
definition empty :: "('key, 'value) alist"
bulwahn@46167
    38
where [code del]: "empty = Alist []"
bulwahn@46167
    39
bulwahn@46167
    40
definition update :: "'key \<Rightarrow> 'value \<Rightarrow> ('key, 'value) alist \<Rightarrow> ('key, 'value) alist"
bulwahn@46238
    41
where [code del]: "update k v xs = Alist (AList.update k v (impl_of xs))"
bulwahn@46167
    42
bulwahn@46167
    43
(* FIXME: we use an unoptimised delete operation. *)
bulwahn@46167
    44
definition delete :: "'key \<Rightarrow> ('key, 'value) alist \<Rightarrow> ('key, 'value) alist"
bulwahn@46238
    45
where [code del]: "delete k xs = Alist (AList.delete k (impl_of xs))"
bulwahn@46167
    46
bulwahn@46167
    47
definition map_entry :: "'key \<Rightarrow> ('value \<Rightarrow> 'value) \<Rightarrow> ('key, 'value) alist \<Rightarrow> ('key, 'value) alist"
bulwahn@46238
    48
where [code del]: "map_entry k f xs = Alist (AList.map_entry k f (impl_of xs))" 
bulwahn@46167
    49
bulwahn@46167
    50
definition filter :: "('key \<times> 'value \<Rightarrow> bool) \<Rightarrow> ('key, 'value) alist \<Rightarrow> ('key, 'value) alist"
bulwahn@46167
    51
where [code del]: "filter P xs = Alist (List.filter P (impl_of xs))"
bulwahn@46167
    52
bulwahn@46167
    53
definition map_default :: "'key => 'value => ('value => 'value) => ('key, 'value) alist => ('key, 'value) alist"
bulwahn@46167
    54
where
bulwahn@46238
    55
  "map_default k v f xs = Alist (AList.map_default k v f (impl_of xs))"
bulwahn@46167
    56
bulwahn@46167
    57
lemma impl_of_empty [code abstract]: "impl_of empty = []"
bulwahn@46167
    58
by (simp add: empty_def Alist_inverse)
bulwahn@46167
    59
bulwahn@46238
    60
lemma impl_of_update [code abstract]: "impl_of (update k v xs) = AList.update k v (impl_of xs)"
bulwahn@46167
    61
by (simp add: update_def Alist_inverse distinct_update)
bulwahn@46167
    62
bulwahn@46167
    63
lemma impl_of_delete [code abstract]:
bulwahn@46238
    64
  "impl_of (delete k al) = AList.delete k (impl_of al)"
bulwahn@46167
    65
unfolding delete_def by (simp add: Alist_inverse distinct_delete)
bulwahn@46167
    66
bulwahn@46167
    67
lemma impl_of_map_entry [code abstract]:
bulwahn@46238
    68
  "impl_of (map_entry k f xs) = AList.map_entry k f (impl_of xs)"
bulwahn@46167
    69
unfolding map_entry_def by (simp add: Alist_inverse distinct_map_entry)
bulwahn@46167
    70
bulwahn@46167
    71
lemma distinct_map_fst_filter:
bulwahn@46167
    72
   "distinct (map fst xs) ==> distinct (map fst (List.filter P xs))"
bulwahn@46167
    73
by (induct xs) auto
bulwahn@46167
    74
bulwahn@46167
    75
lemma impl_of_filter [code abstract]:
bulwahn@46167
    76
  "impl_of (filter P xs) = List.filter P (impl_of xs)"
bulwahn@46167
    77
unfolding filter_def by (simp add: Alist_inverse distinct_map_fst_filter)
bulwahn@46167
    78
bulwahn@46167
    79
lemma impl_of_map_default [code abstract]:
bulwahn@46238
    80
  "impl_of (map_default k v f xs) = AList.map_default k v f (impl_of xs)"
bulwahn@46167
    81
by (auto simp add: map_default_def Alist_inverse distinct_map_default)
bulwahn@46167
    82
bulwahn@46167
    83
subsection {* Abstract operation properties *}
bulwahn@46167
    84
bulwahn@46167
    85
(* FIXME: to be completed *)
bulwahn@46167
    86
bulwahn@46167
    87
lemma lookup_empty [simp]: "lookup empty k = None"
bulwahn@46167
    88
by(simp add: empty_def lookup_def Alist_inverse)
bulwahn@46167
    89
bulwahn@46167
    90
lemma lookup_delete [simp]: "lookup (delete k al) = (lookup al)(k := None)"
bulwahn@46167
    91
by (simp add: lookup_def delete_def Alist_inverse distinct_delete delete_conv')
bulwahn@46167
    92
bulwahn@46167
    93
subsection {* Further operations *}
bulwahn@46167
    94
bulwahn@46167
    95
subsubsection {* Equality *}
bulwahn@46167
    96
bulwahn@46167
    97
instantiation alist :: (equal, equal) equal begin
bulwahn@46167
    98
bulwahn@46167
    99
definition "HOL.equal (xs :: ('a, 'b) alist) ys == impl_of xs = impl_of ys"
bulwahn@46167
   100
bulwahn@46167
   101
instance
bulwahn@46167
   102
proof
bulwahn@46167
   103
qed (simp add: equal_alist_def impl_of_inject)
bulwahn@46167
   104
bulwahn@46167
   105
end
bulwahn@46167
   106
bulwahn@46167
   107
subsubsection {* Size *}
bulwahn@46167
   108
bulwahn@46167
   109
instantiation alist :: (type, type) size begin
bulwahn@46167
   110
bulwahn@46167
   111
definition "size (al :: ('a, 'b) alist) = length (impl_of al)"
bulwahn@46167
   112
bulwahn@46167
   113
instance ..
bulwahn@46167
   114
bulwahn@46167
   115
end
bulwahn@46167
   116
bulwahn@46167
   117
subsection {* Quickcheck generators *}
bulwahn@46167
   118
bulwahn@46167
   119
notation fcomp (infixl "\<circ>>" 60)
bulwahn@46167
   120
notation scomp (infixl "\<circ>\<rightarrow>" 60)
bulwahn@46167
   121
bulwahn@46167
   122
definition (in term_syntax)
bulwahn@46167
   123
  valterm_empty :: "('key :: typerep, 'value :: typerep) alist \<times> (unit \<Rightarrow> Code_Evaluation.term)"
bulwahn@46167
   124
where
bulwahn@46167
   125
  "valterm_empty = Code_Evaluation.valtermify empty"
bulwahn@46167
   126
bulwahn@46167
   127
definition (in term_syntax)
bulwahn@46167
   128
  valterm_update :: "'key :: typerep \<times> (unit \<Rightarrow> Code_Evaluation.term) \<Rightarrow>
bulwahn@46167
   129
  'value :: typerep \<times> (unit \<Rightarrow> Code_Evaluation.term) \<Rightarrow>
bulwahn@46167
   130
  ('key, 'value) alist \<times> (unit \<Rightarrow> Code_Evaluation.term) \<Rightarrow>
bulwahn@46167
   131
  ('key, 'value) alist \<times> (unit \<Rightarrow> Code_Evaluation.term)" where
bulwahn@46167
   132
  [code_unfold]: "valterm_update k v a = Code_Evaluation.valtermify update {\<cdot>} k {\<cdot>} v {\<cdot>}a"
bulwahn@46167
   133
bulwahn@46167
   134
fun (in term_syntax) random_aux_alist 
bulwahn@46167
   135
where
bulwahn@46167
   136
  "random_aux_alist i j = (if i = 0 then Pair valterm_empty else Quickcheck.collapse (Random.select_weight [(i, Quickcheck.random j \<circ>\<rightarrow> (%k. Quickcheck.random j \<circ>\<rightarrow> (%v. random_aux_alist (i - 1) j \<circ>\<rightarrow> (%a. Pair (valterm_update k v a))))), (1, Pair valterm_empty)]))"
bulwahn@46167
   137
bulwahn@46167
   138
instantiation alist :: (random, random) random
bulwahn@46167
   139
begin
bulwahn@46167
   140
bulwahn@46167
   141
definition random_alist
bulwahn@46167
   142
where
bulwahn@46167
   143
  "random_alist i = random_aux_alist i i"
bulwahn@46167
   144
 
bulwahn@46167
   145
instance ..
bulwahn@46167
   146
bulwahn@46167
   147
end
bulwahn@46167
   148
bulwahn@46167
   149
no_notation fcomp (infixl "\<circ>>" 60)
bulwahn@46167
   150
no_notation scomp (infixl "\<circ>\<rightarrow>" 60)
bulwahn@46167
   151
bulwahn@46167
   152
instantiation alist :: (exhaustive, exhaustive) exhaustive
bulwahn@46167
   153
begin
bulwahn@46167
   154
bulwahn@46167
   155
fun exhaustive_alist :: "(('a, 'b) alist => (bool * term list) option) => code_numeral => (bool * term list) option"
bulwahn@46167
   156
where
bulwahn@46167
   157
  "exhaustive_alist f i = (if i = 0 then None else case f empty of Some ts => Some ts | None =>
bulwahn@46167
   158
     exhaustive_alist (%a. Quickcheck_Exhaustive.exhaustive (%k. Quickcheck_Exhaustive.exhaustive (%v. f (update k v a)) (i - 1)) (i - 1)) (i - 1))"
bulwahn@46167
   159
bulwahn@46167
   160
instance ..
bulwahn@46167
   161
bulwahn@46167
   162
end
bulwahn@46167
   163
bulwahn@46167
   164
instantiation alist :: (full_exhaustive, full_exhaustive) full_exhaustive
bulwahn@46167
   165
begin
bulwahn@46167
   166
bulwahn@46167
   167
fun full_exhaustive_alist :: "(('a, 'b) alist * (unit => term) => (bool * term list) option) => code_numeral => (bool * term list) option"
bulwahn@46167
   168
where
bulwahn@46167
   169
  "full_exhaustive_alist f i = (if i = 0 then None else case f valterm_empty of Some ts => Some ts | None =>
bulwahn@46167
   170
     full_exhaustive_alist (%a. Quickcheck_Exhaustive.full_exhaustive (%k. Quickcheck_Exhaustive.full_exhaustive (%v. f (valterm_update k v a)) (i - 1)) (i - 1)) (i - 1))"
bulwahn@46167
   171
bulwahn@46167
   172
instance ..
bulwahn@46167
   173
bulwahn@46167
   174
end
bulwahn@46167
   175
bulwahn@46167
   176
hide_const valterm_empty valterm_update random_aux_alist
bulwahn@46167
   177
bulwahn@46171
   178
hide_fact (open) lookup_def empty_def update_def delete_def map_entry_def filter_def map_default_def
bulwahn@46167
   179
hide_const (open) impl_of lookup empty update delete map_entry filter map_default 
bulwahn@46167
   180
bulwahn@46238
   181
end