Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ...

Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ... (1989)

Cached

Download Links

by Nachum Dershowitz , Stéphane Kaplan , David A. Plaisted X

Citations:

7 - 1 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ...	user correction - Legacy Corrections
AUTHOR NAME	Nachum Dershowitz	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science, University of Illinois at Urbana-Champaign,; 1304 West Spring eld Ave	user correction - Legacy Corrections
AUTHOR ADDR	, Urbana, IL 61801{2987, U.S.A.	user correction - Legacy Corrections
AUTHOR NAME	Stéphane Kaplan	user correction - Legacy Corrections
AUTHOR AFFIL	; Department of Computer Science; Laboratoire deRecherche en Informatique, Universite de Paris-Sud, Orsay 91405,	user correction - Legacy Corrections
AUTHOR ADDR	; Bar-Ilan University, Ramat-Gan 52100, Israel; France	user correction - Legacy Corrections
AUTHOR NAME	David A. Plaisted X	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science, University of North Carolina at Chapel Hill,	user correction - Legacy Corrections
AUTHOR ADDR	Chapel Hill, NC 27514{3175, U.S.A.	user correction - Legacy Corrections
ABSTRACT	.We study properties of rewrite systems that are not necessarily terminating, but allow instead for trans#nite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of in#nitary theories. We also consider su#cient completeness of hierarchical systems. Is there no limit? ---Job 16:3 1. Introduction Rewrite systems are sets of directed equations used to compute by repeatedly replacing equal terms in a given formula, as long as possible. For one approach to their use in computing, see #23#. The theory of rewriting is an outgrowth of the study of the lambda calculus and combinatory logic, and # Preliminary versions #6, 7# of ideas in this paper were presented at the Sixteenth ACM Symposium on Principles of Programming Languages, Austin, TX #January 1989# and at the Sixteenth EATCS International Colloquium on Automata, Languages and Programming, Stresa, Italy #July 1989#. ...	user correction - Legacy Corrections
YEAR	1989	user correction - Legacy Corrections
CITATIONS	23 found	ParsCit 1.0