This tutorial describes the equational specification of a series of typical data structures in Maude. We start with the well-known stacks, queues, and lists, to continue with binary and search trees. Not only are the simple versions considered but also advanced ones such as AVL and 2-3-4 trees. The operator attributes available in Maude allow the specification of data based on constructors that...

This paper attempts to develop a better theoretical understanding of re ective systems. We begin by a developing a re ective extension of the v -calculus and de ne a simple operational semantics for it based on the in nite tower model described in [10]. We then develop an equational logic from this semantics. The resulting logic is shown to be weak because of re ective properties. We establish ...

1 I n t r o d u c t i o n The combination of different declarative paradigms (specially functional and logic programming) has been widely treated in the literature (see [12] for a survey). Many approaches to the integration of functional and logic programming take constructor-based conditional term rewriting systems as programs. In order to deal properly with non-strict functions, lazy function...

This paper attempts to develop a better theoretical understanding of reeective systems. We begin by a developing a reeective extension of the v-calculus and deene a simple operational semantics for it based on the innnite tower model described in 10]. We then develop an equational logic from this semantics. The resulting logic is shown to be weak because of reeective properties. We establish pr...

Order-sorted equational logic is extended with dynamic logic to a specification language for dynamic objects. Special attention is paid to different concepts of encapsulation that play a role in object-orientation. It is argued that the resulting language, CMSL, meets those requirements of the object-oriented database system manifesto [6] that are applicable to object-oriented conceptual models...

Short-circuit evaluation denotes the semantics of propositional connectives in which second argument is evaluated only if first insufficient to determine value expression. Compound statements are from left right. widely used programming, with negation and sequential conjunction disjunction as primitives. We study question laws axiomatise short-circuit evaluation. In MSCL (memorising logic), ato...

We review the rudiments of the equational logic of (least) fixed points and provide some of its applications for axiomatization problems with respect to regular languages, tree languages, and synchronization trees.

E is an equational theorem prover for clausal logic with equality. We describe the latest version, E 0.81 Tumsong, with special emphasis on the important aspects that have changed compared to previously described versions.

This paper attempts to develop a better theoretical understanding of re ective systems. We begin by a developing a re ective extension of the v-calculus and de ne a simple operational semantics for it based on the in nite tower model described in [10]. We then develop an equational logic from this semantics. The resulting logic is shown to be weak because of re ective properties. We establish p...

We propose a method for incrementally computing success patterns of logic programs with respect to a class of abstractions. The method is specialised for computing success patterns for depth and stump abstractions. Equational unification algorithms for these abstractions are presented.