Many apparently divergent approaches to specifying formal semantics of programming languages are applications of initial algebra semantics. In this paper an overview of initial algebra semantics is provided. The major technical feature is an initial continuous algebra which permits unified algebraic treatment of iterative and recursive semantic features in the same framework as more basic operations.
No takes yet. Share an insight, caveat, or question.
Goguen et al. (1977) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: