Abstract
The way in which Pfn (sets and partial functions) provides a setting for the semantics of deterministic programs [and Rel (sets and relations) provides a setting for the semantics of nondeterministic programs] has led us to axiomatize the notion of a partially-additive monoid. We show that programs incorporating procedure calls may be represented by graph grammars, with one non-terminal and production for each distinct procedure (including the program itself). Program execution may be construed as a process of interpretation of graphs obtained by repeated graph substitution. We show that the resultant interpretive semantics yields the same result as our theory of the canonical fixpoint for abstract recursion schemes introduced in an earlier paper.
International Workshop on Graph Grammars and their Applications to Computer Science and Biology, October 30-November 3, 1978, Bad Honnef, West Germany.
The research reported in this paper was supported in part by the National Science Foundation under grant MCS 76-84477.
Preview
Unable to display preview. Download preview PDF.
References
M. A. Arbib and Y. Give'on: Algebra automata I: Parallel programming as prolegomenon to the categorical approach, Information and Control 12 (1968), 331–345.
M. A. Arbib and E. G. Manes: Partially-additive categories and computer program semantics, COINS Technical Report 78-12, Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01003 (1978), 39 pp.
M. A. Arbib and E. G. Manes: Abstract theory of recursive calls, COINS Tech. Report 78-18, Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01003 (August 1978).
J. W. Backus: Can programming be liberated from the Von Neumann style? A functional style and its algebra of programs, Communications of the ACM 21 (1978), 613–641.
C. C. Elgot: Algebraic theories and program semantics, in Symposium on Semantics of Algorithmic Languages, (E. Engeler, Ed.), Springer Lecture Notes in Mathematics, 188 (1971), 77–88.
E. G. Manes: Algebraic Theories, Springer-Verlag (1976).
D. Scott: The lattice of flow diagrams, in Symposium on Semantics of Algorithmic Languages, (E. Engeler, Ed.), Springer Lecture Notes in Mathematics, 188 (1971), 311–366.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arbib, M.A., Manes, E.G. (1979). Partially-additive monoids, graph-growing, and the algebraic semantics of recursive calls. In: Claus, V., Ehrig, H., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science and Biology. Graph Grammars 1978. Lecture Notes in Computer Science, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025716
Download citation
DOI: https://doi.org/10.1007/BFb0025716
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09525-5
Online ISBN: 978-3-540-35091-0
eBook Packages: Springer Book Archive