2020 Mathematics Subject Classification: Primary: 68P05 [MSN][ZBL]
Interpretations establish a relationship between syntax and semantics. The syntax is represented by the terms $T(\Sigma,X)$ constructable by the symbols given by the signature $\Sigma=(S,F)$ and a set $X$ of variables, whereas the semantics is defined by a $\Sigma$-algebra $A$. An interpretation $v^\ast \colon T(\Sigma,X) \longrightarrow A$ always relies on an assignement $B(A,X)\ni v\colon X\longrightarrow A$, which is extended from variables $X$ to terms $T(\Sigma,X)$.
Let a signature $\Sigma=(S,F)$, a set $X$ of variables, and a $\Sigma$-algebra $A$ be given. For an assignement $v\in B(A,X)$ written as $v\colon X \rightarrow \bigcup_{s\in S} s^A$ it exists a unique $\Sigma$-algebra-morphism $v^\ast\colon T(\Sigma,X) \longrightarrow \bigcup_{s\in S} s^A$, which extends $v$, i.e. which fulfills $v^\ast_s (x) = v_s(x)$ for all $s \in S$, $x \in X$ [ST99] [W90]. This extension is called an interpretation with respect to the assignement $v$ and written as $t[v]$ for a term $t\in T(\Sigma,X)$. Sometimes it is also called extended assignement. Ground terms $t\in T(\Sigma)$, i.e. terms which do not contain any variable $x\in X$, have an interpretation independent from $v$.
Whereas an assignement makes only a concretion of the variables in the set $X$, an interpretations concretizes a whole term $t\in T(\Sigma,X)$ containing variables. It relates terms — having a syntactical origin — and $\Sigma$-algebras, which provides a semantics in the final.
An inductive definition of an interpretation $t[v]$ is given in [EM85]:
The special properties of interpretations enable the statement of some compatibility theorems. These theorems describe the relationship between several interpretation mappings as well as between interpretaions and $\Sigma$-algebra-morphisms. Here, at first two theorems concerning general $\Sigma$-algebras are given. Afterwards, the special situation for term-generated $\Sigma$-algebras is discussed.
Let $Y$ be another set of variables with $X\cap Y=\emptyset$. Furthermore, let
be assignements. Then $v_x=v_y^\ast\circ v$ implies $v_x^\ast= v_y^\ast\circ v^\ast$ [EM85]. Now, let $B$ be another $\Sigma$-algebra. Furthermore, let the following mappings be given:
Then $v_B= f\circ v_A$ implies $v_B^\ast= f\circ v_A^\ast$ [EM85].
In the special case of term-generated $\Sigma$-algebras $A,B\in \mathrm{Gen}(\Sigma)$, some stronger statements can be made [W90]. First of all, a morphisms between $A$ and $B$ is uniquely determined by the corresponding assignements of variables. As an immediate consequence, it exists at most one $\Sigma$-algebra-morphism $f$ between two $\Sigma$-algebras $A$ and $B$. If it exists a $\Sigma$-algebra-morphism $f'\colon A\longrightarrow B$ and a $\Sigma$-algebra-morphism $f''\colon B\longrightarrow A$, then it holds $A\cong B$.
[EM85] | H. Ehrig, B. Mahr: "Fundamentals of Algebraic Specifications", Volume 1, Springer 1985 |
[EM90] | H. Ehrig, B. Mahr: "Fundamentals of Algebraic Specifications", Volume 2, Springer 1990 |
[M89] | B. Möller: "Algorithmische Sprachen und Methodik des Programmierens I", lecture notes, Technical University Munich 1989 |
[ST99] | D. Sannella, A. Tarlecki, "Algebraic Preliminaries", in Egidio Astesiano, Hans-Joerg Kreowski, Bernd Krieg-Brueckner, "Algebraic Foundations of System Specification", Springer 1999 |
[W90] | M. Wirsing: "Algebraic Specification", in J. van Leeuwen: "Handbook of Theoretical Computer Science", Elsevier 1990 |