blob: 04a6999937b1e04dda40217c09f3b061bd5ec942 (
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
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
|
(;module:
lux
(lux (data (coll [list "L/" Functor<List>])))
(luxc ["&" base]
(lang ["la" analysis]
["ls" synthesis])
## (synthesizer ["&&;" case])
))
## (do-template [<name> <comp>]
## [(def: (<name> ref)
## (-> Int Bool)
## (<comp> 0 ref))]
## [function-ref? i.=]
## [local-ref? i.>]
## [captured-ref? i.<]
## )
(def: (unfold-tuple tuple)
(-> la;Analysis (List la;Analysis))
(case tuple
(#la;Product left right)
(#;Cons left (unfold-tuple right))
_
(list tuple)))
(def: (unfold-apply apply)
(-> la;Analysis [la;Analysis (List la;Analysis)])
(loop [apply apply
args (list)]
(case apply
(#la;Apply arg func)
(recur func (#;Cons arg args))
_
[apply args])))
(def: (unfold-variant variant)
(-> (Either la;Analysis la;Analysis) [Nat Bool la;Analysis])
(loop [so-far +0
variantA variant]
(case variantA
(#;Left valueA)
(case valueA
(#la;Sum choice)
(recur (n.inc so-far) choice)
_
[so-far false valueA])
(#;Right valueA)
[(n.inc so-far) true valueA])))
## (def: (has-self-reference? exprS)
## (-> ls;Synthesis Bool)
## (case exprS
## (#ls;Tuple membersS)
## (list;any? has-self-reference? membersS)
## (#ls;Procedure name argsS)
## (list;any? has-self-reference? argsS)
## (#ls;Variant tag last? memberS)
## (has-self-reference? memberS)
## (#ls;Relative idx)
## (i.= 0 idx)
## (#ls;Recur offset argsS)
## (list;any? has-self-reference? argsS)
## (#ls;Call funcS argsS)
## (or (has-self-reference? funcS)
## (list;any? has-self-reference? argsS))
## (#ls;Let register inputS bodyS)
## (or (has-self-reference? inputS)
## (has-self-reference? bodyS))
## (#ls;If inputS thenS elseS)
## (or (has-self-reference? inputS)
## (has-self-reference? thenS)
## (has-self-reference? elseS))
## (#ls;Function num-args scope bodyS)
## (not (list;any? (i.= 0) scope))
## (#ls;Loop offset argsS bodyS)
## (or (list;any? has-self-reference? argsS)
## (has-self-reference? bodyS))
## _
## false
## ))
## (def: (shift-loop-variables scope offset exprS)
## (-> (List Int) Nat ls;Synthesis ls;Synthesis)
## (loop [exprS exprS]
## (case exprS
## (#ls;Tuple members)
## (#ls;Tuple (L/map recur members))
## (#ls;Procedure name argsS)
## (#ls;Procedure name (L/map recur argsS))
## (#ls;Variant tag last? valueS)
## (#ls;Variant tag last? (recur valueS))
## (#ls;Relative idx)
## (if (captured-ref? idx)
## (let [scope-idx (|> idx (n.+ 1) (n.* -1) int-to-nat)]
## (|> scope (list;nth scope-idx) assume #ls;Relative))
## (#ls;Relative (i.+ idx (nat-to-int offset))))
## (#ls;Recur _offset argsS)
## (#ls;Recur (n.+ offset _offset) (L/map recur argsS))
## (#ls;Call funcS argsS)
## (#ls;Call (recur funcS) (L/map recur argsS))
## (#ls;Let register inputS bodyS)
## (#ls;Let (n.+ offset register) (recur inputS) (recur bodyS))
## (#ls;If inputS thenS elseS)
## (#ls;If (recur inputS) (recur thenS) (recur elseS))
## (#ls;Function _num-args _scope _bodyS)
## ...
## (#ls;Loop _offset _argsS _bodyS)
## (#ls;Loop (n.+ offset _offset) (L/map recur _argsS) (recur _bodyS))
## _
## exprS
## )))
(def: #export (synthesize analysis)
(-> la;Analysis ls;Synthesis)
(loop [num-args +0
local-offset +0
tail? true
exprA analysis]
(case exprA
(^template [<from> <to>]
(<from> value)
(<to> value))
([#la;Unit #ls;Unit]
[#la;Bool #ls;Bool]
[#la;Nat #ls;Nat]
[#la;Int #ls;Int]
[#la;Deg #ls;Deg]
[#la;Real #ls;Real]
[#la;Char #ls;Char]
[#la;Text #ls;Text]
[#la;Absolute #ls;Absolute])
(#la;Product _)
(#ls;Tuple (L/map (recur +0 local-offset false) (unfold-tuple exprA)))
(#la;Sum choice)
(let [[tag last? value] (unfold-variant choice)]
(#ls;Variant tag last? (recur +0 local-offset false value)))
(#la;Apply _)
(let [[funcA argsA] (unfold-apply exprA)
funcS (recur +0 local-offset false funcA)
argsS (L/map (recur +0 local-offset false) argsA)]
(case funcS
## (^multi (#ls;Relative idx)
## (and (|> num-args n.dec nat-to-int (i.* -1) (i.= idx))
## tail?))
## (#ls;Recur +1 argsS)
## (^multi (#ls;Function _num-args _scope _bodyS)
## (and (n.= _num-args (list;size argsS))
## (not (has-self-reference? _bodyS))))
## (#ls;Loop local-offset argsS (shift-loop-variables local-offset _bodyS))
_
(#ls;Call funcS argsS)))
(#la;Procedure name args)
(#ls;Procedure name (L/map (recur +0 local-offset false) args))
_
(undefined)
## (#la;Relative ref)
## (case ref
## (#;Local local)
## (case local
## +0
## (if (n.> +1 num-args)
## (<| (#ls;Call (#ls;Relative 0))
## (L/map (|>. #ls;Relative))
## (list;range +1 (n.dec num-args)))
## (#ls;Relative 0))
## _
## (#ls;Relative (nat-to-int (n.+ (n.inc num-args) local))))
## (#;Captured captured)
## (#ls;Relative (|> captured nat-to-int (n.* -1) (n.+ -1))))
## (#la;Function scope bodyA)
## (case (recur (n.inc num-args) local-offset true bodyA)
## (#ls;Function num-args' scope' bodyS')
## (#ls;Function (n.inc num-args') scope bodyS')
## bodyS
## (#ls;Function +1 scope bodyS))
## (#la;Case inputA branchesA)
## (let [inputS (recur num-args local-offset false inputA)]
## (case branchesA
## (^multi (^ (list [(#lp;Bind input-register)
## (#la;Relative (#;Local output-register))]))
## (n.= input-register output-register))
## inputS
## (^ (list [(#lp;Bind register) bodyA]))
## (#ls;Let register inputS (recur num-args local-offset tail? bodyA))
## (^or (^ (list [(#lp;Bool true) thenA] [(#lp;Bool false) elseA]))
## (^ (list [(#lp;Bool false) elseA] [(#lp;Bool true) thenA])))
## (#ls;If inputS
## (recur num-args local-offset tail? thenA)
## (recur num-args local-offset tail? elseA))
## (#;Cons [headP headA] tailPA)
## (let [headP+ (|> (recur num-args local-offset tail? headA)
## #ls;ExecP
## (#ls;SeqP (&&case;path headP)))
## tailP+ (L/map (function [[pattern bodyA]]
## (|> (recur num-args local-offset tail? bodyA)
## #ls;ExecP
## (#ls;SeqP (&&case;path pattern))))
## tailPA)]
## (#ls;Case inputS (&&case;weave-paths headP+ tailP+)))
## ))
)))
|
