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

Mosses, Peter
Nielsen, Mogens
Schwartzbach, Michael

dblp
dblp
dblp



BibTeX cite key*:

KrishnaRaoTAPSOFT

Title, Booktitle

Title*:

Semi-completeness of Hierarchical and Super-hierarchical Combinations of Term Rewriting Systems

Booktitle*:

Proceedings of the 6th Joint Conference on Theory and Practice of Software Development

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Århus, Denmark

Language:

English

Event Date*
(no longer used):

May

Organization:


Event Start Date:

Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected

Event End Date:

Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

915

Number:


Month:

May

Pages:

379-393

Year*:

1995

VG Wort Pages:


ISBN/ISSN:

3-540-59293-8

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

In this paper, we study modular aspects of hierarchical and super hierarchical combinations of term rewriting systems. In particular, a sufficient condition for modularity of semi-completeness of hierarchical and super hierarchical combinations is proposed. We first establish modularity of weak normalization for this class (defined by the sufficient condition) and modularity of semi-completeness for a class of crosswise independent unions. From these results, we obtain modularity of semi-completeness for a class of hierarchical and super hierarchical combinations. Our results generalize the main result of Ohlebusch (1994). The notion of crosswise independent unions is a generalization of both constructor sharing unions as well as Plump's crosswise disjoint unions.

Keywords:

modularity, term rewriting



Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

Expert

Appearance:



BibTeX Entry:

@INPROCEEDINGS{KrishnaRaoTAPSOFT,
AUTHOR = {Krishna Rao, M. R. K.},
EDITOR = {Mosses, Peter and Nielsen, Mogens and Schwartzbach, Michael},
TITLE = {Semi-completeness of Hierarchical and Super-hierarchical Combinations of Term Rewriting Systems},
BOOKTITLE = {Proceedings of the 6th Joint Conference on Theory and Practice of Software Development},
PUBLISHER = {Springer},
YEAR = {1995},
VOLUME = {915},
PAGES = {379--393},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Århus, Denmark},
MONTH = {May},
ISBN = {3-540-59293-8},
}


Entry last modified by Stephanie Müller, 08/28/2014
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)
Uwe Brahm
Created
03/01/1996 11:11:18 AM
Revisions
10.
9.
8.
7.
6.
Editor(s)
Stephanie Müller
Christine Kiesel
Uwe Brahm
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Edit Dates
28.08.2014 09:41:03
31.08.2001 15:24:14
20.01.97 01:24:21
03/25/96 04:15:24 PM
03/25/96 04:14:09 PM