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
|
implementation module law
// $Id$
import coreclean
import strat
import spine
import rule
import dnc
import graph
import basic
from general import --->
import StdEnv
/*
> %export
> cleanlaws
> corestrategy
> %include "dnc.lit"
> %include "../src/basic.lit"
> %include "../src/pfun.lit"
> %include "../src/graph.lit"
> %include "../src/complete.lit"
> %include "../src/rule.lit"
> %include "../src/spine.lit"
> %include "strat.lit"
> %include "../src/clean.lit"
> intmullaw :: law symbol ** node ****
> intmullaw substrat subject found rnf sargs fail
> = rulelaw (leftunitrule (Int 1)) substrat subject found rnf sargs fail'
> where fail' = rulelaw (rightunitrule (Int 1)) substrat subject found rnf sargs fail''
> fail'' = primlaw (intop product) substrat subject found rnf sargs fail
> mullaws
> = [ rulelaw (leftunitrule (Int 1))
> , rulelaw (rightunitrule (Int 1))
> , primlaw (intop product)
> ]
> intaddlaw :: law symbol ** node ****
> intaddlaw substrat subject found rnf sargs fail
> = trylaw subject found' sargs (leftunitrule (Int 0)) fail'
> where fail' = trylaw subject found' sargs (rightunitrule (Int 0)) fail''
> fail'' = strictprimop (intop sum) substrat subject found sargs fail
> found' subspine = found subspine
> addlaws
> = [ rulelaw (leftunitrule (Int 0))
> , rulelaw (rightunitrule (Int 0))
> , primlaw (intop sum)
> ]
> intsublaw :: law symbol ** node ****
> intsublaw substrat subject found rnf sargs fail
> = trylaw subject found' sargs (rightunitrule (Int 0)) fail'
> where fail' = strictprimop (intop sublist) substrat subject found sargs fail
> found' subspine = found subspine
> sublist [x,y] = x-y
> sublaws
> = [ rulelaw (rightunitrule (Int 0))
> , primlaw (intop sublist)
> ]
> where sublist [x,y] = x-y
> intop :: ([num]->num) -> [symbol] -> symbol
> intop op symbols = Int (op [i|Int i<-symbols])
> leftunitrule leftunit
> = mkrule [Named "leftarg",Named "rightarg"] (Named "rightarg") (updategraph (Named "leftarg") (leftunit,[]) emptygraph)
> rightunitrule rightunit
> = mkrule [Named "leftarg",Named "rightarg"] (Named "leftarg") (updategraph (Named "rightarg") (rightunit,[]) emptygraph)
> strictprimop
> :: ([*]->*) ->
> substrategy * ** node **** ->
> graph * ** ->
> (subspine * ** node->****) ->
> [**] ->
> **** ->
> ****
> strictprimop op substrat subject found sargs fail
> = forcenodes substrat found foundredex sargs, if and (map fst conts)
> = fail, otherwise
> where conts = map (dnc (const "in strictprimop") subject) sargs
> result = op (map (fst.snd) conts)
> primrule = mkrule primargs primroot primgraph
> primargs = map snd (zip2 sargs heap)
> primroot = Named "primresult"
> primgraph = updategraph primroot (result,[]) emptygraph
> matching = foldr (uncurry extend) emptypfun (zip2 primargs sargs)
> foundredex = found (Redex primrule matching)
> primlaw
> :: ([*]->*) ->
> law * ** node ****
> primlaw op substrat subject found rnf sargs fail
> = strictprimop op substrat subject found sargs fail
------------------------------------------------------------------------
> cleanlaws :: [(symbol,law symbol ** node ****)]
*/
cleanlaws :: [(SuclSymbol,Law SuclSymbol var SuclVariable result)]
cleanlaws =: []
/*
> cleanlaws
> = [(User "deltaI" "*",law) | law <- mullaws] ++
> [(User "deltaI" "+",law) | law <- addlaws] ++
> [(User "deltaI" "-",law) | law <- sublaws] ++
> [(User "deltaI" "++",primlaw inc)] ++
> [(User "deltaI" "--",primlaw dec)]
> inc [Int n] = Int (n+1)
> dec [Int n] = Int (n-1)
------------------------------------------------------------------------
> corestrategy :: (graph symbol node->node->**->bool) -> strategy symbol ** node ****
Forcing arguments has already been done by the type rule
Also, using trylaw is easier
> corestrategy matchable substrat subject found rnf (Apply,snodes)
> = trylaw subject found snodes (applyrule nc) (found Delta)
> where nc = dnc (const "in corestrategy") subject (hd snodes)
> corestrategy matchable substrat subject found rnf (If,snodes)
> = tryrules matchable substrat subject found snodes (found MissingCase) ifrules
> corestrategy matchable substrat subject found rnf (Select a i,snodes)
> = tryrules matchable substrat subject found snodes (found MissingCase) [selectrule a i]
> corestrategy matchable substrat subject found rnf (User module id,snodes)
> = found MissingCase
> corestrategy matchable substrat subject found rnf (ssym,snodes)
> = rnf
*/
// The strategy for built in clean symbols
corestrategy :: ((Graph SuclSymbol SuclVariable) SuclVariable var -> Bool) -> Strategy SuclSymbol var SuclVariable result | == var
corestrategy matchable =(\ substrat subject found rnf snode
-> let (ssym,sargs) = snode
in case ssym
of SuclUser sptr
-> found MissingCase
SuclCase eptr
-> found MissingCase
SuclApply argc
-> trylaw subject found sargs (applyrule nc) (found Delta)
where nc = dnc (const "in corestrategy") subject (hd sargs)
_
-> rnf)
/*
> applyrule :: (bool,(*,[**])) -> rule * node
> applyrule (sdef,scont)
> = aprule (anode,(sym,aargs)) [enode] aroot
> where (aargs,anode:aroot:enode:heap') = claim sargs heap
> (sym,sargs)
> = scont, if sdef
> = (nosym,[]), otherwise
> nosym = error "applyrule: no function symbol available"
*/
applyrule :: (Bool,Node sym var) -> Rule sym SuclVariable
applyrule (sdef,scont)
= aprule (anode,(sym,aargs)) [enode] aroot
where (aargs,[anode,aroot,enode:_]) = (claim--->"basic.claim begins from law.applyrule") sargs suclheap
(sym,sargs)
= if sdef scont (nosym,[])
nosym = abort "applyrule: no function symbol available"
/*
> aprule :: (***,(*,[***])) -> [***] -> *** -> rule * ***
> aprule (anode,(sym,aargs)) anodes aroot
> = mkrule (anode:anodes) aroot agraph
> where agraph
> = ( updategraph aroot (sym,aargs++anodes)
> . updategraph anode (sym,aargs)
> ) emptygraph
*/
aprule :: (pvar,Node sym pvar) [pvar] pvar -> Rule sym pvar
aprule (anode,(sym,aargs)) anodes aroot
= mkrule [anode:anodes] aroot agraph
where agraph
= ( updategraph aroot (sym,aargs++anodes)
o updategraph anode (sym,aargs)
) emptygraph
/*
> apmatching :: [**] -> [***] -> pfun *** **
> apmatching snodes anodes
> = foldr (uncurry extend) emptypfun nodepairs
> where nodepairs = zip2 anodes snodes
> claims :: [[*]] -> [**] -> ([[**]],[**])
> claims [] heap = ([],heap)
> claims (nodes:nodess) heap
> = (nodes':nodess',heap'')
> where (nodes',heap') = claim nodes heap
> (nodess',heap'') = claims nodess heap'
> ifrules :: [rule symbol node]
> ifrules
> = [ifrule True then,ifrule False else]
> where ifrule bool branch = mkrule [cond,then,else] branch (updategraph cond (Bool bool,[]) emptygraph)
> cond = Named "cond"; then = Named "then"; else = Named "else"
> selectrule :: num -> num -> rule symbol node
> selectrule a i
> = mkrule [tuple] (args!(i-1)) (updategraph tuple (Tuple a,args) emptygraph)
> where tuple = Named "tuple"
> args = take a (tl heap)
*/
|
