author | huffman |
Mon, 22 Mar 2010 21:33:31 -0700 | |
changeset 35917 | 85b0efdcdae9 |
parent 35781 | b7738ab762b1 |
child 35918 | 68397d86d454 |
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 |
definition |
|
18 |
compare :: "int lift \<rightarrow> int lift \<rightarrow> ordering" where |
|
19 |
"compare = (FLIFT x y. if x < y then LT else if x = y then EQ else GT)" |
|
20 |
||
21 |
definition |
|
22 |
is_le :: "int lift \<rightarrow> int lift \<rightarrow> tr" where |
|
23 |
"is_le = (\<Lambda> x y. case compare\<cdot>x\<cdot>y of LT \<Rightarrow> TT | EQ \<Rightarrow> TT | GT \<Rightarrow> FF)" |
|
24 |
||
25 |
definition |
|
26 |
is_less :: "int lift \<rightarrow> int lift \<rightarrow> tr" where |
|
27 |
"is_less = (\<Lambda> x y. case compare\<cdot>x\<cdot>y of LT \<Rightarrow> TT | EQ \<Rightarrow> FF | GT \<Rightarrow> FF)" |
|
28 |
||
29 |
definition |
|
30 |
r1 :: "(int lift \<times> 'a) \<rightarrow> (int lift \<times> 'a) \<rightarrow> tr convex_pd" where |
|
31 |
"r1 = (\<Lambda> \<langle>x,_\<rangle> \<langle>y,_\<rangle>. case compare\<cdot>x\<cdot>y of |
|
32 |
LT \<Rightarrow> {TT}\<natural> | |
|
33 |
EQ \<Rightarrow> {TT, FF}\<natural> | |
|
34 |
GT \<Rightarrow> {FF}\<natural>)" |
|
35 |
||
36 |
definition |
|
37 |
r2 :: "(int lift \<times> 'a) \<rightarrow> (int lift \<times> 'a) \<rightarrow> tr convex_pd" where |
|
38 |
"r2 = (\<Lambda> \<langle>x,_\<rangle> \<langle>y,_\<rangle>. {is_le\<cdot>x\<cdot>y, is_less\<cdot>x\<cdot>y}\<natural>)" |
|
39 |
||
40 |
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)" |
|
41 |
apply (simp add: r1_def r2_def) |
|
42 |
apply (simp add: is_le_def is_less_def) |
|
35781
b7738ab762b1
renamed some lemmas generated by the domain package
huffman
parents:
35769
diff
changeset
|
43 |
apply (cases "compare\<cdot>x\<cdot>y") |
29992 | 44 |
apply simp_all |
45 |
done |
|
46 |
||
47 |
||
48 |
subsection {* Picking a leaf from a tree *} |
|
49 |
||
50 |
domain 'a tree = |
|
51 |
Node (lazy "'a tree") (lazy "'a tree") | |
|
52 |
Leaf (lazy "'a") |
|
53 |
||
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
54 |
fixrec |
29992 | 55 |
mirror :: "'a tree \<rightarrow> 'a tree" |
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
56 |
where |
29992 | 57 |
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
|
58 |
| mirror_Node: "mirror\<cdot>(Node\<cdot>l\<cdot>r) = Node\<cdot>(mirror\<cdot>r)\<cdot>(mirror\<cdot>l)" |
29992 | 59 |
|
35917 | 60 |
lemma mirror_strict [simp]: "mirror\<cdot>\<bottom> = \<bottom>" |
61 |
by fixrec_simp |
|
29992 | 62 |
|
63 |
fixrec |
|
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
64 |
pick :: "'a tree \<rightarrow> 'a convex_pd" |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
65 |
where |
29992 | 66 |
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
|
67 |
| pick_Node: "pick\<cdot>(Node\<cdot>l\<cdot>r) = pick\<cdot>l +\<natural> pick\<cdot>r" |
29992 | 68 |
|
35917 | 69 |
lemma pick_strict [simp]: "pick\<cdot>\<bottom> = \<bottom>" |
70 |
by fixrec_simp |
|
29992 | 71 |
|
72 |
lemma pick_mirror: "pick\<cdot>(mirror\<cdot>t) = pick\<cdot>t" |
|
35781
b7738ab762b1
renamed some lemmas generated by the domain package
huffman
parents:
35769
diff
changeset
|
73 |
by (induct t) (simp_all add: convex_plus_ac) |
29992 | 74 |
|
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
75 |
fixrec tree1 :: "int lift tree" |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
76 |
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
|
77 |
\<cdot>(Node\<cdot>(Leaf\<cdot>(Def 3))\<cdot>(Leaf\<cdot>(Def 4)))" |
29992 | 78 |
|
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
79 |
fixrec tree2 :: "int lift tree" |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
80 |
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
|
81 |
\<cdot>(Node\<cdot>\<bottom>\<cdot>(Leaf\<cdot>(Def 4)))" |
29992 | 82 |
|
30158
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
83 |
fixrec tree3 :: "int lift tree" |
83c50c62cf23
fixrec package uses new-style syntax and local-theory interface
huffman
parents:
29992
diff
changeset
|
84 |
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
|
85 |
\<cdot>(Node\<cdot>(Leaf\<cdot>(Def 3))\<cdot>(Leaf\<cdot>(Def 4)))" |
29992 | 86 |
|
35769 | 87 |
declare tree1.simps tree2.simps tree3.simps [simp del] |
29992 | 88 |
|
89 |
lemma pick_tree1: |
|
90 |
"pick\<cdot>tree1 = {Def 1, Def 2, Def 3, Def 4}\<natural>" |
|
35769 | 91 |
apply (subst tree1.simps) |
29992 | 92 |
apply simp |
93 |
apply (simp add: convex_plus_ac) |
|
94 |
done |
|
95 |
||
96 |
lemma pick_tree2: |
|
97 |
"pick\<cdot>tree2 = {Def 1, Def 2, \<bottom>, Def 4}\<natural>" |
|
35769 | 98 |
apply (subst tree2.simps) |
29992 | 99 |
apply simp |
100 |
apply (simp add: convex_plus_ac) |
|
101 |
done |
|
102 |
||
103 |
lemma pick_tree3: |
|
104 |
"pick\<cdot>tree3 = {Def 1, \<bottom>, Def 3, Def 4}\<natural>" |
|
35769 | 105 |
apply (subst tree3.simps) |
29992 | 106 |
apply simp |
35769 | 107 |
apply (induct rule: tree3.induct) |
29992 | 108 |
apply simp |
109 |
apply simp |
|
110 |
apply (simp add: convex_plus_ac) |
|
111 |
apply simp |
|
112 |
apply (simp add: convex_plus_ac) |
|
113 |
done |
|
114 |
||
115 |
end |