8 search results - page 2 / 2 » Termination of Lazy Rewriting Revisited |
CADE
1994
Springer
14 years 22 days ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
LICS
1994
IEEE
14 years 22 days ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
BIRTHDAY
2007
Springer
14 years 2 months ago
2007
Springer
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...