Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2012-11-02T13:20:50Z
dc.date.available 2012-11-02T13:20:50Z
dc.date.issued 1999-10
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/23523
dc.description.abstract 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. en
dc.language en es
dc.subject Algebraic language theory es
dc.subject Greedy en
dc.subject Fork Algebras en
dc.title How to say greedy in fork algebras en
dc.type Objeto de conferencia es
sedici.creator.person Baum, Gabriel Alfredo es
sedici.creator.person Canal, Esteban de la es
sedici.creator.person Frias, Marcelo F. es
sedici.description.note Eje: Teoría es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Red de Universidades con Carreras en Informática (RedUNCI) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
sedici.date.exposure 2001-10
sedici.relation.event V Congreso Argentino de Ciencias de la Computación es
sedici.description.peerReview peer-review es


Download Files

Thumbnail
Documento completo
Download file (152.1Kb) - PDF

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)