This paper presents an abstract treatment of the foundations of rewriting logic, generalising in three ways: an arbitrary 2-category plays the role of the specific 2-category Cat; the foundations are rendered fully independent of the underlying equational logic; and the semantics covers non-conventi
A Logic for Rewriting Strategies
โ Scribed by Richard B. Kieburtz
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 336 KB
- Volume
- 58
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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.
This paper presents a logic language (called Distributed Logic Objects, DLO for short) that supports objects, messages and inheritance. The operational semantics of the language is given in terms of rewriting rules acting upon the (possibly distributed) state of the system. In this sense, the logic