About: Complexity bounds for container functors and comonads

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Complexity bounds for container functors and comonads Goto Sponge NotDistinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : demo.openlinksw.com associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ArticleEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #66631 Complexity bounds for container functors and comonads
sameAs	Complexity bounds for container functors and comonads
http://eprints.org/ontology/hasAccepted	Complexity bounds for container functors and comonads (PDF)
http://eprints.org/ontology/hasDocument	Complexity bounds for container functors and comonads (PDF) Complexity bounds for container functors and comonads (Other) Complexity bounds for container functors and comonads (Other) Complexity bounds for container functors and comonads (Other) Complexity bounds for container functors and comonads (Other) Complexity bounds for container functors and comonads (Other) Complexity bounds for container functors and comonads (PDF) Complexity bounds for container functors and comonads (Other) Complexity bounds for container functors and comonads (Other) Complexity bounds for container functors and comonads (Other) Complexity bounds for container functors and comonads (Other) Complexity bounds for container functors and comonads (Other)
http://eprints.org/ontology/hasPublished	Complexity bounds for container functors and comonads (PDF)
dc:hasVersion	Complexity bounds for container functors and comonads (PDF) Complexity bounds for container functors and comonads (PDF)
Title	Complexity bounds for container functors and comonads
described by	https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3 https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
Date	2018-05-15
Creator	Dominic A. Orchard
status	peer reviewed published
Publisher	Elsevier
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.
Is Part Of	Information and Computation https://kar.kent.ac.uk/id/repository
Subject	QA 9 Formal systems, logics
list of authors	https://kar.kent.ac.uk/id/eprint/66631#authors
is topic of	https://www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3 https://raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #66631 Complexity bounds for container functors and comonads

Faceted Search & Find service v1.17_git144 as of Jul 26 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Aug 25 2024, on Linux (x86_64-ubuntu_noble-linux-glibc2.38-64), Single-Server Edition (378 GB total memory, 27 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software