Location
Toggle navigation
HOME
INSTITUTE
Mission
Address
Executive Board
Scientific Members of MPG
Scientific Advisory Board
Board of Trustees
NEWS
Overview
Press Releases
Awards
Spotlights
Campus Event Calendar
25th Anniversary
Employment
DEPARTMENTS
Algorithms & Complexity
Computer Vision and Machine Learning
Internet Architecture
Computer Grapics
Databases and Information Systems
Visual Computing and Artificial Intelligence
Research Group Computational Biology
Automation of Logic
Network and Cloud Systems
PUBLICATIONS
Algorithms & Complexity
Computer Vision and Machine Learning
Internet Architecture
Computer Graphics
Databases and Information Systems
Visual Computing and Artificial Intelligence
Research Group Computational Biology
Automation of Logic
Network and Cloud Systems
Research Reports
Scientific Advisory Board
Curatorship Board
25th anniversary
IMPRS-CS
PEOPLE
SOFTWARE
SERVICES
Joint Central Services
Joint Administration
- Library
- International Office
Joint Scientific IT and Technical Services
- Building and Technical Support
Research Coordination
Representative for Equal Opportunities
- Equal Opportunities
Representative for Severely Disabled Persons
Representative for Safety
Ombudsperson for
Good Scientific Practice
and Doctoral Research
Company Physician
CS@MPG
CS@SAAR
Saarland Informatics Campus
Computer Science Department,
Saarland University
Max Planck Institute for
Software Systems (MPI-SWS)
German Center for
Artificial Intelligence (DFKI)
Center for Security, Privacy
and Accountability (CISPA)
VIA - Saarbrücken Center for
Visual Computing, Interaction
and Artificial Intelligence
Graduate School for
Computer Science
Cluster of Excellence (MMCI)
Max Planck Center for Visual
Computing and Communication
Kaiserslautern-Saarbrücken
Computer Science Cluster
IT Incubator
Publications
Home
Intranet
Server
halma.mpi-inf.mpg.de
Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Krishna Rao, M. R. K.
dblp
Editor(s):
Maher, Michael
dblp
BibTeX cite key*:
KrishnaRao96b
Title, Booktitle
Title*:
Completeness results for basic narrowing in non-copying implementations
Booktitle*:
Logic Programming
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Bonn, Germany
Language:
English
Event Date*
(no longer used):
September
Organization:
The Association for Logic Programming
Event Start Date:
16 May 2024
Event End Date:
16 May 2024
Publisher
Name*:
MIT Press
URL:
Address*:
Cambridge, USA
Type:
Vol, No, Year, pp.
Series:
JICSLP
Volume:
Number:
Month:
Pages:
393-407
Year*:
1996
VG Wort Pages:
ISBN/ISSN:
0-262-63173-3
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
Narrowing and rewriting play an important role in giving
the operational semantics of languages that integrate
functional and logic programming. These two operations
are usually implemented using tree representation of
terms and atoms. Such implementations do not allow
sharing of similar structures. In contrast to this,
implementations which use (directed acyclic) graph
representations of terms and atoms allow sharing of
similar structures. Such sharing saves space and
avoids repetition of computations. Term graph rewriting is
one of the nice models proposed in the literature to
facilitate sharing of similar structures. In this paper, we
study completeness of basic narrowing in term graph rewriting.
Our results show that term graph rewriting not only improves
efficiency but even facilitates more general results on the
completeness of basic narrowing than the results known
in term rewriting (which use tree representations)
Keywords:
term rewriting, functional and logic programming
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
{
KrishnaRao96b
,
AUTHOR = {Krishna Rao, M. R. K.},
EDITOR = {Maher, Michael},
TITLE = {Completeness results for basic narrowing in non-copying implementations},
BOOKTITLE = {Logic Programming},
PUBLISHER = {MIT Press},
YEAR = {1996},
ORGANIZATION = {The Association for Logic Programming},
PAGES = {393--407},
SERIES = {JICSLP},
ADDRESS = {Bonn, Germany},
ISBN = {0-262-63173-3},
}
Entry last modified by Uwe Brahm, 03/12/2010
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:14:48 PM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Uwe Brahm
Uwe Brahm
Uwe Brahm
Uwe Brahm
Uwe Brahm
Edit Dates
17.04.97 15:28:09
20.03.97 19:23:28
17/03/97 17:01:58
20.01.97 01:22:08
12.01.97 10:21:37