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.
CITATION STYLE
Frias, M. F., Baum, G. A., & Haeberer, A. M. (1996). Adding design strategies to fork algebras. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1181, pp. 214–226). Springer Verlag. https://doi.org/10.1007/3-540-62064-8_19
Mendeley helps you to discover research relevant for your work.