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
|
module LiftCase
( isCaseAuxFuncName
, liftCases
)
where
import FlatCurry.Annotated.Types
import FlatCurry.Annotated.Goodies
import List ( isPrefixOf
, partition
, delete
, nub
, sortBy
)
import Data.FiniteMap
isCaseAuxFuncName :: String -> Bool
isCaseAuxFuncName n = take 6 n == "_case_"
liftCases :: Bool -> AProg TypeExpr -> AProg TypeExpr
liftCases nestedOnly p =
let fs = progFuncs p
aux = genAuxName (map (snd . funcName) fs)
(exts, ins) = partition isExternal fs
(newFsf, _, auxFf) =
foldr (liftCasesFunc nestedOnly (progName p) aux) (id, 0, id) ins
in updProgFuncs (const (newFsf (auxFf exts))) p
type FuncList = [AFuncDecl TypeExpr] -> [AFuncDecl TypeExpr]
type TypedVar = (VarIndex, TypeExpr)
type Result = (FuncList, Int, FuncList)
type M x = Int -> (x, Int, FuncList, [TypedVar])
sequence :: [M c] -> M [c]
sequence l i = foldr once ([], i, id, []) l
where
once f (es, j, ff1, vs1) =
let (e, k, ff2, vs2) = f j in (e : es, k, ff1 . ff2, vs1 ++ vs2)
liftCasesFunc
:: Bool -> String -> String -> AFuncDecl TypeExpr -> Result -> Result
liftCasesFunc onlyNested mod aux f (esMain, i0, ffMain) =
((updFuncBody (const exp) f :) . esMain, iMain, ffMain . ffeMain)
where
body = funcBody f
(exp, iMain, ffeMain, _) = if onlyNested
then case body of
ACase ty cm (AVar ty' v) bs ->
let (e', i', ffe, _) = trans (AVar ty' v) i0
(bs', i'', ffbs, _) =
sequence (map (\(ABranch p be) -> branch p (trans be)) bs) i'
in (ACase ty cm e' bs', i'', ffe . ffbs, [])
_ -> trans body i0
else trans body i0
trans = trExpr var lit comb leT freE or casE branch typed
var :: TypeExpr -> VarIndex -> M (AExpr TypeExpr)
var ty v i = (AVar ty v, i, id, [(v, ty)])
lit :: TypeExpr -> Literal -> M (AExpr TypeExpr)
lit ty l i = (ALit ty l, i, id, [])
comb
:: TypeExpr
-> CombType
-> (QName, TypeExpr)
-> [M (AExpr TypeExpr)]
-> M (AExpr TypeExpr)
comb ty ct n args i =
let (args', i', ff, vs) = sequence args i
in (AComb ty ct n args', i', ff, vs)
leT
:: TypeExpr
-> [((VarIndex, TypeExpr), M (AExpr TypeExpr))]
-> M (AExpr TypeExpr)
-> M (AExpr TypeExpr)
leT ty bs e i =
let (vs, es) = unzip bs
(es', i' , ffes, ves) = sequence es i
(e' , i'', ffe , ve ) = e i'
in ( ALet ty (zip vs es') e'
, i''
, ffes . ffe
, filter (\v -> fst v `notElem` map fst vs) (ves ++ ve)
)
freE :: TypeExpr -> [TypedVar] -> M (AExpr TypeExpr) -> M (AExpr TypeExpr)
freE ty vs e i =
let (e', i', ff, ve) = e i
in (AFree ty vs e', i', ff, filter (\v -> fst v `notElem` map fst vs) ve)
or
:: TypeExpr
-> M (AExpr TypeExpr)
-> M (AExpr TypeExpr)
-> M (AExpr TypeExpr)
or ty e1 e2 i =
let ([e1', e2'], i', ff, vs) = sequence [e1, e2] i
in (AOr ty e1' e2', i', ff, vs)
casE
:: TypeExpr
-> CaseType
-> M (AExpr TypeExpr)
-> [M (ABranchExpr TypeExpr)]
-> M (AExpr TypeExpr)
casE ty ct e bs i =
let (e' , i' , ffe , ve ) = e i
(bs', i'', ffbs, vbs) = sequence bs i'
envRes :: [(VarIndex, TypeExpr)]
envRes = nub (ve ++ vbs)
env = case e' of
AVar ty' v -> delete (v, ty') envRes
_ -> envRes
in ( genFuncCall mod aux i'' ty env e'
, i'' + 1
, (genFunc mod aux i'' ty env e' ct bs' :) . ffe . ffbs
, envRes
)
branch :: APattern TypeExpr -> M (AExpr TypeExpr) -> M (ABranchExpr TypeExpr)
branch p e i =
let (e', i', ff, ve) = e i in (ABranch p e', i', ff, removePVars ve p)
typed :: TypeExpr -> M (AExpr TypeExpr) -> TypeExpr -> M (AExpr TypeExpr)
typed ty e ty' i =
let (e', i', ff, ve) = e i in (ATyped ty e' ty', i', ff, ve)
genFuncCall
:: String
-> String
-> Int
-> TypeExpr
-> [TypedVar]
-> AExpr TypeExpr
-> AExpr TypeExpr
genFuncCall mod aux i ty env e = AComb ty
FuncCall
(newName mod aux i, funtype)
(map (uncurry (flip AVar)) env ++ [e])
where funtype = foldr FuncType (FuncType (annExpr e) ty) (map snd env)
genFunc
:: String
-> String
-> Int
-> TypeExpr
-> [TypedVar]
-> AExpr TypeExpr
-> CaseType
-> [ABranchExpr TypeExpr]
-> AFuncDecl TypeExpr
genFunc mod aux i ty env e ct bs = AFunc (newName mod aux i)
(length args)
Private
funtype
rule
where
ety = annExpr e
args = env ++ [(v, ety)]
rule = ARule funtype args (ACase ty ct (AVar ety v) bs)
v = case e of
AVar _ idx -> idx
_ -> nextLocalName (map fst env ++ concatMap allVarsBranch bs)
allVarsBranch (ABranch p pe) =
trPattern (\_ _ xs -> map fst xs) (\_ _ -> []) p ++ allVars pe
funtype = foldr FuncType ty (map snd args)
removePVars :: [TypedVar] -> APattern TypeExpr -> [TypedVar]
removePVars e =
trPattern (\_ _ vs -> filter (\v -> fst v `notElem` map fst vs) e) (\_ _ -> e)
genAuxName :: [String] -> String
genAuxName = foldl addUnderscores "_case_"
addUnderscores :: String -> String -> String
addUnderscores n m =
if n `isPrefixOf` m then addUnderscores (n ++ "_") m else n
newName :: String -> String -> Int -> QName
newName m l i = (m, l ++ show i)
nextLocalName :: [VarIndex] -> VarIndex
nextLocalName vs = (foldr max 0 vs + 1)
|