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):

Ganzinger, Harald

dblp



BibTeX cite key*:

KrishnaRao96d

Title, Booktitle

Title*:

Modularity of termination in term graph rewriting

Booktitle*:

Rewriting Techniques and Applications

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

New Brunswick

Language:

English

Event Date*
(no longer used):

July

Organization:


Event Start Date:

15 September 2019

Event End Date:

15 September 2019

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

1103

Number:


Month:

July

Pages:

230-244

Year*:

1996

VG Wort Pages:


ISBN/ISSN:

3-540-61464-8

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.
In this paper, we study modularity of termination of the
graph reduction. Unlike in the case of term rewriting,
termination is modular in graph rewriting for a large
class of systems. Our results generalize the results of
Plump (1992) and Kurihara and Ohuchi (1995).

Keywords:

term graph 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{KrishnaRao96d,
AUTHOR = {Krishna Rao, M. R. K.},
EDITOR = {Ganzinger, Harald},
TITLE = {Modularity of termination in term graph rewriting},
BOOKTITLE = {Rewriting Techniques and Applications},
PUBLISHER = {Springer},
YEAR = {1996},
VOLUME = {1103},
PAGES = {230--244},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {New Brunswick},
MONTH = {July},
ISBN = {3-540-61464-8},
}


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)
Christine Kiesel
Created
01/07/1997 02:05:06 PM
Revisions
5.
4.
3.
2.
1.
Editor(s)
Uwe Brahm
Uwe Brahm
Uwe Brahm
Christine Kiesel
Christine Kiesel
Edit Dates
17.04.97 15:28:40
12.01.97 10:26:55
12.01.97 10:26:11
07/01/97 14:17:38
07/01/97 14:17:25