blob: ea86159495c0952bb19c94dc8362b34173f79f6d (
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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
|
(.module:
[lux #*
[abstract
[equivalence (#+ Equivalence)]
["." monad (#+ do)]]
[control
[pipe (#+ when> new> case>)]]
[data
["." product]
["." bit ("#@." equivalence)]
["." text ("#@." equivalence)
format]
[number
["." frac ("#@." equivalence)]]
[collection
["." list ("#@." functor fold monoid)]
["." set (#+ Set)]]]]
["." /// ("#@." monad)
["#/" //
["#." reference (#+ Variable)]
["#." analysis (#+ Pattern Match Analysis)]
["/" synthesis (#+ Path Synthesis Operation Phase)]]])
(def: clean-up
(-> Path Path)
(|>> (#/.Seq #/.Pop)))
(def: (path' pattern end? thenC)
(-> Pattern Bit (Operation Path) (Operation Path))
(case pattern
(#////analysis.Simple simple)
(case simple
#////analysis.Unit
thenC
(^template [<from> <to>]
(<from> value)
(///@map (|>> (#/.Seq (#/.Test (|> value <to>))))
thenC))
([#////analysis.Bit #/.Bit]
[#////analysis.Nat (<| #/.I64 .i64)]
[#////analysis.Int (<| #/.I64 .i64)]
[#////analysis.Rev (<| #/.I64 .i64)]
[#////analysis.Frac #/.F64]
[#////analysis.Text #/.Text]))
(#////analysis.Bind register)
(<| (:: ///.monad map (|>> (#/.Seq (#/.Bind register))))
/.with-new-local
thenC)
(#////analysis.Complex (#////analysis.Variant [lefts right? value-pattern]))
(<| (///@map (|>> (#/.Seq (#/.Access (#/.Side (if right?
(#.Right lefts)
(#.Left lefts)))))))
(path' value-pattern end?)
(when> [(new> (not end?) [])] [(///@map ..clean-up)])
thenC)
(#////analysis.Complex (#////analysis.Tuple tuple))
(let [tuple::last (dec (list.size tuple))]
(list@fold (function (_ [tuple::lefts tuple::member] nextC)
(let [right? (n/= tuple::last tuple::lefts)
end?' (and end? right?)]
(<| (///@map (|>> (#/.Seq (#/.Access (#/.Member (if right?
(#.Right (dec tuple::lefts))
(#.Left tuple::lefts)))))))
(path' tuple::member end?')
(when> [(new> (not end?') [])] [(///@map ..clean-up)])
nextC)))
thenC
(list.reverse (list.enumerate tuple))))
))
(def: #export (path synthesize pattern bodyA)
(-> Phase Pattern Analysis (Operation Path))
(path' pattern true (///@map (|>> #/.Then) (synthesize bodyA))))
(def: #export (weave leftP rightP)
(-> Path Path Path)
(with-expansions [<default> (as-is (#/.Alt leftP rightP))]
(case [leftP rightP]
[(#/.Seq preL postL)
(#/.Seq preR postR)]
(case (weave preL preR)
(#/.Alt _)
<default>
weavedP
(#/.Seq weavedP (weave postL postR)))
[#/.Pop #/.Pop]
rightP
(^template [<tag> <eq>]
[(#/.Test (<tag> leftV))
(#/.Test (<tag> rightV))]
(if (<eq> leftV rightV)
rightP
<default>))
([#/.Bit bit@=]
[#/.I64 "lux i64 ="]
[#/.F64 frac@=]
[#/.Text text@=])
(^template [<access> <side>]
[(#/.Access (<access> (<side> leftL)))
(#/.Access (<access> (<side> rightL)))]
(if (n/= leftL rightL)
rightP
<default>))
([#/.Side #.Left]
[#/.Side #.Right]
[#/.Member #.Left]
[#/.Member #.Right])
[(#/.Bind leftR) (#/.Bind rightR)]
(if (n/= leftR rightR)
rightP
<default>)
_
<default>)))
(def: #export (synthesize synthesize^ inputA [headB tailB+])
(-> Phase Analysis Match (Operation Synthesis))
(do ///.monad
[inputS (synthesize^ inputA)]
(with-expansions [<unnecesary-let>
(as-is (^multi (^ (#////analysis.Reference (////reference.local outputR)))
(n/= inputR outputR))
(wrap inputS))
<let>
(as-is [[(#////analysis.Bind inputR) headB/bodyA]
#.Nil]
(case headB/bodyA
<unnecesary-let>
_
(do @
[headB/bodyS (/.with-new-local
(synthesize^ headB/bodyA))]
(wrap (/.branch/let [inputS inputR headB/bodyS])))))
<if>
(as-is (^or (^ [[(////analysis.pattern/bit #1) thenA]
(list [(////analysis.pattern/bit #0) elseA])])
(^ [[(////analysis.pattern/bit #0) elseA]
(list [(////analysis.pattern/bit #1) thenA])]))
(do @
[thenS (synthesize^ thenA)
elseS (synthesize^ elseA)]
(wrap (/.branch/if [inputS thenS elseS]))))
<case>
(as-is _
(let [[[lastP lastA] prevsPA] (|> (#.Cons headB tailB+)
list.reverse
(case> (#.Cons [lastP lastA] prevsPA)
[[lastP lastA] prevsPA]
_
(undefined)))]
(do @
[lastSP (path synthesize^ lastP lastA)
prevsSP+ (monad.map @ (product.uncurry (path synthesize^)) prevsPA)]
(wrap (/.branch/case [inputS (list@fold weave lastSP prevsSP+)])))))]
(case [headB tailB+]
<let>
<if>
<case>))))
(def: #export (count-pops path)
(-> Path [Nat Path])
(case path
(^ (/.path/seq #/.Pop path'))
(let [[pops post-pops] (count-pops path')]
[(inc pops) post-pops])
_
[0 path]))
(def: #export pattern-matching-error
"Invalid expression for pattern-matching.")
(type: #export Storage
{#bindings (Set Variable)
#dependencies (Set Variable)})
(def: empty
Storage
{#bindings (set.new ////reference.hash)
#dependencies (set.new ////reference.hash)})
## TODO: Use this to declare all local variables at the beginning of
## script functions.
## That way, it should be possible to do cheap "let" expressions,
## since the variable will exist before hand so no closure will need
## to be created for it.
## Apply this trick to JS, Python et al.
(def: #export (storage path)
(-> Path Storage)
(loop for-path
[path path
path-storage ..empty]
(case path
(^ (/.path/bind register))
(update@ #bindings (set.add (#////reference.Local register))
path-storage)
(^or (^ (/.path/seq left right))
(^ (/.path/alt left right)))
(list@fold for-path path-storage (list left right))
(^ (/.path/then bodyS))
(loop for-synthesis
[bodyS bodyS
synthesis-storage path-storage]
(case bodyS
(^ (/.variant [lefts right? valueS]))
(for-synthesis valueS synthesis-storage)
(^ (/.tuple members))
(list@fold for-synthesis synthesis-storage members)
(#/.Reference (#////reference.Variable var))
(if (set.member? (get@ #bindings synthesis-storage) var)
synthesis-storage
(update@ #dependencies (set.add var) synthesis-storage))
(^ (/.function/apply [functionS argsS]))
(list@fold for-synthesis synthesis-storage (#.Cons functionS argsS))
(^ (/.function/abstraction [environment arity bodyS]))
(list@fold (function (_ variable storage)
(for-synthesis (#/.Reference (#////reference.Variable variable))
storage))
synthesis-storage
environment)
(^ (/.branch/let [inputS register exprS]))
(list@fold for-synthesis
(update@ #bindings (set.add (#////reference.Local register))
synthesis-storage)
(list inputS exprS))
(^ (/.branch/if [testS thenS elseS]))
(list@fold for-synthesis synthesis-storage (list testS thenS elseS))
(^ (/.branch/case [inputS pathS]))
(|> synthesis-storage (for-synthesis inputS) (for-path pathS))
(^ (/.loop/scope [start initsS+ iterationS]))
(list@fold for-synthesis synthesis-storage (#.Cons iterationS initsS+))
(^ (/.loop/recur replacementsS+))
(list@fold for-synthesis synthesis-storage replacementsS+)
(#/.Extension [extension argsS])
(list@fold for-synthesis synthesis-storage argsS)
_
synthesis-storage))
_
path-storage
)))
|
