3 As mentioned in the introduction, Maude modules are executable rewriting logic specifications.
10 present both logics and how their specifications are represented as Maude modules.
71 \subsection{Maude functional modules} \label{maudefmod}
73 Maude functional modules \cite[Chapter 4]{maude-book}, introduced 
182 \subsection{Maude system modules}
184 Maude system modules \cite[Chapter 6]{maude-book}, introduced with
192 module are the same as those of functional modules, namely, confluence,
212 In addition to the modules presented thus far, we present in this section
219 mechanisms to structure its modules. We describe in this section these
222 Maude modules can import other modules in three different modes:
240 More specifically, these importation modes do not import modules but
293 and semantic properties to be satisfied by the actual parameter modules
294 used in an instantiation. As for modules, Maude supports two different types
300 and equations, and can import other theories or modules. System theories can
306 Like functional modules, functional theories are membership equational
408 previous section to \verb"NAT", the predefined modules for natural numbers:
448 \subsubsection{Parameterized modules}\label{subsec:pmod}
450 Maude modules can be parameterized. A parameterized
457 \noindent with $n \geq 1$. Parameterized functional modules have completely
477 no effect on importations of modules. Thus, if $T_i$ includes a theory $T'$,
481 However, the renaming will have no effect on modules imported by either the
485 Moreover, sorts declared in parameterized modules can also be parameterized,
488 The parameters in parameterized modules are bound to the formal parameters
497 We can define a parameterized modules for multisets of the processes shown in

Indexes created Tue Jul 24 14:28:13 CEST 2018