### Abstract

Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in the original rewrite system. In this paper it is shown that if such a simulation is sound and complete and preserves termination, then the transformation of the original into the simulating rewrite system constitutes a correct step in the compilation of the original rewrite system. That is, the normal forms of a term in the original rewrite system can then be obtained by computing the normal forms of a related term in the simulating rewrite system.

Original language | English |
---|---|

Title of host publication | Mathematical Foundations of Computer Science 1997 - 22nd International Symposium, MFCS 1997, Proceedings |

Editors | Igor Privara, Peter Ruzicka |

Publisher | Springer - Verlag |

Pages | 249-258 |

Number of pages | 10 |

ISBN (Print) | 3540634371, 9783540634379 |

Publication status | Published - 1 Jan 1997 |

Event | 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997 - Bratislava, Slovakia Duration: 25 Aug 1997 → 29 Aug 1997 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1295 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS 1997 |
---|---|

Country | Slovakia |

City | Bratislava |

Period | 25/08/97 → 29/08/97 |

### Fingerprint

### Cite this

*Mathematical Foundations of Computer Science 1997 - 22nd International Symposium, MFCS 1997, Proceedings*(pp. 249-258). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1295). Springer - Verlag.