Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Krishna Rao, M. R. K.

dblp



Editor(s):

Wiedermann, Jirí
Hájek, Petr

dblp
dblp



BibTeX cite key*:

KrishnaRao95

Title, Booktitle

Title*:

Graph reducibility of term rewriting systems

Booktitle*:

Proceedings of Mathematical Foundations of Computer Science

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Prague, Czech Republic

Language:

English

Event Date*
(no longer used):

August/September

Organization:


Event Start Date:

16 September 2019

Event End Date:

16 September 2019

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

969

Number:


Month:

August

Pages:

371-381

Year*:

1995

VG Wort Pages:


ISBN/ISSN:

3-540-60246-1

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) 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.

Keywords:

term rewriting



Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:

@INPROCEEDINGS{KrishnaRao95,
AUTHOR = {Krishna Rao, M. R. K.},
EDITOR = {Wiedermann, Jir{\'i} and H{\'a}jek, Petr},
TITLE = {Graph reducibility of term rewriting systems},
BOOKTITLE = {Proceedings of Mathematical Foundations of Computer Science},
PUBLISHER = {Springer},
YEAR = {1995},
VOLUME = {969},
PAGES = {371--381},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Prague, Czech Republic},
MONTH = {August},
ISBN = {3-540-60246-1},
}


Entry last modified by Uwe Brahm, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
M. R. K. Krishna Rao
Created
03/01/1996 10:42:36 AM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Uwe Brahm
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Edit Dates
20.01.97 01:25:31
03/27/96 06:28:40 PM
03/01/96 01:27:23 PM
03/01/96 12:01:33 PM
01/03/96 11:57:52