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

Wirsing, Martin
Nivat, Maurice

dblp
dblp



BibTeX cite key*:

KrishnaRao96e

Title, Booktitle

Title*:

Some characteristics of strong innermost normalization

Booktitle*:

Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

Munich, Germany

Language:

English

Event Date*
(no longer used):

July 1-5

Organization:


Event Start Date:

11 November 2019

Event End Date:

11 November 2019

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

1101

Number:


Month:

July

Pages:

406-420

Year*:

1996

VG Wort Pages:


ISBN/ISSN:

3-540-61463-X

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

A term rewriting system is {\em strongly innermost
normalizing } if every innermost derivation of it is
of finite length. This property is very important in
the integration of functional and logic programming
paradigms. Unlike termination, strong innermost
normalization is not preserved under subsystems, i.e.,
every subsystem of a strongly innermost normalizing need
not be strongly innermost normalizing. Preservation of a
property under subsystems is important in analyzing
systems in a modular fashion. In this paper, we identify
a few classes of {\trs}s which enjoy this property.
These classes are of particular interest in studying modularity
of composable and hierarchical combinations.
It is also proved that the choice of the innermost redex
to be reduced at any step has no bearing on termination
(finiteness) of innermost derivations. It may be noted that
such selection invariance does not hold for outermost

derivations. The proof techniques used are novel and involve
oracle based reasoning --which is very sparsely used in the
rewriting literature.

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{KrishnaRao96e,
AUTHOR = {Krishna Rao, M. R. K.},
EDITOR = {Wirsing, Martin and Nivat, Maurice},
TITLE = {Some characteristics of strong innermost normalization},
BOOKTITLE = {Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96},
PUBLISHER = {Springer},
YEAR = {1996},
VOLUME = {1101},
PAGES = {406--420},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Munich, Germany},
MONTH = {July},
ISBN = {3-540-61463-X},
}


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 01:41:06 PM
Revisions
7.
6.
5.
4.
3.
Editor(s)
Uwe Brahm
Uwe Brahm
Uwe Brahm
Uwe Brahm
Uwe Brahm
Edit Dates
17.04.97 15:28:54
17/03/97 16:59:54
16/03/97 20:13:28
20.01.97 01:23:54
07/01/97 15:12:13