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

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Detecting Redundant Narrowing Derivations by the LSE-SL Reducibility Test

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

Bockmayr,  Alexander
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

Krischer, S., & Bockmayr, A. (1991). Detecting Redundant Narrowing Derivations by the LSE-SL Reducibility Test. In R. Book (Ed.), Proceedings of the 4th International Conference on Rewriting Techniques and Applications (RTA '91) (pp. 74-85). Berlin, Germany: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-AE39-4
Zusammenfassung
Rewriting and narrowing provide a nice theoretical framework for the integration of logic and functional programming. For practical applications however, narrowing is still much too inefficient. In this paper we show how reducibility tests can be used to detect redundant narrowing derivations. We introduce a new narrowing strategy, LSE-SL left-to-right basic normal narrowing, prove its completeness for arbitrary canonical term rewriting systems, and demonstrate how it increases the efficiency of the narrowing process.