This simple reduction has actually uncovered one hidden assumption in the manual proof: the law being verified is true ... Note that we have no means to tell the system that the term resulting from the application of least fixed point is implied by ... As illustrated above, the use of substitution requires the user to provide the matching; this turns out to be cumbersome if ... eq v : [a, b -agt; p, c] = dec vArv:ana;b*p;cj.. where the precondition states the required disjointness of the conditions b and c.

Title | : | An Algebraic Approach to Compiler Design |

Author | : | Augusto Sampaio |

Publisher | : | World Scientific - 1997-01-01 |

Continue