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
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
|
-- THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS
-- [no_nested_borrows]
import Base
open Primitives
namespace no_nested_borrows
/- [no_nested_borrows::Pair]
Source: 'tests/src/no_nested_borrows.rs', lines 6:0-6:23 -/
structure Pair (T1 T2 : Type) where
x : T1
y : T2
/- [no_nested_borrows::List]
Source: 'tests/src/no_nested_borrows.rs', lines 11:0-11:16 -/
inductive List (T : Type) :=
| Cons : T → List T → List T
| Nil : List T
/- [no_nested_borrows::One]
Source: 'tests/src/no_nested_borrows.rs', lines 22:0-22:16 -/
inductive One (T1 : Type) :=
| One : T1 → One T1
/- [no_nested_borrows::EmptyEnum]
Source: 'tests/src/no_nested_borrows.rs', lines 28:0-28:18 -/
inductive EmptyEnum :=
| Empty : EmptyEnum
/- [no_nested_borrows::Enum]
Source: 'tests/src/no_nested_borrows.rs', lines 34:0-34:13 -/
inductive Enum :=
| Variant1 : Enum
| Variant2 : Enum
/- [no_nested_borrows::EmptyStruct]
Source: 'tests/src/no_nested_borrows.rs', lines 41:0-41:22 -/
@[reducible] def EmptyStruct := Unit
/- [no_nested_borrows::Sum]
Source: 'tests/src/no_nested_borrows.rs', lines 43:0-43:20 -/
inductive Sum (T1 T2 : Type) :=
| Left : T1 → Sum T1 T2
| Right : T2 → Sum T1 T2
/- [no_nested_borrows::cast_u32_to_i32]:
Source: 'tests/src/no_nested_borrows.rs', lines 48:0-48:37 -/
def cast_u32_to_i32 (x : U32) : Result I32 :=
Scalar.cast .I32 x
/- [no_nested_borrows::cast_bool_to_i32]:
Source: 'tests/src/no_nested_borrows.rs', lines 52:0-52:39 -/
def cast_bool_to_i32 (x : Bool) : Result I32 :=
Scalar.cast_bool .I32 x
/- [no_nested_borrows::cast_bool_to_bool]:
Source: 'tests/src/no_nested_borrows.rs', lines 57:0-57:41 -/
def cast_bool_to_bool (x : Bool) : Result Bool :=
Result.ok x
/- [no_nested_borrows::test2]:
Source: 'tests/src/no_nested_borrows.rs', lines 62:0-62:14 -/
def test2 : Result Unit :=
do
let _ ← 23#u32 + 44#u32
Result.ok ()
/- Unit test for [no_nested_borrows::test2] -/
#assert (test2 == Result.ok ())
/- [no_nested_borrows::get_max]:
Source: 'tests/src/no_nested_borrows.rs', lines 74:0-74:37 -/
def get_max (x : U32) (y : U32) : Result U32 :=
if x >= y
then Result.ok x
else Result.ok y
/- [no_nested_borrows::test3]:
Source: 'tests/src/no_nested_borrows.rs', lines 82:0-82:14 -/
def test3 : Result Unit :=
do
let x ← get_max 4#u32 3#u32
let y ← get_max 10#u32 11#u32
let z ← x + y
if ¬ (z = 15#u32)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::test3] -/
#assert (test3 == Result.ok ())
/- [no_nested_borrows::test_neg1]:
Source: 'tests/src/no_nested_borrows.rs', lines 89:0-89:18 -/
def test_neg1 : Result Unit :=
do
let y ← -. 3#i32
if ¬ (y = (-3)#i32)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::test_neg1] -/
#assert (test_neg1 == Result.ok ())
/- [no_nested_borrows::refs_test1]:
Source: 'tests/src/no_nested_borrows.rs', lines 96:0-96:19 -/
def refs_test1 : Result Unit :=
if ¬ (1#i32 = 1#i32)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::refs_test1] -/
#assert (refs_test1 == Result.ok ())
/- [no_nested_borrows::refs_test2]:
Source: 'tests/src/no_nested_borrows.rs', lines 107:0-107:19 -/
def refs_test2 : Result Unit :=
if ¬ (2#i32 = 2#i32)
then Result.fail .panic
else
if ¬ (0#i32 = 0#i32)
then Result.fail .panic
else
if ¬ (2#i32 = 2#i32)
then Result.fail .panic
else if ¬ (2#i32 = 2#i32)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::refs_test2] -/
#assert (refs_test2 == Result.ok ())
/- [no_nested_borrows::test_list1]:
Source: 'tests/src/no_nested_borrows.rs', lines 123:0-123:19 -/
def test_list1 : Result Unit :=
Result.ok ()
/- Unit test for [no_nested_borrows::test_list1] -/
#assert (test_list1 == Result.ok ())
/- [no_nested_borrows::test_box1]:
Source: 'tests/src/no_nested_borrows.rs', lines 128:0-128:18 -/
def test_box1 : Result Unit :=
do
let (_, deref_mut_back) ← alloc.boxed.Box.deref_mut I32 0#i32
let b ← deref_mut_back 1#i32
let x ← alloc.boxed.Box.deref I32 b
if ¬ (x = 1#i32)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::test_box1] -/
#assert (test_box1 == Result.ok ())
/- [no_nested_borrows::copy_int]:
Source: 'tests/src/no_nested_borrows.rs', lines 138:0-138:30 -/
def copy_int (x : I32) : Result I32 :=
Result.ok x
/- [no_nested_borrows::test_unreachable]:
Source: 'tests/src/no_nested_borrows.rs', lines 144:0-144:32 -/
def test_unreachable (b : Bool) : Result Unit :=
if b
then Result.fail .panic
else Result.ok ()
/- [no_nested_borrows::test_panic]:
Source: 'tests/src/no_nested_borrows.rs', lines 152:0-152:26 -/
def test_panic (b : Bool) : Result Unit :=
if b
then Result.fail .panic
else Result.ok ()
/- [no_nested_borrows::test_copy_int]:
Source: 'tests/src/no_nested_borrows.rs', lines 159:0-159:22 -/
def test_copy_int : Result Unit :=
do
let y ← copy_int 0#i32
if ¬ (0#i32 = y)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::test_copy_int] -/
#assert (test_copy_int == Result.ok ())
/- [no_nested_borrows::is_cons]:
Source: 'tests/src/no_nested_borrows.rs', lines 166:0-166:38 -/
def is_cons (T : Type) (l : List T) : Result Bool :=
match l with
| List.Cons _ _ => Result.ok true
| List.Nil => Result.ok false
/- [no_nested_borrows::test_is_cons]:
Source: 'tests/src/no_nested_borrows.rs', lines 173:0-173:21 -/
def test_is_cons : Result Unit :=
do
let b ← is_cons I32 (List.Cons 0#i32 List.Nil)
if ¬ b
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::test_is_cons] -/
#assert (test_is_cons == Result.ok ())
/- [no_nested_borrows::split_list]:
Source: 'tests/src/no_nested_borrows.rs', lines 179:0-179:48 -/
def split_list (T : Type) (l : List T) : Result (T × (List T)) :=
match l with
| List.Cons hd tl => Result.ok (hd, tl)
| List.Nil => Result.fail .panic
/- [no_nested_borrows::test_split_list]:
Source: 'tests/src/no_nested_borrows.rs', lines 187:0-187:24 -/
def test_split_list : Result Unit :=
do
let p ← split_list I32 (List.Cons 0#i32 List.Nil)
let (hd, _) := p
if ¬ (hd = 0#i32)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::test_split_list] -/
#assert (test_split_list == Result.ok ())
/- [no_nested_borrows::choose]:
Source: 'tests/src/no_nested_borrows.rs', lines 194:0-194:70 -/
def choose
(T : Type) (b : Bool) (x : T) (y : T) :
Result (T × (T → Result (T × T)))
:=
if b
then let back := fun ret => Result.ok (ret, y)
Result.ok (x, back)
else let back := fun ret => Result.ok (x, ret)
Result.ok (y, back)
/- [no_nested_borrows::choose_test]:
Source: 'tests/src/no_nested_borrows.rs', lines 202:0-202:20 -/
def choose_test : Result Unit :=
do
let (z, choose_back) ← choose I32 true 0#i32 0#i32
let z1 ← z + 1#i32
if ¬ (z1 = 1#i32)
then Result.fail .panic
else
do
let (x, y) ← choose_back z1
if ¬ (x = 1#i32)
then Result.fail .panic
else if ¬ (y = 0#i32)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::choose_test] -/
#assert (choose_test == Result.ok ())
/- [no_nested_borrows::test_char]:
Source: 'tests/src/no_nested_borrows.rs', lines 214:0-214:26 -/
def test_char : Result Char :=
Result.ok 'a'
mutual
/- [no_nested_borrows::Tree]
Source: 'tests/src/no_nested_borrows.rs', lines 219:0-219:16 -/
inductive Tree (T : Type) :=
| Leaf : T → Tree T
| Node : T → NodeElem T → Tree T → Tree T
/- [no_nested_borrows::NodeElem]
Source: 'tests/src/no_nested_borrows.rs', lines 224:0-224:20 -/
inductive NodeElem (T : Type) :=
| Cons : Tree T → NodeElem T → NodeElem T
| Nil : NodeElem T
end
/- [no_nested_borrows::list_length]:
Source: 'tests/src/no_nested_borrows.rs', lines 259:0-259:48 -/
divergent def list_length (T : Type) (l : List T) : Result U32 :=
match l with
| List.Cons _ l1 => do
let i ← list_length T l1
1#u32 + i
| List.Nil => Result.ok 0#u32
/- [no_nested_borrows::list_nth_shared]:
Source: 'tests/src/no_nested_borrows.rs', lines 267:0-267:62 -/
divergent def list_nth_shared (T : Type) (l : List T) (i : U32) : Result T :=
match l with
| List.Cons x tl =>
if i = 0#u32
then Result.ok x
else do
let i1 ← i - 1#u32
list_nth_shared T tl i1
| List.Nil => Result.fail .panic
/- [no_nested_borrows::list_nth_mut]:
Source: 'tests/src/no_nested_borrows.rs', lines 283:0-283:67 -/
divergent def list_nth_mut
(T : Type) (l : List T) (i : U32) : Result (T × (T → Result (List T))) :=
match l with
| List.Cons x tl =>
if i = 0#u32
then
let back := fun ret => Result.ok (List.Cons ret tl)
Result.ok (x, back)
else
do
let i1 ← i - 1#u32
let (t, list_nth_mut_back) ← list_nth_mut T tl i1
let back :=
fun ret =>
do
let tl1 ← list_nth_mut_back ret
Result.ok (List.Cons x tl1)
Result.ok (t, back)
| List.Nil => Result.fail .panic
/- [no_nested_borrows::list_rev_aux]:
Source: 'tests/src/no_nested_borrows.rs', lines 299:0-299:63 -/
divergent def list_rev_aux
(T : Type) (li : List T) (lo : List T) : Result (List T) :=
match li with
| List.Cons hd tl => list_rev_aux T tl (List.Cons hd lo)
| List.Nil => Result.ok lo
/- [no_nested_borrows::list_rev]:
Source: 'tests/src/no_nested_borrows.rs', lines 313:0-313:42 -/
def list_rev (T : Type) (l : List T) : Result (List T) :=
let (li, _) := core.mem.replace (List T) l List.Nil
list_rev_aux T li List.Nil
/- [no_nested_borrows::test_list_functions]:
Source: 'tests/src/no_nested_borrows.rs', lines 318:0-318:28 -/
def test_list_functions : Result Unit :=
do
let l := List.Cons 2#i32 List.Nil
let l1 := List.Cons 1#i32 l
let i ← list_length I32 (List.Cons 0#i32 l1)
if ¬ (i = 3#u32)
then Result.fail .panic
else
do
let i1 ← list_nth_shared I32 (List.Cons 0#i32 l1) 0#u32
if ¬ (i1 = 0#i32)
then Result.fail .panic
else
do
let i2 ← list_nth_shared I32 (List.Cons 0#i32 l1) 1#u32
if ¬ (i2 = 1#i32)
then Result.fail .panic
else
do
let i3 ← list_nth_shared I32 (List.Cons 0#i32 l1) 2#u32
if ¬ (i3 = 2#i32)
then Result.fail .panic
else
do
let (_, list_nth_mut_back) ←
list_nth_mut I32 (List.Cons 0#i32 l1) 1#u32
let ls ← list_nth_mut_back 3#i32
let i4 ← list_nth_shared I32 ls 0#u32
if ¬ (i4 = 0#i32)
then Result.fail .panic
else
do
let i5 ← list_nth_shared I32 ls 1#u32
if ¬ (i5 = 3#i32)
then Result.fail .panic
else
do
let i6 ← list_nth_shared I32 ls 2#u32
if ¬ (i6 = 2#i32)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::test_list_functions] -/
#assert (test_list_functions == Result.ok ())
/- [no_nested_borrows::id_mut_pair1]:
Source: 'tests/src/no_nested_borrows.rs', lines 334:0-334:89 -/
def id_mut_pair1
(T1 T2 : Type) (x : T1) (y : T2) :
Result ((T1 × T2) × ((T1 × T2) → Result (T1 × T2)))
:=
Result.ok ((x, y), Result.ok)
/- [no_nested_borrows::id_mut_pair2]:
Source: 'tests/src/no_nested_borrows.rs', lines 338:0-338:88 -/
def id_mut_pair2
(T1 T2 : Type) (p : (T1 × T2)) :
Result ((T1 × T2) × ((T1 × T2) → Result (T1 × T2)))
:=
let (t, t1) := p
Result.ok ((t, t1), Result.ok)
/- [no_nested_borrows::id_mut_pair3]:
Source: 'tests/src/no_nested_borrows.rs', lines 342:0-342:93 -/
def id_mut_pair3
(T1 T2 : Type) (x : T1) (y : T2) :
Result ((T1 × T2) × (T1 → Result T1) × (T2 → Result T2))
:=
Result.ok ((x, y), Result.ok, Result.ok)
/- [no_nested_borrows::id_mut_pair4]:
Source: 'tests/src/no_nested_borrows.rs', lines 346:0-346:92 -/
def id_mut_pair4
(T1 T2 : Type) (p : (T1 × T2)) :
Result ((T1 × T2) × (T1 → Result T1) × (T2 → Result T2))
:=
let (t, t1) := p
Result.ok ((t, t1), Result.ok, Result.ok)
/- [no_nested_borrows::StructWithTuple]
Source: 'tests/src/no_nested_borrows.rs', lines 353:0-353:34 -/
structure StructWithTuple (T1 T2 : Type) where
p : (T1 × T2)
/- [no_nested_borrows::new_tuple1]:
Source: 'tests/src/no_nested_borrows.rs', lines 357:0-357:48 -/
def new_tuple1 : Result (StructWithTuple U32 U32) :=
Result.ok { p := (1#u32, 2#u32) }
/- [no_nested_borrows::new_tuple2]:
Source: 'tests/src/no_nested_borrows.rs', lines 361:0-361:48 -/
def new_tuple2 : Result (StructWithTuple I16 I16) :=
Result.ok { p := (1#i16, 2#i16) }
/- [no_nested_borrows::new_tuple3]:
Source: 'tests/src/no_nested_borrows.rs', lines 365:0-365:48 -/
def new_tuple3 : Result (StructWithTuple U64 I64) :=
Result.ok { p := (1#u64, 2#i64) }
/- [no_nested_borrows::StructWithPair]
Source: 'tests/src/no_nested_borrows.rs', lines 370:0-370:33 -/
structure StructWithPair (T1 T2 : Type) where
p : Pair T1 T2
/- [no_nested_borrows::new_pair1]:
Source: 'tests/src/no_nested_borrows.rs', lines 374:0-374:46 -/
def new_pair1 : Result (StructWithPair U32 U32) :=
Result.ok { p := { x := 1#u32, y := 2#u32 } }
/- [no_nested_borrows::test_constants]:
Source: 'tests/src/no_nested_borrows.rs', lines 382:0-382:23 -/
def test_constants : Result Unit :=
do
let swt ← new_tuple1
let (i, _) := swt.p
if ¬ (i = 1#u32)
then Result.fail .panic
else
do
let swt1 ← new_tuple2
let (i1, _) := swt1.p
if ¬ (i1 = 1#i16)
then Result.fail .panic
else
do
let swt2 ← new_tuple3
let (i2, _) := swt2.p
if ¬ (i2 = 1#u64)
then Result.fail .panic
else
do
let swp ← new_pair1
if ¬ (swp.p.x = 1#u32)
then Result.fail .panic
else Result.ok ()
/- Unit test for [no_nested_borrows::test_constants] -/
#assert (test_constants == Result.ok ())
/- [no_nested_borrows::test_weird_borrows1]:
Source: 'tests/src/no_nested_borrows.rs', lines 391:0-391:28 -/
def test_weird_borrows1 : Result Unit :=
Result.ok ()
/- Unit test for [no_nested_borrows::test_weird_borrows1] -/
#assert (test_weird_borrows1 == Result.ok ())
/- [no_nested_borrows::test_mem_replace]:
Source: 'tests/src/no_nested_borrows.rs', lines 401:0-401:37 -/
def test_mem_replace (px : U32) : Result U32 :=
let (y, _) := core.mem.replace U32 px 1#u32
if ¬ (y = 0#u32)
then Result.fail .panic
else Result.ok 2#u32
/- [no_nested_borrows::test_shared_borrow_bool1]:
Source: 'tests/src/no_nested_borrows.rs', lines 408:0-408:47 -/
def test_shared_borrow_bool1 (b : Bool) : Result U32 :=
if b
then Result.ok 0#u32
else Result.ok 1#u32
/- [no_nested_borrows::test_shared_borrow_bool2]:
Source: 'tests/src/no_nested_borrows.rs', lines 421:0-421:40 -/
def test_shared_borrow_bool2 : Result U32 :=
Result.ok 0#u32
/- [no_nested_borrows::test_shared_borrow_enum1]:
Source: 'tests/src/no_nested_borrows.rs', lines 436:0-436:52 -/
def test_shared_borrow_enum1 (l : List U32) : Result U32 :=
match l with
| List.Cons _ _ => Result.ok 1#u32
| List.Nil => Result.ok 0#u32
/- [no_nested_borrows::test_shared_borrow_enum2]:
Source: 'tests/src/no_nested_borrows.rs', lines 448:0-448:40 -/
def test_shared_borrow_enum2 : Result U32 :=
Result.ok 0#u32
/- [no_nested_borrows::incr]:
Source: 'tests/src/no_nested_borrows.rs', lines 459:0-459:24 -/
def incr (x : U32) : Result U32 :=
x + 1#u32
/- [no_nested_borrows::call_incr]:
Source: 'tests/src/no_nested_borrows.rs', lines 463:0-463:35 -/
def call_incr (x : U32) : Result U32 :=
incr x
/- [no_nested_borrows::read_then_incr]:
Source: 'tests/src/no_nested_borrows.rs', lines 468:0-468:41 -/
def read_then_incr (x : U32) : Result (U32 × U32) :=
do
let x1 ← x + 1#u32
Result.ok (x, x1)
/- [no_nested_borrows::Tuple]
Source: 'tests/src/no_nested_borrows.rs', lines 474:0-474:24 -/
def Tuple (T1 T2 : Type) := T1 × T2
/- [no_nested_borrows::use_tuple_struct]:
Source: 'tests/src/no_nested_borrows.rs', lines 476:0-476:48 -/
def use_tuple_struct (x : Tuple U32 U32) : Result (Tuple U32 U32) :=
Result.ok (1#u32, x.#1)
/- [no_nested_borrows::create_tuple_struct]:
Source: 'tests/src/no_nested_borrows.rs', lines 480:0-480:61 -/
def create_tuple_struct (x : U32) (y : U64) : Result (Tuple U32 U64) :=
Result.ok (x, y)
/- [no_nested_borrows::IdType]
Source: 'tests/src/no_nested_borrows.rs', lines 485:0-485:20 -/
@[reducible] def IdType (T : Type) := T
/- [no_nested_borrows::use_id_type]:
Source: 'tests/src/no_nested_borrows.rs', lines 487:0-487:40 -/
def use_id_type (T : Type) (x : IdType T) : Result T :=
Result.ok x
/- [no_nested_borrows::create_id_type]:
Source: 'tests/src/no_nested_borrows.rs', lines 491:0-491:43 -/
def create_id_type (T : Type) (x : T) : Result (IdType T) :=
Result.ok x
end no_nested_borrows
|