How to say greedy in fork algebras
Gabriel Alfredo Baum, Esteban de la Canal, Marcelo Fabian Frias · El Servicio de Difusión de la Creación Intelectual (National University of La Plata) · 1999
Because of their expressive power, binary relations are widely used in program specification and development within formal calculi. The existence of a finite equational axiomatization for algebras of binary relations with a fork operation guarantees that the heuristic power coming from binary relations is captured inside an abstract equational calculus. In this paper we show how to express the greedy program design strategy into the first order theory of fork algebras.