How to say greedy in fork algebras
- Autores
- Baum, Gabriel Alfredo; Canal, Esteban de la; Frias, Marcelo F.
- Año de publicación
- 2001
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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.
Eje: Teoría
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Algebraic language theory
Greedy
Fork Algebras - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/23523
Ver los metadatos del registro completo
id |
SEDICI_f29706e8d1f641dabf5cc2086e78f252 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/23523 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
How to say greedy in fork algebrasBaum, Gabriel AlfredoCanal, Esteban de laFrias, Marcelo F.Ciencias InformáticasAlgebraic language theoryGreedyFork AlgebrasBecause 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.Eje: TeoríaRed de Universidades con Carreras en Informática (RedUNCI)2001-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23523enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:28:18Zoai:sedici.unlp.edu.ar:10915/23523Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:28:18.794SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
How to say greedy in fork algebras |
title |
How to say greedy in fork algebras |
spellingShingle |
How to say greedy in fork algebras Baum, Gabriel Alfredo Ciencias Informáticas Algebraic language theory Greedy Fork Algebras |
title_short |
How to say greedy in fork algebras |
title_full |
How to say greedy in fork algebras |
title_fullStr |
How to say greedy in fork algebras |
title_full_unstemmed |
How to say greedy in fork algebras |
title_sort |
How to say greedy in fork algebras |
dc.creator.none.fl_str_mv |
Baum, Gabriel Alfredo Canal, Esteban de la Frias, Marcelo F. |
author |
Baum, Gabriel Alfredo |
author_facet |
Baum, Gabriel Alfredo Canal, Esteban de la Frias, Marcelo F. |
author_role |
author |
author2 |
Canal, Esteban de la Frias, Marcelo F. |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Algebraic language theory Greedy Fork Algebras |
topic |
Ciencias Informáticas Algebraic language theory Greedy Fork Algebras |
dc.description.none.fl_txt_mv |
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. Eje: Teoría Red de Universidades con Carreras en Informática (RedUNCI) |
description |
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. |
publishDate |
2001 |
dc.date.none.fl_str_mv |
2001-10 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/23523 |
url |
http://sedici.unlp.edu.ar/handle/10915/23523 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1842260121595412480 |
score |
13.13397 |