author | haftmann |
Thu, 15 Jul 2010 08:14:05 +0200 | |
changeset 37835 | d8fdbcbde4b6 |
parent 37831 | fa3a2e35c4f1 |
child 37838 | 28848d338261 |
permissions | -rw-r--r-- |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
1 |
(* Title: HOL/Imperative_HOL/Heap_Monad.thy |
26170 | 2 |
Author: John Matthews, Galois Connections; Alexander Krauss, Lukas Bulwahn & Florian Haftmann, TU Muenchen |
3 |
*) |
|
4 |
||
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
5 |
header {* A monad with a polymorphic heap and primitive reasoning infrastructure *} |
26170 | 6 |
|
7 |
theory Heap_Monad |
|
37792 | 8 |
imports Heap Monad_Syntax |
26170 | 9 |
begin |
10 |
||
11 |
subsection {* The monad *} |
|
12 |
||
37758 | 13 |
subsubsection {* Monad construction *} |
26170 | 14 |
|
15 |
text {* Monadic heap actions either produce values |
|
16 |
and transform the heap, or fail *} |
|
37709 | 17 |
datatype 'a Heap = Heap "heap \<Rightarrow> ('a \<times> heap) option" |
26170 | 18 |
|
37709 | 19 |
primrec execute :: "'a Heap \<Rightarrow> heap \<Rightarrow> ('a \<times> heap) option" where |
20 |
[code del]: "execute (Heap f) = f" |
|
26170 | 21 |
|
37758 | 22 |
lemma Heap_cases [case_names succeed fail]: |
23 |
fixes f and h |
|
24 |
assumes succeed: "\<And>x h'. execute f h = Some (x, h') \<Longrightarrow> P" |
|
25 |
assumes fail: "execute f h = None \<Longrightarrow> P" |
|
26 |
shows P |
|
27 |
using assms by (cases "execute f h") auto |
|
28 |
||
26170 | 29 |
lemma Heap_execute [simp]: |
30 |
"Heap (execute f) = f" by (cases f) simp_all |
|
31 |
||
32 |
lemma Heap_eqI: |
|
33 |
"(\<And>h. execute f h = execute g h) \<Longrightarrow> f = g" |
|
34 |
by (cases f, cases g) (auto simp: expand_fun_eq) |
|
35 |
||
37758 | 36 |
ML {* structure Execute_Simps = Named_Thms( |
37 |
val name = "execute_simps" |
|
38 |
val description = "simplification rules for execute" |
|
39 |
) *} |
|
40 |
||
41 |
setup Execute_Simps.setup |
|
42 |
||
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
43 |
lemma execute_Let [execute_simps]: |
37758 | 44 |
"execute (let x = t in f x) = (let x = t in execute (f x))" |
45 |
by (simp add: Let_def) |
|
46 |
||
47 |
||
48 |
subsubsection {* Specialised lifters *} |
|
49 |
||
50 |
definition tap :: "(heap \<Rightarrow> 'a) \<Rightarrow> 'a Heap" where |
|
51 |
[code del]: "tap f = Heap (\<lambda>h. Some (f h, h))" |
|
52 |
||
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
53 |
lemma execute_tap [execute_simps]: |
37758 | 54 |
"execute (tap f) h = Some (f h, h)" |
55 |
by (simp add: tap_def) |
|
26170 | 56 |
|
37709 | 57 |
definition heap :: "(heap \<Rightarrow> 'a \<times> heap) \<Rightarrow> 'a Heap" where |
58 |
[code del]: "heap f = Heap (Some \<circ> f)" |
|
26170 | 59 |
|
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
60 |
lemma execute_heap [execute_simps]: |
37709 | 61 |
"execute (heap f) = Some \<circ> f" |
26170 | 62 |
by (simp add: heap_def) |
63 |
||
37754 | 64 |
definition guard :: "(heap \<Rightarrow> bool) \<Rightarrow> (heap \<Rightarrow> 'a \<times> heap) \<Rightarrow> 'a Heap" where |
65 |
[code del]: "guard P f = Heap (\<lambda>h. if P h then Some (f h) else None)" |
|
66 |
||
37758 | 67 |
lemma execute_guard [execute_simps]: |
37754 | 68 |
"\<not> P h \<Longrightarrow> execute (guard P f) h = None" |
69 |
"P h \<Longrightarrow> execute (guard P f) h = Some (f h)" |
|
70 |
by (simp_all add: guard_def) |
|
71 |
||
37758 | 72 |
|
73 |
subsubsection {* Predicate classifying successful computations *} |
|
74 |
||
75 |
definition success :: "'a Heap \<Rightarrow> heap \<Rightarrow> bool" where |
|
76 |
"success f h \<longleftrightarrow> execute f h \<noteq> None" |
|
77 |
||
78 |
lemma successI: |
|
79 |
"execute f h \<noteq> None \<Longrightarrow> success f h" |
|
80 |
by (simp add: success_def) |
|
81 |
||
82 |
lemma successE: |
|
83 |
assumes "success f h" |
|
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
84 |
obtains r h' where "r = fst (the (execute c h))" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
85 |
and "h' = snd (the (execute c h))" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
86 |
and "execute f h \<noteq> None" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
87 |
using assms by (simp add: success_def) |
37758 | 88 |
|
89 |
ML {* structure Success_Intros = Named_Thms( |
|
90 |
val name = "success_intros" |
|
91 |
val description = "introduction rules for success" |
|
92 |
) *} |
|
93 |
||
94 |
setup Success_Intros.setup |
|
95 |
||
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
96 |
lemma success_tapI [success_intros]: |
37758 | 97 |
"success (tap f) h" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
98 |
by (rule successI) (simp add: execute_simps) |
37758 | 99 |
|
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
100 |
lemma success_heapI [success_intros]: |
37758 | 101 |
"success (heap f) h" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
102 |
by (rule successI) (simp add: execute_simps) |
37758 | 103 |
|
104 |
lemma success_guardI [success_intros]: |
|
105 |
"P h \<Longrightarrow> success (guard P f) h" |
|
106 |
by (rule successI) (simp add: execute_guard) |
|
107 |
||
108 |
lemma success_LetI [success_intros]: |
|
109 |
"x = t \<Longrightarrow> success (f x) h \<Longrightarrow> success (let x = t in f x) h" |
|
110 |
by (simp add: Let_def) |
|
111 |
||
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
112 |
lemma success_ifI: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
113 |
"(c \<Longrightarrow> success t h) \<Longrightarrow> (\<not> c \<Longrightarrow> success e h) \<Longrightarrow> |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
114 |
success (if c then t else e) h" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
115 |
by (simp add: success_def) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
116 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
117 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
118 |
subsubsection {* Predicate for a simple relational calculus *} |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
119 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
120 |
text {* |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
121 |
The @{text crel} predicate states that when a computation @{text c} |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
122 |
runs with the heap @{text h} will result in return value @{text r} |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
123 |
and a heap @{text "h'"}, i.e.~no exception occurs. |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
124 |
*} |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
125 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
126 |
definition crel :: "'a Heap \<Rightarrow> heap \<Rightarrow> heap \<Rightarrow> 'a \<Rightarrow> bool" where |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
127 |
crel_def: "crel c h h' r \<longleftrightarrow> Heap_Monad.execute c h = Some (r, h')" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
128 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
129 |
lemma crelI: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
130 |
"Heap_Monad.execute c h = Some (r, h') \<Longrightarrow> crel c h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
131 |
by (simp add: crel_def) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
132 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
133 |
lemma crelE: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
134 |
assumes "crel c h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
135 |
obtains "r = fst (the (execute c h))" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
136 |
and "h' = snd (the (execute c h))" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
137 |
and "success c h" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
138 |
proof (rule that) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
139 |
from assms have *: "execute c h = Some (r, h')" by (simp add: crel_def) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
140 |
then show "success c h" by (simp add: success_def) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
141 |
from * have "fst (the (execute c h)) = r" and "snd (the (execute c h)) = h'" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
142 |
by simp_all |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
143 |
then show "r = fst (the (execute c h))" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
144 |
and "h' = snd (the (execute c h))" by simp_all |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
145 |
qed |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
146 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
147 |
lemma crel_success: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
148 |
"crel c h h' r \<Longrightarrow> success c h" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
149 |
by (simp add: crel_def success_def) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
150 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
151 |
lemma success_crelE: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
152 |
assumes "success c h" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
153 |
obtains r h' where "crel c h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
154 |
using assms by (auto simp add: crel_def success_def) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
155 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
156 |
lemma crel_deterministic: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
157 |
assumes "crel f h h' a" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
158 |
and "crel f h h'' b" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
159 |
shows "a = b" and "h' = h''" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
160 |
using assms unfolding crel_def by auto |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
161 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
162 |
ML {* structure Crel_Intros = Named_Thms( |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
163 |
val name = "crel_intros" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
164 |
val description = "introduction rules for crel" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
165 |
) *} |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
166 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
167 |
ML {* structure Crel_Elims = Named_Thms( |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
168 |
val name = "crel_elims" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
169 |
val description = "elimination rules for crel" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
170 |
) *} |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
171 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
172 |
setup "Crel_Intros.setup #> Crel_Elims.setup" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
173 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
174 |
lemma crel_LetI [crel_intros]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
175 |
assumes "x = t" "crel (f x) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
176 |
shows "crel (let x = t in f x) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
177 |
using assms by simp |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
178 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
179 |
lemma crel_LetE [crel_elims]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
180 |
assumes "crel (let x = t in f x) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
181 |
obtains "crel (f t) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
182 |
using assms by simp |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
183 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
184 |
lemma crel_ifI: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
185 |
assumes "c \<Longrightarrow> crel t h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
186 |
and "\<not> c \<Longrightarrow> crel e h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
187 |
shows "crel (if c then t else e) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
188 |
by (cases c) (simp_all add: assms) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
189 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
190 |
lemma crel_ifE: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
191 |
assumes "crel (if c then t else e) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
192 |
obtains "c" "crel t h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
193 |
| "\<not> c" "crel e h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
194 |
using assms by (cases c) simp_all |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
195 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
196 |
lemma crel_tapI [crel_intros]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
197 |
assumes "h' = h" "r = f h" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
198 |
shows "crel (tap f) h h' r" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
199 |
by (rule crelI) (simp add: assms execute_simps) |
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
200 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
201 |
lemma crel_tapE [crel_elims]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
202 |
assumes "crel (tap f) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
203 |
obtains "h' = h" and "r = f h" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
204 |
using assms by (rule crelE) (auto simp add: execute_simps) |
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
205 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
206 |
lemma crel_heapI [crel_intros]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
207 |
assumes "h' = snd (f h)" "r = fst (f h)" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
208 |
shows "crel (heap f) h h' r" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
209 |
by (rule crelI) (simp add: assms execute_simps) |
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
210 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
211 |
lemma crel_heapE [crel_elims]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
212 |
assumes "crel (heap f) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
213 |
obtains "h' = snd (f h)" and "r = fst (f h)" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
214 |
using assms by (rule crelE) (simp add: execute_simps) |
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
215 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
216 |
lemma crel_guardI [crel_intros]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
217 |
assumes "P h" "h' = snd (f h)" "r = fst (f h)" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
218 |
shows "crel (guard P f) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
219 |
by (rule crelI) (simp add: assms execute_simps) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
220 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
221 |
lemma crel_guardE [crel_elims]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
222 |
assumes "crel (guard P f) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
223 |
obtains "h' = snd (f h)" "r = fst (f h)" "P h" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
224 |
using assms by (rule crelE) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
225 |
(auto simp add: execute_simps elim!: successE, cases "P h", auto simp add: execute_simps) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
226 |
|
37758 | 227 |
|
228 |
subsubsection {* Monad combinators *} |
|
26170 | 229 |
|
37709 | 230 |
definition return :: "'a \<Rightarrow> 'a Heap" where |
26170 | 231 |
[code del]: "return x = heap (Pair x)" |
232 |
||
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
233 |
lemma execute_return [execute_simps]: |
37709 | 234 |
"execute (return x) = Some \<circ> Pair x" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
235 |
by (simp add: return_def execute_simps) |
26170 | 236 |
|
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
237 |
lemma success_returnI [success_intros]: |
37758 | 238 |
"success (return x) h" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
239 |
by (rule successI) (simp add: execute_simps) |
37758 | 240 |
|
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
241 |
lemma crel_returnI [crel_intros]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
242 |
"h = h' \<Longrightarrow> crel (return x) h h' x" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
243 |
by (rule crelI) (simp add: execute_simps) |
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
244 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
245 |
lemma crel_returnE [crel_elims]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
246 |
assumes "crel (return x) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
247 |
obtains "r = x" "h' = h" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
248 |
using assms by (rule crelE) (simp add: execute_simps) |
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
249 |
|
37709 | 250 |
definition raise :: "string \<Rightarrow> 'a Heap" where -- {* the string is just decoration *} |
251 |
[code del]: "raise s = Heap (\<lambda>_. None)" |
|
26170 | 252 |
|
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
253 |
lemma execute_raise [execute_simps]: |
37709 | 254 |
"execute (raise s) = (\<lambda>_. None)" |
26170 | 255 |
by (simp add: raise_def) |
256 |
||
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
257 |
lemma crel_raiseE [crel_elims]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
258 |
assumes "crel (raise x) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
259 |
obtains "False" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
260 |
using assms by (rule crelE) (simp add: success_def execute_simps) |
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
261 |
|
37792 | 262 |
definition bind :: "'a Heap \<Rightarrow> ('a \<Rightarrow> 'b Heap) \<Rightarrow> 'b Heap" where |
263 |
[code del]: "bind f g = Heap (\<lambda>h. case execute f h of |
|
37709 | 264 |
Some (x, h') \<Rightarrow> execute (g x) h' |
265 |
| None \<Rightarrow> None)" |
|
266 |
||
37792 | 267 |
setup {* |
268 |
Adhoc_Overloading.add_variant |
|
37816 | 269 |
@{const_name Monad_Syntax.bind} @{const_name Heap_Monad.bind} |
37792 | 270 |
*} |
271 |
||
37758 | 272 |
lemma execute_bind [execute_simps]: |
37709 | 273 |
"execute f h = Some (x, h') \<Longrightarrow> execute (f \<guillemotright>= g) h = execute (g x) h'" |
274 |
"execute f h = None \<Longrightarrow> execute (f \<guillemotright>= g) h = None" |
|
37756
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
275 |
by (simp_all add: bind_def) |
37709 | 276 |
|
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
277 |
lemma execute_bind_success: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
278 |
"success f h \<Longrightarrow> execute (f \<guillemotright>= g) h = execute (g (fst (the (execute f h)))) (snd (the (execute f h)))" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
279 |
by (cases f h rule: Heap_cases) (auto elim!: successE simp add: bind_def) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
280 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
281 |
lemma success_bind_executeI: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
282 |
"execute f h = Some (x, h') \<Longrightarrow> success (g x) h' \<Longrightarrow> success (f \<guillemotright>= g) h" |
37758 | 283 |
by (auto intro!: successI elim!: successE simp add: bind_def) |
284 |
||
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
285 |
lemma success_bind_crelI [success_intros]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
286 |
"crel f h h' x \<Longrightarrow> success (g x) h' \<Longrightarrow> success (f \<guillemotright>= g) h" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
287 |
by (auto simp add: crel_def success_def bind_def) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
288 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
289 |
lemma crel_bindI [crel_intros]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
290 |
assumes "crel f h h' r" "crel (g r) h' h'' r'" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
291 |
shows "crel (f \<guillemotright>= g) h h'' r'" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
292 |
using assms |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
293 |
apply (auto intro!: crelI elim!: crelE successE) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
294 |
apply (subst execute_bind, simp_all) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
295 |
done |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
296 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
297 |
lemma crel_bindE [crel_elims]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
298 |
assumes "crel (f \<guillemotright>= g) h h'' r'" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
299 |
obtains h' r where "crel f h h' r" "crel (g r) h' h'' r'" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
300 |
using assms by (auto simp add: crel_def bind_def split: option.split_asm) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
301 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
302 |
lemma execute_bind_eq_SomeI: |
37754 | 303 |
assumes "Heap_Monad.execute f h = Some (x, h')" |
304 |
and "Heap_Monad.execute (g x) h' = Some (y, h'')" |
|
305 |
shows "Heap_Monad.execute (f \<guillemotright>= g) h = Some (y, h'')" |
|
37756
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
306 |
using assms by (simp add: bind_def) |
37754 | 307 |
|
37709 | 308 |
lemma return_bind [simp]: "return x \<guillemotright>= f = f x" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
309 |
by (rule Heap_eqI) (simp add: execute_bind execute_simps) |
37709 | 310 |
|
311 |
lemma bind_return [simp]: "f \<guillemotright>= return = f" |
|
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
312 |
by (rule Heap_eqI) (simp add: bind_def execute_simps split: option.splits) |
37709 | 313 |
|
37828 | 314 |
lemma bind_bind [simp]: "(f \<guillemotright>= g) \<guillemotright>= k = (f :: 'a Heap) \<guillemotright>= (\<lambda>x. g x \<guillemotright>= k)" |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
315 |
by (rule Heap_eqI) (simp add: bind_def execute_simps split: option.splits) |
37709 | 316 |
|
317 |
lemma raise_bind [simp]: "raise e \<guillemotright>= f = raise e" |
|
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
318 |
by (rule Heap_eqI) (simp add: execute_simps) |
37709 | 319 |
|
26170 | 320 |
|
37758 | 321 |
subsection {* Generic combinators *} |
26170 | 322 |
|
37758 | 323 |
subsubsection {* Assertions *} |
26170 | 324 |
|
37709 | 325 |
definition assert :: "('a \<Rightarrow> bool) \<Rightarrow> 'a \<Rightarrow> 'a Heap" where |
326 |
"assert P x = (if P x then return x else raise ''assert'')" |
|
28742 | 327 |
|
37758 | 328 |
lemma execute_assert [execute_simps]: |
37754 | 329 |
"P x \<Longrightarrow> execute (assert P x) h = Some (x, h)" |
330 |
"\<not> P x \<Longrightarrow> execute (assert P x) h = None" |
|
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
331 |
by (simp_all add: assert_def execute_simps) |
37754 | 332 |
|
37758 | 333 |
lemma success_assertI [success_intros]: |
334 |
"P x \<Longrightarrow> success (assert P x) h" |
|
335 |
by (rule successI) (simp add: execute_assert) |
|
336 |
||
37771
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
337 |
lemma crel_assertI [crel_intros]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
338 |
"P x \<Longrightarrow> h' = h \<Longrightarrow> r = x \<Longrightarrow> crel (assert P x) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
339 |
by (rule crelI) (simp add: execute_assert) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
340 |
|
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
341 |
lemma crel_assertE [crel_elims]: |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
342 |
assumes "crel (assert P x) h h' r" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
343 |
obtains "P x" "r = x" "h' = h" |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
344 |
using assms by (rule crelE) (cases "P x", simp_all add: execute_assert success_def) |
1bec64044b5e
spelt out relational framework in a consistent way
haftmann
parents:
37758
diff
changeset
|
345 |
|
28742 | 346 |
lemma assert_cong [fundef_cong]: |
347 |
assumes "P = P'" |
|
348 |
assumes "\<And>x. P' x \<Longrightarrow> f x = f' x" |
|
349 |
shows "(assert P x >>= f) = (assert P' x >>= f')" |
|
37754 | 350 |
by (rule Heap_eqI) (insert assms, simp add: assert_def) |
28742 | 351 |
|
37758 | 352 |
|
353 |
subsubsection {* Plain lifting *} |
|
354 |
||
37754 | 355 |
definition lift :: "('a \<Rightarrow> 'b) \<Rightarrow> 'a \<Rightarrow> 'b Heap" where |
356 |
"lift f = return o f" |
|
37709 | 357 |
|
37754 | 358 |
lemma lift_collapse [simp]: |
359 |
"lift f x = return (f x)" |
|
360 |
by (simp add: lift_def) |
|
37709 | 361 |
|
37754 | 362 |
lemma bind_lift: |
363 |
"(f \<guillemotright>= lift g) = (f \<guillemotright>= (\<lambda>x. return (g x)))" |
|
364 |
by (simp add: lift_def comp_def) |
|
37709 | 365 |
|
37758 | 366 |
|
367 |
subsubsection {* Iteration -- warning: this is rarely useful! *} |
|
368 |
||
37756
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
369 |
primrec fold_map :: "('a \<Rightarrow> 'b Heap) \<Rightarrow> 'a list \<Rightarrow> 'b list Heap" where |
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
370 |
"fold_map f [] = return []" |
37792 | 371 |
| "fold_map f (x # xs) = do { |
37709 | 372 |
y \<leftarrow> f x; |
37756
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
373 |
ys \<leftarrow> fold_map f xs; |
37709 | 374 |
return (y # ys) |
37792 | 375 |
}" |
37709 | 376 |
|
37756
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
377 |
lemma fold_map_append: |
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
378 |
"fold_map f (xs @ ys) = fold_map f xs \<guillemotright>= (\<lambda>xs. fold_map f ys \<guillemotright>= (\<lambda>ys. return (xs @ ys)))" |
37754 | 379 |
by (induct xs) simp_all |
380 |
||
37758 | 381 |
lemma execute_fold_map_unchanged_heap [execute_simps]: |
37754 | 382 |
assumes "\<And>x. x \<in> set xs \<Longrightarrow> \<exists>y. execute (f x) h = Some (y, h)" |
37756
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
383 |
shows "execute (fold_map f xs) h = |
37754 | 384 |
Some (List.map (\<lambda>x. fst (the (execute (f x) h))) xs, h)" |
385 |
using assms proof (induct xs) |
|
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
386 |
case Nil show ?case by (simp add: execute_simps) |
37754 | 387 |
next |
388 |
case (Cons x xs) |
|
389 |
from Cons.prems obtain y |
|
390 |
where y: "execute (f x) h = Some (y, h)" by auto |
|
37756
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
391 |
moreover from Cons.prems Cons.hyps have "execute (fold_map f xs) h = |
37754 | 392 |
Some (map (\<lambda>x. fst (the (execute (f x) h))) xs, h)" by auto |
37787
30dc3abf4a58
theorem collections do not contain default rules any longer
haftmann
parents:
37772
diff
changeset
|
393 |
ultimately show ?case by (simp, simp only: execute_bind(1), simp add: execute_simps) |
37754 | 394 |
qed |
395 |
||
26182 | 396 |
subsection {* Code generator setup *} |
397 |
||
398 |
subsubsection {* Logical intermediate layer *} |
|
399 |
||
37709 | 400 |
primrec raise' :: "String.literal \<Rightarrow> 'a Heap" where |
401 |
[code del, code_post]: "raise' (STR s) = raise s" |
|
26182 | 402 |
|
37709 | 403 |
lemma raise_raise' [code_inline]: |
404 |
"raise s = raise' (STR s)" |
|
405 |
by simp |
|
26182 | 406 |
|
37709 | 407 |
code_datatype raise' -- {* avoid @{const "Heap"} formally *} |
26182 | 408 |
|
409 |
||
27707 | 410 |
subsubsection {* SML and OCaml *} |
26182 | 411 |
|
26752 | 412 |
code_type Heap (SML "unit/ ->/ _") |
37828 | 413 |
code_const bind (SML "!(fn/ f'_/ =>/ fn/ ()/ =>/ f'_/ (_/ ())/ ())") |
27707 | 414 |
code_const return (SML "!(fn/ ()/ =>/ _)") |
37709 | 415 |
code_const Heap_Monad.raise' (SML "!(raise/ Fail/ _)") |
26182 | 416 |
|
37754 | 417 |
code_type Heap (OCaml "unit/ ->/ _") |
37828 | 418 |
code_const bind (OCaml "!(fun/ f'_/ ()/ ->/ f'_/ (_/ ())/ ())") |
27707 | 419 |
code_const return (OCaml "!(fun/ ()/ ->/ _)") |
37828 | 420 |
code_const Heap_Monad.raise' (OCaml "failwith") |
27707 | 421 |
|
31871 | 422 |
setup {* |
423 |
||
424 |
let |
|
27707 | 425 |
|
31871 | 426 |
open Code_Thingol; |
427 |
||
428 |
fun imp_program naming = |
|
27707 | 429 |
|
31871 | 430 |
let |
431 |
fun is_const c = case lookup_const naming c |
|
432 |
of SOME c' => (fn c'' => c' = c'') |
|
433 |
| NONE => K false; |
|
37756
59caa6180fff
avoid slightly odd "M" suffix; rename mapM to fold_map (fold_map_abort would be more correct, though)
haftmann
parents:
37754
diff
changeset
|
434 |
val is_bind = is_const @{const_name bind}; |
31871 | 435 |
val is_return = is_const @{const_name return}; |
31893 | 436 |
val dummy_name = ""; |
31871 | 437 |
val dummy_type = ITyVar dummy_name; |
31893 | 438 |
val dummy_case_term = IVar NONE; |
31871 | 439 |
(*assumption: dummy values are not relevant for serialization*) |
440 |
val unitt = case lookup_const naming @{const_name Unity} |
|
441 |
of SOME unit' => IConst (unit', (([], []), [])) |
|
442 |
| NONE => error ("Must include " ^ @{const_name Unity} ^ " in generated constants."); |
|
443 |
fun dest_abs ((v, ty) `|=> t, _) = ((v, ty), t) |
|
444 |
| dest_abs (t, ty) = |
|
445 |
let |
|
446 |
val vs = fold_varnames cons t []; |
|
447 |
val v = Name.variant vs "x"; |
|
448 |
val ty' = (hd o fst o unfold_fun) ty; |
|
31893 | 449 |
in ((SOME v, ty'), t `$ IVar (SOME v)) end; |
31871 | 450 |
fun force (t as IConst (c, _) `$ t') = if is_return c |
451 |
then t' else t `$ unitt |
|
452 |
| force t = t `$ unitt; |
|
453 |
fun tr_bind' [(t1, _), (t2, ty2)] = |
|
454 |
let |
|
455 |
val ((v, ty), t) = dest_abs (t2, ty2); |
|
456 |
in ICase (((force t1, ty), [(IVar v, tr_bind'' t)]), dummy_case_term) end |
|
457 |
and tr_bind'' t = case unfold_app t |
|
37754 | 458 |
of (IConst (c, (_, ty1 :: ty2 :: _)), [x1, x2]) => if is_bind c |
31871 | 459 |
then tr_bind' [(x1, ty1), (x2, ty2)] |
460 |
else force t |
|
461 |
| _ => force t; |
|
31893 | 462 |
fun imp_monad_bind'' ts = (SOME dummy_name, dummy_type) `|=> ICase (((IVar (SOME dummy_name), dummy_type), |
31871 | 463 |
[(unitt, tr_bind' ts)]), dummy_case_term) |
37754 | 464 |
and imp_monad_bind' (const as (c, (_, tys))) ts = if is_bind c then case (ts, tys) |
31871 | 465 |
of ([t1, t2], ty1 :: ty2 :: _) => imp_monad_bind'' [(t1, ty1), (t2, ty2)] |
466 |
| ([t1, t2, t3], ty1 :: ty2 :: _) => imp_monad_bind'' [(t1, ty1), (t2, ty2)] `$ t3 |
|
467 |
| (ts, _) => imp_monad_bind (eta_expand 2 (const, ts)) |
|
468 |
else IConst const `$$ map imp_monad_bind ts |
|
469 |
and imp_monad_bind (IConst const) = imp_monad_bind' const [] |
|
470 |
| imp_monad_bind (t as IVar _) = t |
|
471 |
| imp_monad_bind (t as _ `$ _) = (case unfold_app t |
|
472 |
of (IConst const, ts) => imp_monad_bind' const ts |
|
473 |
| (t, ts) => imp_monad_bind t `$$ map imp_monad_bind ts) |
|
474 |
| imp_monad_bind (v_ty `|=> t) = v_ty `|=> imp_monad_bind t |
|
475 |
| imp_monad_bind (ICase (((t, ty), pats), t0)) = ICase |
|
476 |
(((imp_monad_bind t, ty), |
|
477 |
(map o pairself) imp_monad_bind pats), |
|
478 |
imp_monad_bind t0); |
|
28663
bd8438543bf2
code identifier namings are no longer imperative
haftmann
parents:
28562
diff
changeset
|
479 |
|
31871 | 480 |
in (Graph.map_nodes o map_terms_stmt) imp_monad_bind end; |
27707 | 481 |
|
482 |
in |
|
483 |
||
31871 | 484 |
Code_Target.extend_target ("SML_imp", ("SML", imp_program)) |
485 |
#> Code_Target.extend_target ("OCaml_imp", ("OCaml", imp_program)) |
|
27707 | 486 |
|
487 |
end |
|
31871 | 488 |
|
27707 | 489 |
*} |
490 |
||
26182 | 491 |
|
492 |
subsubsection {* Haskell *} |
|
493 |
||
494 |
text {* Adaption layer *} |
|
495 |
||
29793 | 496 |
code_include Haskell "Heap" |
26182 | 497 |
{*import qualified Control.Monad; |
498 |
import qualified Control.Monad.ST; |
|
499 |
import qualified Data.STRef; |
|
500 |
import qualified Data.Array.ST; |
|
501 |
||
27695 | 502 |
type RealWorld = Control.Monad.ST.RealWorld; |
26182 | 503 |
type ST s a = Control.Monad.ST.ST s a; |
504 |
type STRef s a = Data.STRef.STRef s a; |
|
27673 | 505 |
type STArray s a = Data.Array.ST.STArray s Int a; |
26182 | 506 |
|
507 |
newSTRef = Data.STRef.newSTRef; |
|
508 |
readSTRef = Data.STRef.readSTRef; |
|
509 |
writeSTRef = Data.STRef.writeSTRef; |
|
510 |
||
37831
fa3a2e35c4f1
repaired some implementations of imperative operations
haftmann
parents:
37828
diff
changeset
|
511 |
newArray :: Int -> a -> ST s (STArray s a); |
fa3a2e35c4f1
repaired some implementations of imperative operations
haftmann
parents:
37828
diff
changeset
|
512 |
newArray k = Data.Array.ST.newArray (0, k); |
26182 | 513 |
|
37831
fa3a2e35c4f1
repaired some implementations of imperative operations
haftmann
parents:
37828
diff
changeset
|
514 |
newListArray :: [a] -> ST s (STArray s a); |
fa3a2e35c4f1
repaired some implementations of imperative operations
haftmann
parents:
37828
diff
changeset
|
515 |
newListArray xs = Data.Array.ST.newListArray (0, length xs) xs; |
fa3a2e35c4f1
repaired some implementations of imperative operations
haftmann
parents:
37828
diff
changeset
|
516 |
|
fa3a2e35c4f1
repaired some implementations of imperative operations
haftmann
parents:
37828
diff
changeset
|
517 |
newFunArray :: Int -> (Int -> a) -> ST s (STArray s a); |
fa3a2e35c4f1
repaired some implementations of imperative operations
haftmann
parents:
37828
diff
changeset
|
518 |
newFunArray k f = Data.Array.ST.newListArray (0, k) (map f [0..k-1]); |
26182 | 519 |
|
27673 | 520 |
lengthArray :: STArray s a -> ST s Int; |
521 |
lengthArray a = Control.Monad.liftM snd (Data.Array.ST.getBounds a); |
|
26182 | 522 |
|
27673 | 523 |
readArray :: STArray s a -> Int -> ST s a; |
26182 | 524 |
readArray = Data.Array.ST.readArray; |
525 |
||
27673 | 526 |
writeArray :: STArray s a -> Int -> a -> ST s (); |
26182 | 527 |
writeArray = Data.Array.ST.writeArray;*} |
528 |
||
29793 | 529 |
code_reserved Haskell Heap |
26182 | 530 |
|
531 |
text {* Monad *} |
|
532 |
||
29793 | 533 |
code_type Heap (Haskell "Heap.ST/ Heap.RealWorld/ _") |
37792 | 534 |
code_monad bind Haskell |
26182 | 535 |
code_const return (Haskell "return") |
37828 | 536 |
code_const Heap_Monad.raise' (Haskell "error") |
26182 | 537 |
|
37758 | 538 |
hide_const (open) Heap heap guard raise' fold_map |
37724 | 539 |
|
26170 | 540 |
end |