de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Graph reducibility of term rewriting systems

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44846

Krishna Rao,  M. R. K.
Programming Logics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Krishna Rao, M. R. K. (1995). Graph reducibility of term rewriting systems. In J. Wiedermann, & P. Hájek (Eds.), Proceedings of Mathematical Foundations of Computer Science (pp. 371-381). Berlin, Germany: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-AD02-8
Zusammenfassung
Term rewriting is generally implemented using graph rewriting for efficiency reasons. Graph rewriting allows sharing of common structures thereby saving both time and space. This implementation is sound in the sense that computation of a normal form of a graph yields a normal form of the corresponding term. However, certain properties of term rewriting systems are not reflected in their graph rewriting implementations. Weak normalization is one such property. An undesirable side effect of this is that it may be impossible to compute a normal form of a normalizable term. In this paper, we present some sufficient conditions for preservation of weak normalization and discuss the implication of the results to modularity.