Abstract
The recently-developed framework of Unified Algebras is intended for axiomatic specification of abstract data types. In contrast, the somewhat older framework of Action Semantics (earlier known as “Abstract Semantic Algebras”) is for denotational specification of programming languages. This paper gives an introduction to the main features of Unified Algebras and Action Semantics, and discusses the relation between them. The two frameworks both exploit nondeterministic choice in unconventional ways.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. M. Burstall and J. A. Goguen. The semantics of CLEAR, a specification language. In Proc. Winter School on Abstract Software Specifications (Copenhagen, 1979). Springer-Verlag (LNCS 86), 1980.
The Concise Oxford dictionary of current English. Oxford University Press, sixth edition, 1976.
H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.
K. Futatsugi, J. A. Goguen, J.-P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proc. POPL'85. ACM, 1985.
J. A. Goguen. Order sorted algebra. Semantics and Theory of Computation Report 14, UCLA Computer Science Dept., 1978.
J. A. Goguen. Higher order functions considered unnecessary for higher order programming. Technical Report SRI-CSL-88-1, Computer Science Lab., SRI International, Jan. 1988.
J. A. Goguen and R. M. Burstall. Introducing institutions. In Proc. Logics of Programming Workshop, pages 221–256. Springer-Verlag (LNCS 164), 1984.
J. A. Goguen and R. M. Burstall. Institutions: Abstract model theory for computer science. Report CSLI-85-30, CSLI, Stanford University, 1985.
J. A. Goguen and J. Meseguer. Order-sorted algebra I: Partial and overloaded operators, errors and inheritance. Technical report, Computer Science Lab., SRI International, 1987.
J. A. Goguen, J. W. Thatcher, and E. G. Wagner. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In R. T. Yeh, editor, Current Trends in Programming Methodology, Volume IV. Prentice-Hall, 1978.
J. A. Goguen and T. Winkler. Introducing OBJ3. Technical Report SRI-CSL-88-9, Computer Science Lab., SRI International, 1988.
M. J. C. Gordon. The Denotational Description of Programming Languages. Springer-Verlag, 1979.
G. Grätzer. Lattice Theory: First Concepts and Distributive Lattices. W. H. Freeman & Co., 1971.
P. D. Mosses. Unified algebras and modules. In Proc. POPL'89. ACM. To appear.
P. D. Mosses. The modularity of action semantics. Internal Report DAIMI IR-75, Computer Science Dept., Aarhus University, 1988. Revised version of a paper presented at a CSLI Workshop on Semantic Issues in Human and Computer Languages, Half Moon Bay, California, March 1987. Available from the author. To appear in SDF Benchmark Series in Computational Linguistics — Workshop II, MIT Press.
P. D. Mosses. Unified algebras and institutions (extended abstract). Internal Report DAIMI IR-83, Computer Science Dept., Aarhus University, 1988. Available from the author; full version in preparation.
P. D. Mosses and D. A. Watt. The use of action semantics. In Proc. IFIP TC2 Working Conference on Formal Description of Programming Concepts III (Gl. Avernæs, 1986). North-Holland, 1987.
D. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76:165–210, 1988.
D. A. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn & Bacon, 1986.
D. S. Scott. Data types as lattices. SIAM J. Comput., 5(3):522–587, 1976.
D. S. Scott and C. Strachey. Toward a mathematical semantics for computer languages. In Proceedings of the Symposium on Computers and Automata, Microwave Research Institute Symposia Series Volume 21. Polytechnic Institute of Brooklyn, 1971.
G. Smolka, W. Nutt, J. A. Goguen, and J. Meseguer. Order-sorted equational computation. SEKI Report SR-87-14, FB Informatik, Universität Kaiserslautern, 1987.
J. E. Stoy. The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.
R. D. Tennent. The denotational semantics of programming languages. Commun. ACM, 19:437–453, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mosses, P.D. (1989). Unified Algebras and action semantics. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028970
Download citation
DOI: https://doi.org/10.1007/BFb0028970
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50840-3
Online ISBN: 978-3-540-46098-5
eBook Packages: Springer Book Archive