English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Graph reducibility of term rewriting systems

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Krishna Rao, M. R. K.1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: 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.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121995
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519515
Other: Local-ID: C1256104005ECAFC-50B2C8073ABBAEB5C12562E000355702-KrishnaRao95
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Prague, Czech Republic
Start-/End Date: 1995

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of Mathematical Foundations of Computer Science
Source Genre: Proceedings
 Creator(s):
Wiedermann, Jirí, Editor
Hájek, Petr, Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 371 - 381 Identifier: ISBN: 3-540-60246-1

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -