zbMATH — the first resource for mathematics

Term rewriting in a logic of special relations. (English) Zbl 0924.03048
Haeberer, Armando MartĂ­n (ed.), Algebraic methodology and software technology. 7th international conference, AMAST ’98, Amazonia, Brazil, January 4–8, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1548, 178-195 (1999).
Summary: Although there exist logics that extend the expressiveness of order-sorted equational logic using additional binary relations besides equality in their logical theories, standard equational rewriting is still the foundation of their operational semantics. But rewriting is not necessarily restricted to the replacement of equals by equals only, and can be generalized to other ‘special’ binary relations. I show in this paper that by applying rewrite techniques to logical theories considered as instances of a general ‘logic of special relations’ we can unify and hence simplify the computational analysis within these theories.
For the entire collection see [Zbl 0906.00024].

03B70 Logic in computer science
68Q42 Grammars and rewriting systems
68Q65 Abstract data types; algebraic specification