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
|
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
(** [paper] *)
module Paper
open Primitives
#set-options "--z3rlimit 50 --fuel 1 --ifuel 1"
(** [paper::ref_incr]: merged forward/backward function
(there is a single backward function, and the forward function returns ())
Source: 'src/paper.rs', lines 4:0-4:28 *)
let ref_incr (x : i32) : result i32 =
i32_add x 1
(** [paper::test_incr]: forward function
Source: 'src/paper.rs', lines 8:0-8:18 *)
let test_incr : result unit =
let* x = ref_incr 0 in if not (x = 1) then Fail Failure else Return ()
(** Unit test for [paper::test_incr] *)
let _ = assert_norm (test_incr = Return ())
(** [paper::choose]: forward function
Source: 'src/paper.rs', lines 15:0-15:70 *)
let choose (t : Type0) (b : bool) (x : t) (y : t) : result t =
if b then Return x else Return y
(** [paper::choose]: backward function 0
Source: 'src/paper.rs', lines 15:0-15:70 *)
let choose_back
(t : Type0) (b : bool) (x : t) (y : t) (ret : t) : result (t & t) =
if b then Return (ret, y) else Return (x, ret)
(** [paper::test_choose]: forward function
Source: 'src/paper.rs', lines 23:0-23:20 *)
let test_choose : result unit =
let* z = choose i32 true 0 0 in
let* z1 = i32_add z 1 in
if not (z1 = 1)
then Fail Failure
else
let* (x, y) = choose_back i32 true 0 0 z1 in
if not (x = 1)
then Fail Failure
else if not (y = 0) then Fail Failure else Return ()
(** Unit test for [paper::test_choose] *)
let _ = assert_norm (test_choose = Return ())
(** [paper::List]
Source: 'src/paper.rs', lines 35:0-35:16 *)
type list_t (t : Type0) =
| List_Cons : t -> list_t t -> list_t t
| List_Nil : list_t t
(** [paper::list_nth_mut]: forward function
Source: 'src/paper.rs', lines 42:0-42:67 *)
let rec list_nth_mut (t : Type0) (l : list_t t) (i : u32) : result t =
begin match l with
| List_Cons x tl ->
if i = 0 then Return x else let* i1 = u32_sub i 1 in list_nth_mut t tl i1
| List_Nil -> Fail Failure
end
(** [paper::list_nth_mut]: backward function 0
Source: 'src/paper.rs', lines 42:0-42:67 *)
let rec list_nth_mut_back
(t : Type0) (l : list_t t) (i : u32) (ret : t) : result (list_t t) =
begin match l with
| List_Cons x tl ->
if i = 0
then Return (List_Cons ret tl)
else
let* i1 = u32_sub i 1 in
let* tl1 = list_nth_mut_back t tl i1 ret in
Return (List_Cons x tl1)
| List_Nil -> Fail Failure
end
(** [paper::sum]: forward function
Source: 'src/paper.rs', lines 57:0-57:32 *)
let rec sum (l : list_t i32) : result i32 =
begin match l with
| List_Cons x tl -> let* i = sum tl in i32_add x i
| List_Nil -> Return 0
end
(** [paper::test_nth]: forward function
Source: 'src/paper.rs', lines 68:0-68:17 *)
let test_nth : result unit =
let l = List_Cons 3 List_Nil in
let l1 = List_Cons 2 l in
let* x = list_nth_mut i32 (List_Cons 1 l1) 2 in
let* x1 = i32_add x 1 in
let* l2 = list_nth_mut_back i32 (List_Cons 1 l1) 2 x1 in
let* i = sum l2 in
if not (i = 7) then Fail Failure else Return ()
(** Unit test for [paper::test_nth] *)
let _ = assert_norm (test_nth = Return ())
(** [paper::call_choose]: forward function
Source: 'src/paper.rs', lines 76:0-76:44 *)
let call_choose (p : (u32 & u32)) : result u32 =
let (px, py) = p in
let* pz = choose u32 true px py in
let* pz1 = u32_add pz 1 in
let* (px1, _) = choose_back u32 true px py pz1 in
Return px1
|
