Abstract
One concern in making the calculation of algorithms a formal mathematical activity is succinctness of notation and proof. Here we consider two recent contributions to this concern that we believe to be valuable. The contributions show how matrix algebra and relation algebra, respectively, enhance succinctness in the formal calculation of algorithms for path problems (amongst others) in graphs. The contributions are independent, and use different notations and proof strategies. However, the differences can be reconciled. Here we show how to make this reconciliation. The reconciliation is valuable for two reasons. First, it provides a straightforward synthesis of overlapping aspects of the two independent pieces of work, revealing the common ground behind superficially different appearances. Second, it prompts consideration of a unifying abstract framework as the basis for further algorithm calculations. An appropriate unifying framework is shown to be dynamic algebra.
This work was carried out while on leave during 1994 at CWI, Amsterdam. The author gratefully achknowledges the support of the CWI.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Roland C. Backhouse, J.P.H.W. van den Eijnde, and A.J.M. van Gasteren. Calculating path algorithms. Science of Computer Programming, 1994.
Bernard Carré. Graphs and Networks. Clarendon Press, Oxford, 1979.
Michel Gondran and Michel Minoux. Graphs and Algorithms. WileyInterscience, New York, 1984.
Jonathon S. Golan. The Theory of Semirings with Applications in Mathematics and Computer Science. Longman Scientific and Technical, 1992.
Udo Hebisch. The Kleene theorem in countably complete semirings. Bayreuther Mathematische Schriften, 31: 55–66, 1990.
Jeffrey H. Kingston. Algorithms and Data Structures: Design, Correctness, and Analysis. Addison-Wesley, 1990.
Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110 (2), 1994.
Werner Kuich and Arto Salomaa. Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1986.
Bernhard Möller. Derivation of graph and pointer algorithms. Technical report, Institut fur Mathematik, Augsburg, 1993.
V.R. Pratt. Dynamic algebras as a well-behaved fragment of relation algebras. In D.L. Pigozzi C.H. Bergman, R.D. Maddux, editor, Algebraic Logic and Universal Algebra in Computer Science (Iowa 1988),LNCS 425, 1990. Springer-Verlag.
Gunther Schmidt and Thomas Strölein. Relations and graphs Springer-Verlag, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag London
About this paper
Cite this paper
Clenaghan, K. (1995). Dynamic Algebra for Calculating Algorithms. In: Hammond, K., Turner, D.N., Sansom, P.M. (eds) Functional Programming, Glasgow 1994. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3573-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3573-9_2
Publisher Name: Springer, London
Print ISBN: 978-3-540-19914-4
Online ISBN: 978-1-4471-3573-9
eBook Packages: Springer Book Archive