Initial Algebra Semantics and Continuous Algebras

@article{Goguen1977InitialAS,
  title={Initial Algebra Semantics and Continuous Algebras},
  author={Joseph A. Goguen and James W. Thatcher and Eric G. Wagner and Jesse B. Wright},
  journal={Journal of the ACM (JACM)},
  year={1977},
  volume={24},
  pages={68 - 95}
}
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. 

Figures from this paper

Unified Algebras and Abstract Syntax
TLDR
The expressiveness of unified algebraic specifications is illustrated, and a grammar-like notation for specifying abstract syntax is provided, particularly attractive for use in semantic descriptions of full-scale programming languages.
Terminal Algebra Semantics and Retractions for Abstract Data Types
TLDR
This paper develops a theory of terminal algebra semantics, and it is shown that a t-abstract data type is a terminal object in the categories of terminal models and implementations of an abstract data type specification.
A unifying theorem for algebraic semantics and dynamic logics
A unified single proof is given which implies theorems in such diverse fields as continuous algebras of algebraic semantics, dynamic algebras of logics of programs and program verification methods
Initial Algebra Semantics and Concurrency
  • M. Zamfir
  • Computer Science, Mathematics
    MFPS
  • 1987
TLDR
It is shown that diamonds are free in the category of continuous parallel-nondeterministic algebras and some results concerning categories of continuous algeBRas, which can be found in the work of the ADJ group are presented in a self-contained form.
Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specifications With Inequalities
A generalization of our terminal algebra semantics approach is presented. We then give a uniform initial/terminal semantics of parameterized data type specifications.
An Analysis of Semantic Models for Algebraic Specifications
TLDR
A more concrete semantics encompassing these different approaches to semantic models for data structures, algorithms and programming languages is presented.
A continuous algebraic semantics of CSP
  • Zhiming Liu
  • Computer Science
    Journal of Computer Science and Technology
  • 2008
This is an attempt to use continous algebras to describe the semantics of CSP—continuity being used to solve recursive definitions of processes as infinite objects. By so doing, we combine the
Some Fundamentals of Order-Algebraic Semantics
The order-theoretic enrichment of the algebraic approach to theoretical computer science, and to the theory of programming in particular, can be accomplished rather directly and elegantly, and
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 108 REFERENCES
Algebraic Automata and Context-Free Sets
On the Structure of Abstract Algebras
The following paper is a study of abstract algebras qua abstract algebras. As no vocabulary suitable for this purpose is current, I have been forced to use a number of new terms, and extend the
Semantics and axiomatics of a simple recursive language.
TLDR
The semantics used is the “best” possible if one admits the validity of Algol's copy rule, and the proof system is complete with respect to the semantics.
Generalized Sequential Machine Maps
PROGRAMS AND THEIR PROOFS: AN ALGEBRAIC APPROACH,
TLDR
A method of defining some functions as homomorphisms instead of giving recursive or iterative definitions is explained, and a proof of the correctness of a simple compiler for expressions is given.
An algebraic theory of recursive definitions and recursive languages
TLDR
This paper presents the fundamental concepts and theorems concerning the basic structure (basic syntax), the semantics and the combination and manipulation of “recursive definitions” and the closure properties of ”recursive languages”.
Correctness of translations of programming languages--an algebraic approach
TLDR
Under these mathematical tools, proofs can be provided systematically of the correctness of compilers for fragmentary programming languages, each embodying a single language 'feature', as well as for statement sequences, arithmetic expressions, Boolean expressions, assignment statements, and statements.
On the Relation between Direct and Continuation Semantics
TLDR
This work gives two theorems which specify the relationship between the direct and the continuation semantic functions for a purely applicative language and shows that direct semantics are included in continuation semantics.
Properties of Programs and the First-Order Predicate Calculus
  • Z. Manna
  • Computer Science, Mathematics
    JACM
  • 1969
TLDR
The correctness and equivalence problems of abstract programs are shown to be reducible to the termination problem and known proof procedures for the first-order predicate calculus can be applied to prove the termination of both programs and abstract programs.
...
1
2
3
4
5
...