Abstract
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. © 1977, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Goguen, J. A., Thatcher, J. W., Wagner, E. G., & Wright, J. B. (1977). Initial Algebra Semantics and Continuous Algebras. Journal of the ACM (JACM), 24(1), 68–95. https://doi.org/10.1145/321992.321997
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.