PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Inverardi P., Nesi M. On dealing with divergent rewrite systems. In: IV Conferenza italiana di informatica teorica. (L'Aquila, Italia, 28 - 30 October 1992). Atti, pp. 256 - 257. A. Marchetti Spaccamela, P. Mentrasti, M. Venturini Zilli (eds.). World Scientific, 1992.
 
 
Abstract
(English)
Knuth-Bendix completion is a well-known technique to produce a canonical term rewriting system from a given set T of equations. One of the major problems in this approach is that Knuth-Bendix completion can result in an infinite set of rewrite rules. This problem has been well studied and various approaches that try to cope with infinite sets of rules have been proposed. In this abstract we present a different way of dealing with divergent term rewriting systems.
Subject


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional