author | wenzelm |
Tue, 21 Jul 2009 01:03:18 +0200 | |
changeset 32091 | 30e2ffbba718 |
parent 30158 | 83c50c62cf23 |
child 35169 | 31cbcb019003 |
permissions | -rw-r--r-- |
29992 | 1 |
(* Title: HOLCF/ex/Powerdomain_ex.thy |
2 |
Author: Brian Huffman |
|
3 |
*) |
|
4 |
||
5 |
header {* Powerdomain examples *} |
|
6 |
||
7 |
theory Powerdomain_ex |
|
8 |
imports HOLCF |
|
9 |
begin |
|
10 |
||
11 |
defaultsort bifinite |
|
12 |
||
13 |
subsection {* Monadic sorting example *} |
|
14 |
||
15 |
domain ordering = LT | EQ | GT |
|
16 |
||
17 |
declare ordering.rews [simp] |
|
18 |
||
19 |
definition |
|
20 |
compare :: "int lift \<rightarrow> int lift \<rightarrow> ordering" where |
|
21 |
"compare = (FLIFT x y. if x < y then LT else if x = y then EQ else GT)" |
|
22 |
||
23 |
definition |
|
24 |
is_le :: "int lift \<rightarrow> int lift \<rightarrow> tr" where |
|
25 |
"is_le = (\<Lambda> x y. case compare\<cdot>x\<cdot>y of LT \<Rightarrow> TT | EQ \<Rightarrow> TT | GT \<Rightarrow> FF)" |
|
26 |
||
27 |
definition |
|
28 |
is_less :: "int lift \<rightarrow> int lift \<rightarrow> tr" where |
|
29 |
"is_less = (\<Lambda> x y. case compare\<cdot>x\<cdot>y of LT \<Rightarrow> TT | EQ \<Rightarrow> FF | GT \<Rightarrow> FF)" |
|
30 |
||
31 |
definition |
|
32 |
r1 :: "(int lift \<times> 'a) \<rightarrow> (int lift \<times> 'a) \<rightarrow> tr convex_pd" where |
|
33 |
"r1 = (\<Lambda> \<langle>x,_\<rangle> \<langle>y,_\<rangle>. case compare\<cdot>x\<cdot>y of |
|
34 |
LT \<Rightarrow> {TT}\<natural> | |
|
35 |
EQ \<Rightarrow> {TT, FF}\<natural> | |
|
36 |
GT \<Rightarrow> {FF}\<natural>)" |
|
37 |
||
38 |
definition |
|
39 |
r2 :: "(int lift \<times> 'a) \<rightarrow> (int lift \<times> 'a) \<rightarrow> tr convex_pd" where |
|
40 |
"r2 = (\<Lambda> \<langle>x,_\<rangle> \<langle>y,_\<rangle>. {is_le\<cdot>x\<cdot>y, is_less\<cdot>x\<cdot>y}\<natural>)" |
|
41 |
||
42 |
lemma r1_r2: "r1\<cdot>\<langle>x,a\<rangle>\<cdot>\<langle>y,b\<rangle> = (r2\<cdot>\<langle>x,a\<rangle>\<cdot>\<langle>y,b\<rangle> :: tr convex_pd)" |
|
43 |
apply (simp add: r1_def r2_def) |
|
44 |
apply (simp add: is_le_def is_less_def) |
|
45 |
apply (cases "compare\<cdot>x\<cdot>y" rule: ordering.casedist) |
|
46 |
apply simp_all |
|
47 |
done |
|
48 |
||
49 |
||
50 |
subsection {* Picking a leaf from a tree *} |
|
51 |
||
52 |
domain 'a tree = |
|
53 |
Node (lazy "'a tree") (lazy "'a tree") | |
|
54 |
Leaf (lazy "'a") |
|
55 |
||
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
56 |
fixrec |
29992 | 57 |
mirror :: "'a tree \<rightarrow> 'a tree" |
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
58 |
where |
29992 | 59 |
mirror_Leaf: "mirror\<cdot>(Leaf\<cdot>a) = Leaf\<cdot>a" |
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
60 |
| mirror_Node: "mirror\<cdot>(Node\<cdot>l\<cdot>r) = Node\<cdot>(mirror\<cdot>r)\<cdot>(mirror\<cdot>l)" |
29992 | 61 |
|
62 |
fixpat |
|
63 |
mirror_strict [simp]: "mirror\<cdot>\<bottom>" |
|
64 |
||
65 |
fixrec |
|
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
66 |
pick :: "'a tree \<rightarrow> 'a convex_pd" |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
67 |
where |
29992 | 68 |
pick_Leaf: "pick\<cdot>(Leaf\<cdot>a) = {a}\<natural>" |
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
69 |
| pick_Node: "pick\<cdot>(Node\<cdot>l\<cdot>r) = pick\<cdot>l +\<natural> pick\<cdot>r" |
29992 | 70 |
|
71 |
fixpat |
|
72 |
pick_strict [simp]: "pick\<cdot>\<bottom>" |
|
73 |
||
74 |
lemma pick_mirror: "pick\<cdot>(mirror\<cdot>t) = pick\<cdot>t" |
|
75 |
by (induct t rule: tree.ind) |
|
76 |
(simp_all add: convex_plus_ac) |
|
77 |
||
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
78 |
fixrec tree1 :: "int lift tree" |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
79 |
where "tree1 = Node\<cdot>(Node\<cdot>(Leaf\<cdot>(Def 1))\<cdot>(Leaf\<cdot>(Def 2))) |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
80 |
\<cdot>(Node\<cdot>(Leaf\<cdot>(Def 3))\<cdot>(Leaf\<cdot>(Def 4)))" |
29992 | 81 |
|
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
82 |
fixrec tree2 :: "int lift tree" |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
83 |
where "tree2 = Node\<cdot>(Node\<cdot>(Leaf\<cdot>(Def 1))\<cdot>(Leaf\<cdot>(Def 2))) |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
84 |
\<cdot>(Node\<cdot>\<bottom>\<cdot>(Leaf\<cdot>(Def 4)))" |
29992 | 85 |
|
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
86 |
fixrec tree3 :: "int lift tree" |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
87 |
where "tree3 = Node\<cdot>(Node\<cdot>(Leaf\<cdot>(Def 1))\<cdot>tree3) |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
88 |
\<cdot>(Node\<cdot>(Leaf\<cdot>(Def 3))\<cdot>(Leaf\<cdot>(Def 4)))" |
29992 | 89 |
|
90 |
declare tree1_simps tree2_simps tree3_simps [simp del] |
|
91 |
||
92 |
lemma pick_tree1: |
|
93 |
"pick\<cdot>tree1 = {Def 1, Def 2, Def 3, Def 4}\<natural>" |
|
94 |
apply (subst tree1_simps) |
|
95 |
apply simp |
|
96 |
apply (simp add: convex_plus_ac) |
|
97 |
done |
|
98 |
||
99 |
lemma pick_tree2: |
|
100 |
"pick\<cdot>tree2 = {Def 1, Def 2, \<bottom>, Def 4}\<natural>" |
|
101 |
apply (subst tree2_simps) |
|
102 |
apply simp |
|
103 |
apply (simp add: convex_plus_ac) |
|
104 |
done |
|
105 |
||
106 |
lemma pick_tree3: |
|
107 |
"pick\<cdot>tree3 = {Def 1, \<bottom>, Def 3, Def 4}\<natural>" |
|
108 |
apply (subst tree3_simps) |
|
109 |
apply simp |
|
110 |
apply (induct rule: tree3_induct) |
|
111 |
apply simp |
|
112 |
apply simp |
|
113 |
apply (simp add: convex_plus_ac) |
|
114 |
apply simp |
|
115 |
apply (simp add: convex_plus_ac) |
|
116 |
done |
|
117 |
||
118 |
end |