Rewrite, rewrite, rewrite, rewrite, rewrite...

Authors:
Nachum Dershowitz;S. Kaplan
Affiliations:
Department of Computer Science, University of Illinois, 1304 West Springfield Avenue, Urbana, Illinois;Department of Computer Science, Hebrew University, Givat Ram, 91904 Jerusalem (Israel) and Department of Computer Science, Bar-Ilan University, Ramat-Gan (Israel) and L.R.I., Bat. 490, Universit& ...
Venue:
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1989

Citing 8
Cited 5

Equational logic as a programming language

Equational logic as a programming language
On the algebraic specification of infinite objects—ordered and continuous models of algebraic types

Acta Informatica
Termination of rewriting

Journal of Symbolic Computation
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
Operational and Semantic Equivalence Between Recursive Programs

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Computing in Systems Described by Equations

Computing in Systems Described by Equations
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

A correctness proof for combinator reduction with cycles

ACM Transactions on Programming Languages and Systems (TOPLAS)
On modularity in infinitary term rewriting

Information and Computation
Modularity of Convergence in Infinitary Rewriting

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
On modularity in infinitary term rewriting

Information and Computation
Infinitary Combinatory Reduction Systems

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The theory of term rewriting systems has important applications in abstract data type specifications and functional programming languages. We begin here a study of properties of systems that are not necessarily terminating, but allow for infinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness.