Term Rewriting in Logics of Partial Functions

نویسنده

  • Matthias Schmalz
چکیده

We devise a theoretical foundation of directed rewriting, a term rewriting strategy for logics of partial functions, inspired by term rewriting in the Rodin platform. We prove that directed rewriting is sound and show how to supply new rewrite rules in a soundness preserving fashion. In the context of Rodin, we show that directed rewriting makes a significant number of conditional rewrite rules unconditional. Our work not only allows us to point out a number of concrete ways of improving directed rewriting in Rodin, but also has applications in other logics of partial functions. Additionally, we give a semantics for the logic of Event-B.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rn- and Gn-Logics

This paper proposes a simple, set-theoretic framework providing expressive typing, higher-order functions and initial models at the same time. Building upon Russell’s ramified theory of types, we develop the theory of R-logics, which are axiomatisable by an order-sorted equational Horn logic with a membership predicate, and of G-logics, that provide in addition partial functions. The latter are...

متن کامل

Parallel Rewriting in Neural Networks

Rewriting systems are used in various areas of computer science, and especially in lambda-calculus, higherorder logics and functional programming. We show that the unsupervised learning networks can implement parallel rewriting. We show how this general correspondence can be refined in order to perform parallel term rewriting in neural networks, for any given first-order term. We simulate these...

متن کامل

A logic for modular descriptions of asynchronous and synchronized concurrent systems

Tile logic is a framework to reason about the dynamic evolution of concurrent systems in a modular way, and it extends rewriting logic (in the unconditional case) by rewriting synchronization and side eeects. The subject of this dissertation concerns some interesting tile models of computation such that the mathematical structures representing conngurations (i.e., system states) and eeects (i.e...

متن کامل

Natural Inductive Theorems for Higher-Order Rewriting

The notion of inductive theorems is well-established in first-order term rewriting. In higherorder term rewriting, in contrast, it is not straightforward to extend this notion because of extensionality (Meinke, 1992). When extending the term rewriting based program transformation of Chiba et al. (2005) to higher-order term rewriting, we need extensibility, a property stating that inductive theo...

متن کامل

Confluent Term Rewriting for Only-knowing Logics

Combining term rewriting and modal logics, this paper addresses confluence and termination of rewrite systems introduced for only-knowing logics. The rewrite systems contain a rule scheme that gives rise to an infinite number of critical pairs, hence we cannot check the joinability of every critical pair directly, in order to establish local confluence. We investigate conditions that are suffic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011