blob: c15c5e4bc64c8113f92ae19c2e1a06041c2e3339 (
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
|
-- THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS
-- [paper]
import Base
open Primitives
namespace paper
/- [paper::ref_incr]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def ref_incr (x : I32) : Result I32 :=
x + (I32.ofInt 1)
/- [paper::test_incr]: forward function -/
def test_incr : Result Unit :=
do
let x ← ref_incr (I32.ofInt 0)
if not (x = (I32.ofInt 1))
then Result.fail Error.panic
else Result.ret ()
/- Unit test for [paper::test_incr] -/
#assert (test_incr == .ret ())
/- [paper::choose]: forward function -/
def choose (T : Type) (b : Bool) (x : T) (y : T) : Result T :=
if b
then Result.ret x
else Result.ret y
/- [paper::choose]: backward function 0 -/
def choose_back
(T : Type) (b : Bool) (x : T) (y : T) (ret0 : T) : Result (T × T) :=
if b
then Result.ret (ret0, y)
else Result.ret (x, ret0)
/- [paper::test_choose]: forward function -/
def test_choose : Result Unit :=
do
let z ← choose I32 true (I32.ofInt 0) (I32.ofInt 0)
let z0 ← z + (I32.ofInt 1)
if not (z0 = (I32.ofInt 1))
then Result.fail Error.panic
else
do
let (x, y) ← choose_back I32 true (I32.ofInt 0) (I32.ofInt 0) z0
if not (x = (I32.ofInt 1))
then Result.fail Error.panic
else
if not (y = (I32.ofInt 0))
then Result.fail Error.panic
else Result.ret ()
/- Unit test for [paper::test_choose] -/
#assert (test_choose == .ret ())
/- [paper::List] -/
inductive List (T : Type) :=
| Cons : T → List T → List T
| Nil : List T
/- [paper::list_nth_mut]: forward function -/
divergent def list_nth_mut (T : Type) (l : List T) (i : U32) : Result T :=
match l with
| List.Cons x tl =>
if i = (U32.ofInt 0)
then Result.ret x
else do
let i0 ← i - (U32.ofInt 1)
list_nth_mut T tl i0
| List.Nil => Result.fail Error.panic
/- [paper::list_nth_mut]: backward function 0 -/
divergent def list_nth_mut_back
(T : Type) (l : List T) (i : U32) (ret0 : T) : Result (List T) :=
match l with
| List.Cons x tl =>
if i = (U32.ofInt 0)
then Result.ret (List.Cons ret0 tl)
else
do
let i0 ← i - (U32.ofInt 1)
let tl0 ← list_nth_mut_back T tl i0 ret0
Result.ret (List.Cons x tl0)
| List.Nil => Result.fail Error.panic
/- [paper::sum]: forward function -/
divergent def sum (l : List I32) : Result I32 :=
match l with
| List.Cons x tl => do
let i ← sum tl
x + i
| List.Nil => Result.ret (I32.ofInt 0)
/- [paper::test_nth]: forward function -/
def test_nth : Result Unit :=
do
let l := List.Nil
let l0 := List.Cons (I32.ofInt 3) l
let l1 := List.Cons (I32.ofInt 2) l0
let x ← list_nth_mut I32 (List.Cons (I32.ofInt 1) l1) (U32.ofInt 2)
let x0 ← x + (I32.ofInt 1)
let l2 ←
list_nth_mut_back I32 (List.Cons (I32.ofInt 1) l1) (U32.ofInt 2) x0
let i ← sum l2
if not (i = (I32.ofInt 7))
then Result.fail Error.panic
else Result.ret ()
/- Unit test for [paper::test_nth] -/
#assert (test_nth == .ret ())
/- [paper::call_choose]: forward function -/
def call_choose (p : (U32 × U32)) : Result U32 :=
do
let (px, py) := p
let pz ← choose U32 true px py
let pz0 ← pz + (U32.ofInt 1)
let (px0, _) ← choose_back U32 true px py pz0
Result.ret px0
end paper
|
