Closed andreinaku closed 3 months ago
a6b7b53e164ed6dab4ed29c30550e881210d4517
bulk actions not needed it was actually faster to introduce a new maude rule
rl [Step8]: ((C[S]) && ((T <= T1 + T2)[S])) => ((C[S]) && ((T <= T1)[S])) || ((C[S]) && ((T <= T2)[S])) .
and use this strategy for state constraint solve
strat3 = 'one(Step1) ! ; one(Step2) ! ; one(Step8) ! ; one(Step3) ! ; one(Step4) ! ; Step5 ! ; Step6 ! '
a fix was added in b4ec90a4a3e6db9a2ab242564fda2be7a469fdd6
init.maude
now replaced by new.maude
, a rewrite where container types are operators of the type ContainerType
.
this way, it is easier to add rewrite rules for container types, because there is no need of treating them separately. the only separate one is dict
, which can contain 2 basetypes.
Sized
in maude specs?~ solution: use strategy 2 and divide basetypes into sums of maximum 5 elements, when necessary. strategy 2:example: instead of
use