How to say Greedy in Fork Algebras
نویسندگان
چکیده
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.
منابع مشابه
Fork Algebras in Usual and in Non-well-founded Set Theories1
Due to their high expressive power and applicability in computer science, fork algebras have intensively been studied lately. In particular, they have been fruitfully applied e.g. in the theory of programming (specification, semantics etc.). The literature of fork algebras has been alive and active for at least five years by now. Some references are: [34], [35], [18], [36], [10], [11], [14], [8...
متن کاملA Short Proof of Representability of Fork Algebras
In this paper a strong relation is demonstrated between fork algebras and quasi-projective relation algebras. With the help of the representation theorem of quasi-projective relation algebras, a short proof is given for the representation theorem of fork algebras. Fork algebras, due to their expressive power and applicability in computing science, have been intensively studied in the last four ...
متن کاملFork Algebras as a Sufficiently Rich Universal Institution
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, several propositional monomodal logics, propositional and first-order dynamic logic, and propositional and first-order linear temporal logic in the theory of fork algebras. In this paper we formalize these interpretabilit...
متن کاملInterpretability of first-order linear temporal logics in fork algebras
In this paper we prove theorems on the interpretability of the first-order temporal logics LTL and TL into Fork Algebras. This result is part of a research project on the interpretability of logics in Fork Algebras, and has important applications towards the relational specification of properties of systems within the Argentum tool.
متن کاملRepresentability and Program Construction within Fork Algebras
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. We show that not only the heuri...
متن کامل