In computer science, algebraic semantics is a form of axiomatic semantics based on algebraic laws for describing and reasoning about program specifications in a formal manner.[1][2][3][4]

## Syntax

The syntax of an algebraic specification is formulated in two steps: (1) defining a formal signature of data types and operation symbols, and (2) interpreting the signature through sets and functions.

### Definition of a signature

The signature of an algebraic specification defines its formal syntax. The word "signature" is used like the concept of "key signature" in musical notation.

A signature consists of a set ${\displaystyle S}$ of data types, known as sorts, together with a family ${\displaystyle \Sigma }$ of sets, each set containing operation symbols (or simply symbols) that relate the sorts. We use ${\displaystyle \Sigma _{s_{1}s_{2}...s_{n},~s))$ to denote the set of operation symbols relating the sorts ${\displaystyle s_{1},~s_{2},~...,~s_{n}\in S}$ to the sort ${\displaystyle s\in S}$.

For example, for the signature of integer stacks, we define two sorts, namely, ${\displaystyle int}$ and ${\displaystyle stack}$, and the following family of operation symbols:

{\displaystyle {\begin{aligned}\Sigma _{\Lambda ,~stack}&=\((\rm {new))\}\\\Sigma _{int~stack,~stack}&=\((\rm {push))\}\\\Sigma _{stack,~stack}&=\((\rm {pop))\}\\\Sigma _{stack,~int}&=\((\rm {depth)),{\rm {top))\}\\\end{aligned))}

where ${\displaystyle \Lambda }$ denotes the empty string.

### Set-theoretic interpretation of signature

An algebra ${\displaystyle A}$ interprets the sorts and operation symbols as sets and functions. Each sort ${\displaystyle s}$ is interpreted as a set ${\displaystyle A_{s))$, which is called the carrier of ${\displaystyle A}$ of sort ${\displaystyle s}$, and each symbol ${\displaystyle \sigma }$ in ${\displaystyle \Sigma _{s_{1}s_{2}...s_{n},~s))$ is mapped to a function ${\displaystyle \sigma _{A}:A_{s_{1))\times A_{s_{2))\times ~...\times ~A_{s_{n))}$, which is called an operation of ${\displaystyle A}$.

With respect to the signature of integer stacks, we interpret the sort ${\displaystyle int}$ as the set ${\displaystyle \mathbb {Z} }$ of integers, and interpret the sort ${\displaystyle stack}$ as the set ${\displaystyle Stack}$ of integer stacks. We further interpret the family of operation symbols as the following functions:

{\displaystyle {\begin{aligned}{\rm {new))&:~\to Stack\\{\rm {push))&:~\mathbb {Z} \times Stack\to Stack\\{\rm {pop))&:~Stack\to Stack\\{\rm {depth))&:~Stack\to \mathbb {Z} \\{\rm {top))&:~Stack\to \mathbb {Z} \\\end{aligned))}

## Semantics

Semantics refers to the meaning or behavior. An algebraic specification provides both the meaning and behavior of the object in question.

### Equational axioms

The semantics of an algebraic specifications is defined by axioms in the form of conditional equations.[1]

With respect to the signature of integer stacks, we have the following axioms:

For any ${\displaystyle z\in \mathbb {Z} }$ and ${\displaystyle s\in Stack}$,
{\displaystyle {\begin{aligned}&A1:~~{\rm {pop))({\rm {push))(z,s))=s\\&A2:~~{\rm {depth))({\rm {push))(z,s))={\rm {depth))(s)+1\\&A3:~~{\rm {top))({\rm {push))(z,s))=z\\&A4:~~{\rm {pop))({\rm {new)))={\rm {new))\\&A5:~~{\rm {depth))({\rm {new)))=0\\&A6:~~{\rm {top))(s)=-404~{\rm {if~depth))(s)=0\\\end{aligned))}
where "${\displaystyle -404}$" indicates "not found".

### Mathematical semantics

The mathematical semantics (also known as denotational semantics)[5] of a specification refers to its mathematical meaning.

The mathematical semantics of an algebraic specification is the class of all algebras that satisfy the specification. In particular, the classic approach by Goguen et al.[1][2] takes the initial algebra (unique up to isomorphism) as the "most representative" model of the algebraic specification.

### Operational semantics

The operational semantics[6] of a specification means how to interpret it as a sequence of computational steps.

We define a ground term as an algebraic expression without variables. The operational semantics of an algebraic specification refers to how ground terms can be transformed using the given equational axioms as left-to-right rewrite rules, until such terms reach their normal forms, where no more rewriting is possible.

Consider the axioms for integer stacks. Let "${\displaystyle \Rrightarrow }$" denote "rewrites to".

{\displaystyle {\begin{aligned}&{\rm {top))({\rm {pop))({\rm {pop))({\rm {push))(1,~{\rm {push))(2,~{\rm {push))(3,~{\rm {pop))({\rm {new)))))))))&\\\Rrightarrow ~&{\rm {top))({\rm {pop))({\rm {pop))({\rm {push))(1,~{\rm {push))(2,~{\rm {push))(3,~{\rm {new))))))))&({\rm {by~Axiom~))A4)\\\Rrightarrow ~&{\rm {top))({\rm {pop))({\rm {push))(2,~{\rm {push))(3,~{\rm {new))))))&({\rm {by~Axiom~))A1)\\\Rrightarrow ~&{\rm {top))({\rm {push))(3,~{\rm {new))))&({\rm {by~Axiom~))A1)\\\Rrightarrow ~&3&({\rm {by~Axiom~))A3)\\\end{aligned))}

### Canonical property

An algebraic specification is said to be confluent (also known as Church-Rosser) if the rewriting of any ground term leads to the same normal form. It is said to be terminating if the rewriting of any ground term will lead to a normal form after a finite number of steps. The algebraic specification is said to be canonical (also known as convergent) if it is both confluent and terminating. In other words, it is canonical if the rewriting of any ground term leads to a unique normal form after a finite number of steps.

Given any canonical algebraic specification, the mathematical semantics agrees with the operational semantics.[7]

As a result, canonical algebraic specifications have been widely applied to address program correctness issues. For example, numerous researchers have applied such specifications to the testing of observational equivalence of objects in object-oriented programming. See Chen and Tse[8] as a secondary source that provides a historical review of prominent research from 1981 to 2013.

## References

1. ^ a b c J.A. Goguen; J.W. Thatcher; E.G. Wagner; J.B. Wright (1977). "Initial algebra semantics and continuous algebras". Journal of the ACM. 24 (1): 68–95. doi:10.1145/321992.321997. S2CID 11060837.
2. ^ a b J.A. Goguen; J.W. Thatcher; E.G. Wagner (1978). "An initial algebra approach to the specification, correctness and implementation of abstract data types". In R.T. Yeh (ed.). Current Trends in Programming Methodology, Vol. IV: Data Structuring. Prentice Hall. pp. 80–149.
3. ^ J.A. Goguen; C. Kirchner; H. Kirchner; A. Megrelis; J. Meseguer (1988). "An introduction to OBJ3". Proceedings of the First Workshop on Conditional Term Rewriting Systems. Lecture Notes in Computer Science. Vol. 308. Springer. pp. 258–263. doi:10.1007/3-540-19242-5_22. ISBN 978-3-540-19242-8.
4. ^ J.A. Goguen; G. Malcolm (1996). Algebraic Semantics of Imperative Programs. MIT Press. ISBN 9780262071727.
5. ^ David A. Schmidt (1986). Denotational Semantics: A Methodology for Language Development. William C. Brown Publishers. ISBN 9780205104505.
6. ^ Gordon D. Plotkin (1981). "A structural approach to operational semantics" (Technical Report DAIMI FN-19). Computer Science Department, Aarhus University.
7. ^ S. Lucas; J. Meseguer (2014). "Strong and Weak Operational Termination of Order-Sorted Rewrite Theories". In S. Escobar (ed.). Rewriting Logic and Its Applications. Lecture Notes in Computer Science. Vol. 8663. Cham: Springer. pp. 178–194. doi:10.1007/978-3-319-12904-4_10. ISBN 978-3-319-12903-7.
8. ^ H.Y. Chen; T.H. Tse (2013). "Equality to equals and unequals: A revisit of the equivalence and nonequivalence criteria in class-level testing of object-oriented software". IEEE Transactions on Software Engineering. 39 (11): 1549–1563. doi:10.1109/TSE.2013.33. hdl:10722/187124. S2CID 8694513.