blob: 05d1f70fcd8d30c4dd91847834b17a4a74c90278 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
|
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
(** [loops]: function definitions *)
module Loops.Funs
open Primitives
include Loops.Types
include Loops.Clauses
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [loops::sum] *)
let rec sum_loop_fwd
(max : u32) (i : u32) (s : u32) :
Tot (result u32) (decreases (sum_decreases max i s))
=
if i < max
then
begin match u32_add s i with
| Fail e -> Fail e
| Return s0 ->
begin match u32_add i 1 with
| Fail e -> Fail e
| Return i0 -> sum_loop_fwd max i0 s0
end
end
else u32_mul s 2
(** [loops::sum] *)
let sum_fwd (max : u32) : result u32 = sum_loop_fwd max 0 0
(** [loops::sum_with_borrows] *)
let rec sum_with_borrows_loop_fwd
(max : u32) (mi : u32) (ms : u32) :
Tot (result u32) (decreases (sum_with_borrows_decreases max mi ms))
=
if mi < max
then
begin match u32_add ms mi with
| Fail e -> Fail e
| Return ms0 ->
begin match u32_add mi 1 with
| Fail e -> Fail e
| Return mi0 -> sum_with_borrows_loop_fwd max mi0 ms0
end
end
else u32_mul ms 2
(** [loops::sum_with_borrows] *)
let sum_with_borrows_fwd (max : u32) : result u32 =
sum_with_borrows_loop_fwd max 0 0
(** [loops::list_nth_mut_loop] *)
let rec list_nth_mut_loop_loop_fwd
(t : Type0) (ls : list_t t) (i : u32) :
Tot (result t) (decreases (list_nth_mut_loop_decreases t ls i))
=
begin match ls with
| ListCons x tl ->
if i = 0
then Return x
else
begin match u32_sub i 1 with
| Fail e -> Fail e
| Return i0 -> list_nth_mut_loop_loop_fwd t tl i0
end
| ListNil -> Fail Failure
end
(** [loops::list_nth_mut_loop] *)
let list_nth_mut_loop_fwd (t : Type0) (ls : list_t t) (i : u32) : result t =
list_nth_mut_loop_loop_fwd t ls i
(** [loops::list_nth_mut_loop] *)
let rec list_nth_mut_loop_loop_back
(t : Type0) (ls : list_t t) (i : u32) (ret : t) :
Tot (result (list_t t)) (decreases (list_nth_mut_loop_decreases t ls i))
=
begin match ls with
| ListCons x tl ->
if i = 0
then Return (ListCons ret tl)
else
begin match u32_sub i 1 with
| Fail e -> Fail e
| Return i0 ->
begin match list_nth_mut_loop_loop_back t tl i0 ret with
| Fail e -> Fail e
| Return l -> Return (ListCons x l)
end
end
| ListNil -> Fail Failure
end
(** [loops::list_nth_mut_loop] *)
let list_nth_mut_loop_back
(t : Type0) (ls : list_t t) (i : u32) (ret : t) : result (list_t t) =
list_nth_mut_loop_loop_back t ls i ret
(** [loops::list_nth_mut_loop_pair] *)
let rec list_nth_mut_loop_pair_loop_fwd
(t : Type0) (l : list_t t) (l0 : list_t t) (i : u32) :
Tot (result (t & t)) (decreases (list_nth_mut_loop_pair_decreases t l l0 i))
=
begin match l with
| ListCons x0 tl0 ->
begin match l0 with
| ListCons x1 tl1 ->
if i = 0
then Return (x0, x1)
else
begin match u32_sub i 1 with
| Fail e -> Fail e
| Return i0 -> list_nth_mut_loop_pair_loop_fwd t tl0 tl1 i0
end
| ListNil -> Fail Failure
end
| ListNil -> Fail Failure
end
(** [loops::list_nth_mut_loop_pair] *)
let list_nth_mut_loop_pair_fwd
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) : result (t & t) =
list_nth_mut_loop_pair_loop_fwd t ls0 ls1 i
(** [loops::list_nth_mut_loop_pair] *)
let rec list_nth_mut_loop_pair_loop_back'a
(t : Type0) (l : list_t t) (l0 : list_t t) (i : u32) (ret : t) :
Tot (result (list_t t))
(decreases (list_nth_mut_loop_pair_decreases t l l0 i))
=
begin match l with
| ListCons x0 tl0 ->
begin match l0 with
| ListCons x1 tl1 ->
if i = 0
then Return (ListCons ret tl0)
else
begin match u32_sub i 1 with
| Fail e -> Fail e
| Return i0 ->
begin match list_nth_mut_loop_pair_loop_back'a t tl0 tl1 i0 ret with
| Fail e -> Fail e
| Return l1 -> Return (ListCons x0 l1)
end
end
| ListNil -> Fail Failure
end
| ListNil -> Fail Failure
end
(** [loops::list_nth_mut_loop_pair] *)
let list_nth_mut_loop_pair_back'a
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) (ret : t) :
result (list_t t)
=
list_nth_mut_loop_pair_loop_back'a t ls0 ls1 i ret
(** [loops::list_nth_mut_loop_pair] *)
let rec list_nth_mut_loop_pair_loop_back'b
(t : Type0) (l : list_t t) (l0 : list_t t) (i : u32) (ret : t) :
Tot (result (list_t t))
(decreases (list_nth_mut_loop_pair_decreases t l l0 i))
=
begin match l with
| ListCons x0 tl0 ->
begin match l0 with
| ListCons x1 tl1 ->
if i = 0
then Return (ListCons ret tl1)
else
begin match u32_sub i 1 with
| Fail e -> Fail e
| Return i0 ->
begin match list_nth_mut_loop_pair_loop_back'b t tl0 tl1 i0 ret with
| Fail e -> Fail e
| Return l1 -> Return (ListCons x1 l1)
end
end
| ListNil -> Fail Failure
end
| ListNil -> Fail Failure
end
(** [loops::list_nth_mut_loop_pair] *)
let list_nth_mut_loop_pair_back'b
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) (ret : t) :
result (list_t t)
=
list_nth_mut_loop_pair_loop_back'b t ls0 ls1 i ret
(** [loops::list_nth_mut_loop_pair_merge] *)
let rec list_nth_mut_loop_pair_merge_loop_fwd
(t : Type0) (l : list_t t) (l0 : list_t t) (i : u32) :
Tot (result (t & t))
(decreases (list_nth_mut_loop_pair_merge_decreases t l l0 i))
=
begin match l with
| ListCons x0 tl0 ->
begin match l0 with
| ListCons x1 tl1 ->
if i = 0
then Return (x0, x1)
else
begin match u32_sub i 1 with
| Fail e -> Fail e
| Return i0 -> list_nth_mut_loop_pair_merge_loop_fwd t tl0 tl1 i0
end
| ListNil -> Fail Failure
end
| ListNil -> Fail Failure
end
(** [loops::list_nth_mut_loop_pair_merge] *)
let list_nth_mut_loop_pair_merge_fwd
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) : result (t & t) =
list_nth_mut_loop_pair_merge_loop_fwd t ls0 ls1 i
(** [loops::list_nth_mut_loop_pair_merge] *)
let rec list_nth_mut_loop_pair_merge_loop_back
(t : Type0) (l : list_t t) (l0 : list_t t) (i : u32) (ret : (t & t)) :
Tot (result ((list_t t) & (list_t t)))
(decreases (list_nth_mut_loop_pair_merge_decreases t l l0 i))
=
begin match l with
| ListCons x0 tl0 ->
begin match l0 with
| ListCons x1 tl1 ->
if i = 0
then let (x, x2) = ret in Return (ListCons x tl0, ListCons x2 tl1)
else
begin match u32_sub i 1 with
| Fail e -> Fail e
| Return i0 ->
begin match list_nth_mut_loop_pair_merge_loop_back t tl0 tl1 i0 ret
with
| Fail e -> Fail e
| Return (l1, l2) -> Return (ListCons x0 l1, ListCons x1 l2)
end
end
| ListNil -> Fail Failure
end
| ListNil -> Fail Failure
end
(** [loops::list_nth_mut_loop_pair_merge] *)
let list_nth_mut_loop_pair_merge_back
(t : Type0) (ls0 : list_t t) (ls1 : list_t t) (i : u32) (ret : (t & t)) :
result ((list_t t) & (list_t t))
=
list_nth_mut_loop_pair_merge_loop_back t ls0 ls1 i ret
|
