This HTML5 document contains 35 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n2https://kar.kent.ac.uk/id/eprint/
n13https://kar.kent.ac.uk/66631/
wdrshttp://www.w3.org/2007/05/powder-s#
dchttp://purl.org/dc/elements/1.1/
n6http://purl.org/ontology/bibo/status/
n15https://kar.kent.ac.uk/id/subject/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n11https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n3http://eprints.org/ontology/
bibohttp://purl.org/ontology/bibo/
n19https://kar.kent.ac.uk/id/publication/
n20https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8doi:10.1016/
owlhttp://www.w3.org/2002/07/owl#
n4https://kar.kent.ac.uk/id/document/
n17https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n18https://kar.kent.ac.uk/id/eprint/66631#
n16https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:66631
rdf:type
bibo:Article bibo:AcademicArticle n3:ArticleEPrint n3:EPrint
rdfs:seeAlso
n13:
owl:sameAs
n8:j.ic.2018.05.008
n3:hasAccepted
n4:1033542
n3:hasDocument
n4:1514030 n4:1033542 n4:1034304 n4:2977834 n4:2977835 n4:1659569 n4:2977836 n4:1514027 n4:2977837 n4:1659651 n4:1514028 n4:1514029
n3:hasPublished
n4:1659569
dc:hasVersion
n4:1659569 n4:1033542
dcterms:title
Complexity bounds for container functors and comonads
wdrs:describedby
n11:export_kar_RDFN3.n3 n21:export_kar_RDFN3.n3
dcterms:date
2018-05-15
dcterms:creator
n16:ext-d.a.orchard@kent.ac.uk
bibo:status
n6:peerReviewed n6:published
dcterms:publisher
n20:ext-f308aad1ef8f70546c3a197f104f2ad5
bibo:abstract
The notion of containers, due to Abbott et al., characterises a subset of parametric data types which can be described by a set of shapes and a set of positions for each shape. This includes common data types such as tuples, lists, trees, arrays, and graphs. Various useful categorical structures can be derived for containers that have some additional structure on their shapes and positions. For example, the notion of a directed container (due to Ahman et al.) gives rise to container comonads. Containers, and refinements such as directed containers, provide a useful reasoning tool for data types and an abstraction mechanism for programming, e.g., building libraries parameterised over containers. This paper studies the performance characteristics of traversal schemes over containers modelled by additional functor and comonad structure. A cost model for container transformations is defined from which complexity bounds for the operations of container functors and comonads are derived. This provides a reasoning principle for the performance of programs structured using these idioms, suggesting optimisations which follow from the underling mathematical structure. Due to the abstract interface provided by the syntax of containers and category theory, the complexity bounds and subsequent optimisations they imply are implementation agnostic (machine free). As far as we are aware, this is the first such study of the performance characteristics of containers.
dcterms:isPartOf
n17:repository n19:ext-08905401
dcterms:subject
n15:QA9
bibo:authorList
n18:authors