Abstract
The representation theorem for fork algebras was always misunderstood regarding its applications in program construction. Its application was always described as “the portability of properties of the problem domain into the abstract calculus of fork algebras”. In this paper we show that the results provided by the representation theorem are by far more important. Here we show that not only the heuristic power coming from concrete binary relations is captured inside the abstract calculus, but also design strategies for program development can be successfully expressed. This result makes fork algebras a programming calculus by far more powerful than it was previously thought.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baum, G.A., Frias, M.F., Haeberer, A.M. and Martínez López, P.E., From Specifications to Programs: A Fork-algebraic Approach to Bridge the Gap, to appear in Proceedings of MFCS'96, Springer-Verlag, 1996.
Bird, R., An Introduction to the Theory of Lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, volume 36 of NATO ASI Series F, pp. 3–42. Springer-Verlag, 1987.
Bird, R., A Calculus of Functions for Program Derivation, in Turner D., editor, Research Topics in Functional Programming, University of Texas at Austin Year of Programming Series, Addison-Wesley 287–308, 1990.
Bird, R. and de Moor, O. Relational Program Derivation and Context-free Language Recognition. In A.W. Roscoe, editor, A Classical Mind: Essays dedicated to C. A. R. Hoare. Prentice Hall, 1995.
Chin, L.H. and Tarski, A., Distributive and Modular Laws in the Arithmetic of Relation Algebras, in University of California Publications in Mathematics. University of California, 1951, 341–384.
Frias, M.F., Baum, G.A., Haeberer, A.M. and Veloso, P.A.S., Fork Algebras are Representable, in Bull. Sect. of Logic, University of Łódź, (24)2, 1995, pp.64–75.
Frias, M.F. and Gordillo, S.E., Semantic Optimization of Queries to Deductive Object-Oriented Database, in Proc. of ADBIS'95, Moscow, June 1995, Springer-Verlag, 55–72.
Haeberer, A.M., Baum, G.A. and Schmidt G., On the Smooth Calculation of Relational Recursive Expressions out of First-Order Non-Constructive Specifications Involving Quantifiers, in Proc. of the Intl. Conf. on Formal Methods in Programming and Their Applications, LNCS 735, Springer-Verlag, 1993, 281–298.
Haeberer, A.M. and Veloso, P.A.S., Partial Relations for Program Derivation: Adequacy, Inevitability and Expressiveness, in Constructing Programs from Specifications. North Holland., 1991, 319–371.
Möller, B., Relations as a Program Development Calculus, in Constructing Programs from Specifications, North-Holland, 1991, 373–397.
de Moor, O., Categories, Relations and Dynamic Programming, Math. Structures in Computer Science, Vol.4, pp.33–69, Cambridge University Press, 1994.
Tarski, A., On the Calculus of Relations, Journal of Symbolic Logic, vol. 6, 1941, 73–89.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frias, M.F., Baum, G.A., Haeberer, A.M. (1996). Adding design strategies to fork algebras. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Perspectives of System Informatics. PSI 1996. Lecture Notes in Computer Science, vol 1181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62064-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-62064-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62064-8
Online ISBN: 978-3-540-49637-3
eBook Packages: Springer Book Archive