Journal Article
@Article
Artikel in Fachzeitschrift

Show entries of:

this year (2024) | last year (2023) | two years ago (2022) | Notes URL

Action:

login to update
Options:








Author, Editor(s)
Author(s):
Werner, Andreas
Bockmayr, Alexander
Krischer, Stefan		dblp
dblp
dblp

BibTeX cite key*:

WernerBockmayrKrischer98

Title

Title*:

How to realize LSE narrowing

Journal

Journal Title*:

New Generation Computing
Journal's URL:


Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:


Publisher's URL:


Publisher's
Address:


ISSN:

0288-3635

Vol, No, pp, Date

Volume*:

16
Number:

4

Publishing Date:

1998

Pages*:

397-434
Number of
VG Pages:


Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

Narrowing is a complete unification procedure for equational theories
defined by canonical term rewriting systems. It is also the operational
semantics of various logic and functional programming languages.
In an earlier paper, we introduced the LSE narrowing strategy which
is complete for arbitrary
canonical rewriting systems and optimal in the sense that two
different LSE narrowing derivations cannot generate the same narrowing
substitution. LSE narrowing improves all previously known strategies
for the class of arbitrary canonical systems.

LSE narrowing detects redundant derivations by reducibility tests.
According to their definition, LSE narrowing steps seem to be very
expensive, because a large number of subterms has to be tested. In this
paper, we show that many of these subterms are identical. We describe
how left-to-right basic occurrences can be used to identify and exclude
these identical subterms. This way, we can drastically reduce the number
of subterms that have to be tested. Based on these theoretical results,
we develop an efficient implementation of LSE narrowing.

URL for the Abstract:


Categories,
Keywords:

Narrowing, Logic and Functional Programming, Implementation, E-unification

HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


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, CCL bibliography


BibTeX Entry:
@ARTICLE{WernerBockmayrKrischer98,
AUTHOR = {Werner, Andreas and Bockmayr, Alexander and Krischer, Stefan},
 TITLE = {How to realize {LSE} narrowing},
 JOURNAL = {New Generation Computing},
 YEAR = {1998},
 NUMBER = {4},
 VOLUME = {16},
 PAGES = {397--434},
 ISBN = {0288-3635},
}

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)
Alexander Bockmayr		Created
09/29/1998 11:10:31 AM
Revisions
2.
1.
0.

Editor(s)
Uwe Brahm
Uwe Brahm
Alexander Bockmayr

Edit Dates
30.03.99 21:52:33
22.10.98 20:06:28
29/09/98 11:10:35