Logical Semantics for the Rewriting Calculus

Authors:
Aaron Stump;Carsten Schürmann
Affiliations:
Dept. of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO, USA;Dept. of Computer Science, Yale University, New Haven, CT, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 0

Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Term rewriting and all that

Term rewriting and all that
Meta-programming with names and necessity

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Pure patterns type systems

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Ordered linear logic and applications

Ordered linear logic and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Rewriting Calculus has been proposed as a language for defining term rewriting strategies. Rules are explicitly represented as terms, and are applied explicitly to other terms to transform them. Sets of rules may be applied to (sets of) terms non-deterministically to obtain sets of results. Strategies are implemented as rules which accept other rules as arguments and apply them in certain ways. This paper describes work in progress to strengthen the Rewriting Calculus by giving it a logical semantics. Such a semantics can provide crucial guidance for studying the language and increasing its expressive power. The latter is demonstrated by adding support to the Rewriting Calculus for what we call higher-form rewriting, where rules rewrite other rules. The logical semantics used is based on ordered linear logic. The paper develops the ideas through several examples.