Relaxed models for rewriting logic

Bi-rewriting rewriting logic

Rewriting logic appears to have good properties as logical framework, and can be useful for the development of programming languages which attempt to integrate various paradigms of declarative programming. In this paper I propose to tend towards the operational semantics for such languages by basing it on bi-rewrite systems and ordered chaining calculi which apply rewrite techniques to rst-orde...

Modal Logic for Rewriting Theories

We view models of rewrite theories enriched with observations coalgebraically. This allows us on the one hand to use “off the shelf” logics for coalgebras to specify and, on the other hand, to verify properties of rewriting programs and to obtain results about the expressive power of such languages.

A Logic for Rewriting Strategies

As term-rewriting has matured, with applications in areas such as automatic program transformation, the necessity of programmed control for applying rules has become apparent. Early term-rewriting systems used a xed strategy, such as innermost-leftmost matching, choosing among possibly overlapping rules nondeterministically. This mode of control is su cient for a con uent, terminating system of...

Relating Meseguer’s Rewriting Logic with the Constructor-Based Rewriting Logic

Rewriting Logic and Secure Mobility Why Rewriting Logic

The purpose of this note is to propose a new approach to the formal semantics and declarative programming of mobile applications that meets the needs of mobile computing in a particularly natural and simple way. This approach also ooers a good formal basis for deen-ing the new security models that mobile computing so clearly needs, and formal methods for verifying that declarative mobile progra...