-
Notifications
You must be signed in to change notification settings - Fork 510
Expand file tree
/
Copy pathmap2.golden.pir
More file actions
255 lines (255 loc) · 9.32 KB
/
Copy pathmap2.golden.pir
File metadata and controls
255 lines (255 loc) · 9.32 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
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
let
data (Tuple2 :: * -> * -> *) a b | Tuple2_match where
Tuple2 : a -> b -> Tuple2 a b
in
letrec
data (List :: * -> *) a | List_match where
Nil : List a
Cons : a -> List a -> List a
in
letrec
!go : list (pair data data) -> List (Tuple2 integer integer)
= \(xs : list (pair data data)) ->
case
(List (Tuple2 integer integer))
xs
[ (\(hd : pair data data) (tl : list (pair data data)) ->
Cons
{Tuple2 integer integer}
(Tuple2
{integer}
{integer}
(unIData (case data hd [(\(l : data) (r : data) -> l)]))
(unIData (case data hd [(\(l : data) (r : data) -> r)])))
(go tl))
, (Nil {Tuple2 integer integer}) ]
in
letrec
!go : list (pair data data) -> list (pair data data) -> list (pair data data)
= \(acc : list (pair data data)) (xs : list (pair data data)) ->
case
(list (pair data data))
xs
[(\(hd : pair data data) -> go (mkCons {pair data data} hd acc)), acc]
in
let
data (Maybe :: * -> *) a | Maybe_match where
Just : a -> Maybe a
Nothing : Maybe a
in
letrec
!goList : List (Tuple2 data data) -> list (pair data data)
= \(ds : List (Tuple2 data data)) ->
List_match
{Tuple2 data data}
ds
{list (pair data data)}
[]
(\(d : Tuple2 data data) (ds : List (Tuple2 data data)) ->
mkCons
{pair data data}
(Tuple2_match
{data}
{data}
d
{pair data data}
(\(d : data) (d : data) -> mkPairData d d))
(goList ds))
in
let
!unsafeFromSOPList :
all k a.
(\a -> a -> data) k ->
(\a -> a -> data) a ->
List (Tuple2 k a) ->
(\k a -> list (pair data data)) k a
= /\k a ->
\(`$dToData` : (\a -> a -> data) k)
(`$dToData` : (\a -> a -> data) a) ->
letrec
!go : List (Tuple2 k a) -> List (Tuple2 data data)
= \(ds : List (Tuple2 k a)) ->
List_match
{Tuple2 k a}
ds
{all dead. List (Tuple2 data data)}
(/\dead -> Nil {Tuple2 data data})
(\(x : Tuple2 k a) (xs : List (Tuple2 k a)) ->
/\dead ->
Cons
{Tuple2 data data}
(Tuple2_match
{k}
{a}
x
{Tuple2 data data}
(\(k : k) (a : a) ->
Tuple2
{data}
{data}
(`$dToData` k)
(`$dToData` a)))
(go xs))
{all dead. dead}
in
\(eta : List (Tuple2 k a)) -> goList (go eta)
in
\(n : integer) ->
let
!nt : list (pair data data)
= unsafeFromSOPList
{integer}
{integer}
(\(i : integer) -> iData i)
(\(i : integer) -> iData i)
((let
a = Tuple2 integer integer
in
\(g : all b. (a -> b -> b) -> b -> b) ->
g {List a} (\(ds : a) (ds : List a) -> Cons {a} ds ds) (Nil {a}))
(/\a ->
\(c : Tuple2 integer integer -> a -> a) (n : a) ->
c
(Tuple2 {integer} {integer} (addInteger 3 n) 33)
(c
(Tuple2 {integer} {integer} (addInteger 4 n) 44)
(c
(Tuple2 {integer} {integer} (addInteger 6 n) 66)
(c
(Tuple2 {integer} {integer} (addInteger 7 n) 77)
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) (tl : list (pair data data)) ->
let
!v' : data = case data hd [(\(l : data) (r : data) -> r)]
!k' : data = case data hd [(\(l : data) (r : data) -> l)]
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
Maybe_match
{data}
(go nt)
{all dead. list (pair data data)}
(\(r : data) ->
/\dead ->
mkCons
{pair data data}
(mkPairData
k'
(iData (addInteger (unIData v') (unIData r))))
(go tl))
(/\dead ->
mkCons {pair data data} (mkPairData k' v') (go tl))
{all dead. dead})
, [] ]
in
let
!nt : list (pair data data)
= unsafeFromSOPList
{integer}
{integer}
(\(i : integer) -> iData i)
(\(i : integer) -> iData i)
((let
a = Tuple2 integer integer
in
\(g : all b. (a -> b -> b) -> b -> b) ->
g {List a} (\(ds : a) (ds : List a) -> Cons {a} ds ds) (Nil {a}))
(/\a ->
\(c : Tuple2 integer integer -> a -> a) (n : a) ->
c
(Tuple2 {integer} {integer} (addInteger 1 n) 1)
(c
(Tuple2 {integer} {integer} (addInteger 2 n) 2)
(c
(Tuple2 {integer} {integer} (addInteger 3 n) 3)
(c
(Tuple2 {integer} {integer} (addInteger 4 n) 4)
(c
(Tuple2 {integer} {integer} (addInteger 5 n) 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) (tl : list (pair data data)) ->
let
!tl' : list (pair data data) = go tl
in
case
(all dead. list (pair data data))
(let
!k : data = case data hd [(\(l : data) (r : data) -> l)]
in
letrec
!go : list (pair data data) -> bool
= \(xs : list (pair data data)) ->
case
bool
xs
[ (\(hd : pair data data) ->
case
(all dead. list (pair data data) -> bool)
(equalsData
k
(case
data
hd
[(\(l : data) (r : data) -> l)]))
[ (/\dead -> go)
, (/\dead ->
\(ds : list (pair data data)) ->
True) ]
{all dead. dead})
, False ]
in
go nt)
[(/\dead -> mkCons {pair data data} hd tl'), (/\dead -> tl')]
{all dead. dead})
, [] ]
in
let
!nt : list (pair data data)
= let
!rs' : list (pair data data) = go nt
!ls' : list (pair data data) = go nt
in
go rs' ls'
in
go nt