-
Notifications
You must be signed in to change notification settings - Fork 510
Expand file tree
/
Copy pathmap1.golden.pir
More file actions
193 lines (193 loc) · 6.52 KB
/
Copy pathmap1.golden.pir
File metadata and controls
193 lines (193 loc) · 6.52 KB
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
letrec
data (List :: * -> *) a | List_match where
Nil : List a
Cons : a -> List a -> List a
in
letrec
!`$dmenumFromTo_$cenumFromTo` : integer -> integer -> List integer
= \(x : integer) (lim : integer) ->
case
(all dead. List integer)
(case bool (lessThanEqualsInteger x lim) [True, False])
[ (/\dead ->
Cons
{integer}
x
(`$dmenumFromTo_$cenumFromTo` (addInteger 1 x) lim))
, (/\dead -> Nil {integer}) ]
{all dead. dead}
in
let
data (Tuple :: * -> * -> * -> * -> * -> *) a b c d e | Tuple_match where
Tuple5 : a -> b -> c -> d -> e -> Tuple a b c d e
data (Maybe :: * -> *) a | Maybe_match where
Just : a -> Maybe a
Nothing : Maybe a
!lookup :
all k a.
(\a -> a -> data) k ->
(\a -> data -> a) a ->
k ->
(\k a -> list (pair data data)) k a ->
Maybe a
= /\k a ->
\(`$dToData` : (\a -> a -> data) k)
(`$dUnsafeFromData` : (\a -> data -> a) a)
(ds : k)
(ds : (\k a -> list (pair data data)) k a) ->
Maybe_match
{data}
(let
!k : data = `$dToData` ds
in
letrec
!go : list (pair data data) -> Maybe data
= \(xs : list (pair data data)) ->
case
(Maybe data)
xs
[ (\(hd : pair data data) ->
case
(all dead. list (pair data data) -> Maybe data)
(equalsData
k
(case data hd [(\(l : data) (r : data) -> l)]))
[ (/\dead -> go)
, (/\dead ->
\(ds : list (pair data data)) ->
Just
{data}
(case
data
hd
[(\(l : data) (r : data) -> r)])) ]
{all dead. dead})
, (Nothing {data}) ]
in
go ds)
{all dead. Maybe a}
(\(a : data) -> /\dead -> Just {a} (`$dUnsafeFromData` a))
(/\dead -> Nothing {a})
{all dead. dead}
in
\(n : integer) ->
let
!nt : list (pair data data)
= (let
b = (\k a -> list (pair data data)) integer integer
in
\(k : integer -> b -> b) (z : b) ->
letrec
!go : List integer -> b
= \(ds : List integer) ->
List_match
{integer}
ds
{all dead. b}
(/\dead -> z)
(\(y : integer) (ys : List integer) ->
/\dead -> k y (go ys))
{all dead. dead}
in
\(eta : List integer) -> go eta)
(\(i : integer) ->
let
!ds : integer = addInteger n i
in
\(ds : (\k a -> list (pair data data)) integer integer) ->
let
!k : data = iData ds
!a : data = iData i
!nilCase : list (pair data data)
= mkCons {pair data data} (mkPairData k a) []
in
letrec
!go : list (pair data data) -> list (pair data data)
= \(xs : list (pair data data)) ->
case
(list (pair data data))
xs
[ (\(hd : pair data data) ->
case
(all dead.
list (pair data data) ->
list (pair data data))
(equalsData
k
(case
data
hd
[(\(l : data) (r : data) -> l)]))
[ (/\dead ->
\(eta : list (pair data data)) ->
mkCons {pair data data} hd (go eta))
, (/\dead ->
mkCons {pair data data} (mkPairData k a)) ]
{all dead. dead})
, nilCase ]
in
go ds)
(mkCons {pair data data} (mkPairData (iData n) (I 0)) [])
(`$dmenumFromTo_$cenumFromTo` 1 10)
!nt : list (pair data data)
= (let
!k : data = iData (addInteger 5 n)
in
letrec
!go : list (pair data data) -> list (pair data data)
= \(xs : list (pair data data)) ->
case
(list (pair data data))
xs
[ (\(hd : pair data data) ->
case
(all dead.
list (pair data data) -> list (pair data data))
(equalsData
k
(case data hd [(\(l : data) (r : data) -> l)]))
[ (/\dead ->
\(eta : list (pair data data)) ->
mkCons {pair data data} hd (go eta))
, (/\dead -> \(x : list (pair data data)) -> x) ]
{all dead. dead})
, [] ]
in
go)
nt
in
Tuple5
{Maybe integer}
{Maybe integer}
{Maybe integer}
{Maybe integer}
{Maybe integer}
(lookup {integer} {integer} (\(i : integer) -> iData i) unIData n nt)
(lookup
{integer}
{integer}
(\(i : integer) -> iData i)
unIData
(addInteger 5 n)
nt)
(lookup
{integer}
{integer}
(\(i : integer) -> iData i)
unIData
(addInteger 10 n)
nt)
(lookup
{integer}
{integer}
(\(i : integer) -> iData i)
unIData
(addInteger 20 n)
nt)
(lookup
{integer}
{integer}
(\(i : integer) -> iData i)
unIData
(addInteger 5 n)
nt)