Initial Algebra Semantics and Continuous Algebras
Authors:
Open Access
- 1 January 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 24 (1) , 68-95
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.Keywords
This publication has 27 references indexed in Scilit:
- IO and OIDAIMI Report Series, 1975
- Semantics of computation1975
- The algebraic theory of recursive program schemes1975
- Translations on a context free grammarInformation and Control, 1971
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Heterogeneous algebrasJournal of Combinatorial Theory, 1970
- Automata in general algebrasInformation and Control, 1967
- Algebras with a Scheme of OperatorsMathematische Nachrichten, 1963
- A syntax directed compiler for ALGOL 60Communications of the ACM, 1961
- On the Structure of Abstract AlgebrasMathematical Proceedings of the Cambridge Philosophical Society, 1935