An investigation of the laws of traversals
- Autores
- Jaskelioff, Mauro Javier; Rypacek, Ondrej
- Año de publicación
- 2012
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been characterised by McBride and Paterson as those equipped with a distributive law over arbitrary applicative functors; however, laws that fully capture the intuition behind traversals are missing. This article is an attempt to remedy this situation by proposing laws for characterising traversals that capture the intuition behind them. To support our claims, we prove that finitary containers are traversable in our sense and argue that elements in a traversable structure are visited exactly once.
Fil: Jaskelioff, Mauro Javier. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas. Universidad Nacional de Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas; Argentina
Fil: Rypacek, Ondrej. Kings College London (kcl); - Materia
-
TRAVERSAL
DISTRIBUTIVE LAW
FUNCTIONAL PROGRAMMING - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/102401
Ver los metadatos del registro completo
id |
CONICETDig_13203b7a0cd5bcea57d9581f14206a13 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/102401 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
An investigation of the laws of traversalsJaskelioff, Mauro JavierRypacek, OndrejTRAVERSALDISTRIBUTIVE LAWFUNCTIONAL PROGRAMMINGhttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been characterised by McBride and Paterson as those equipped with a distributive law over arbitrary applicative functors; however, laws that fully capture the intuition behind traversals are missing. This article is an attempt to remedy this situation by proposing laws for characterising traversals that capture the intuition behind them. To support our claims, we prove that finitary containers are traversable in our sense and argue that elements in a traversable structure are visited exactly once.Fil: Jaskelioff, Mauro Javier. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas. Universidad Nacional de Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas; ArgentinaFil: Rypacek, Ondrej. Kings College London (kcl);Open Publishing Association2012-02info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/102401Jaskelioff, Mauro Javier; Rypacek, Ondrej; An investigation of the laws of traversals; Open Publishing Association; Electronic Proceedings in Theoretical Computer Science; 76; 2-2012; 40-492075-2180CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.4204/EPTCS.76.5info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1202.2919v1info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:36:41Zoai:ri.conicet.gov.ar:11336/102401instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 10:36:41.568CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
An investigation of the laws of traversals |
title |
An investigation of the laws of traversals |
spellingShingle |
An investigation of the laws of traversals Jaskelioff, Mauro Javier TRAVERSAL DISTRIBUTIVE LAW FUNCTIONAL PROGRAMMING |
title_short |
An investigation of the laws of traversals |
title_full |
An investigation of the laws of traversals |
title_fullStr |
An investigation of the laws of traversals |
title_full_unstemmed |
An investigation of the laws of traversals |
title_sort |
An investigation of the laws of traversals |
dc.creator.none.fl_str_mv |
Jaskelioff, Mauro Javier Rypacek, Ondrej |
author |
Jaskelioff, Mauro Javier |
author_facet |
Jaskelioff, Mauro Javier Rypacek, Ondrej |
author_role |
author |
author2 |
Rypacek, Ondrej |
author2_role |
author |
dc.subject.none.fl_str_mv |
TRAVERSAL DISTRIBUTIVE LAW FUNCTIONAL PROGRAMMING |
topic |
TRAVERSAL DISTRIBUTIVE LAW FUNCTIONAL PROGRAMMING |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.2 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been characterised by McBride and Paterson as those equipped with a distributive law over arbitrary applicative functors; however, laws that fully capture the intuition behind traversals are missing. This article is an attempt to remedy this situation by proposing laws for characterising traversals that capture the intuition behind them. To support our claims, we prove that finitary containers are traversable in our sense and argue that elements in a traversable structure are visited exactly once. Fil: Jaskelioff, Mauro Javier. Universidad Nacional de Rosario; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas. Universidad Nacional de Rosario. Centro Internacional Franco Argentino de Ciencias de la Información y de Sistemas; Argentina Fil: Rypacek, Ondrej. Kings College London (kcl); |
description |
Traversals of data structures are ubiquitous in programming. Consequently, it is important to be able to characterise those structures that are traversable and understand their algebraic properties. Traversable functors have been characterised by McBride and Paterson as those equipped with a distributive law over arbitrary applicative functors; however, laws that fully capture the intuition behind traversals are missing. This article is an attempt to remedy this situation by proposing laws for characterising traversals that capture the intuition behind them. To support our claims, we prove that finitary containers are traversable in our sense and argue that elements in a traversable structure are visited exactly once. |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012-02 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/102401 Jaskelioff, Mauro Javier; Rypacek, Ondrej; An investigation of the laws of traversals; Open Publishing Association; Electronic Proceedings in Theoretical Computer Science; 76; 2-2012; 40-49 2075-2180 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/102401 |
identifier_str_mv |
Jaskelioff, Mauro Javier; Rypacek, Ondrej; An investigation of the laws of traversals; Open Publishing Association; Electronic Proceedings in Theoretical Computer Science; 76; 2-2012; 40-49 2075-2180 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.4204/EPTCS.76.5 info:eu-repo/semantics/altIdentifier/url/https://arxiv.org/abs/1202.2919v1 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Open Publishing Association |
publisher.none.fl_str_mv |
Open Publishing Association |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1844614387546980352 |
score |
13.070432 |