Categorical Data Structures for Technical Computing
Compositionality · 2022
DOI: 10.32408/compositionality-4-5 ↗Kurz gefasst
Fachartikel in der Zeitschrift Compositionality, 2022. Verfasst von Evan Patterson und 2 weiteren Autor:innen. Die Arbeit wurde bisher 13-mal zitiert (Crossref) und nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Many mathematical objects can be represented as functors from finitely-presented categories C to Set . For instance, graphs are functors to Set from the category with two parallel arrows. Such functors are known informally as C -sets. In this paper, we describe and implement an extension of C -sets having data attributes with fixed types, such as graphs with labeled vertices or real-valued edge weights. We call such structures acsets, short for attributed C -sets. Derived from previous work on algebraic databases, acsets are a joint generalization of graphs and data frames. They also encompass more elaborate graph-like objects such as wiring diagrams and Petri nets with rate constants. We develop the mathematical theory of acsets and then describe a generic implementation in the Julia programming language, which uses advanced language features to achieve performance comparable with specialized data structures.
Zitieren
APA
Patterson, E., Lynch, O., & Fairbanks, J. (2022). Categorical Data Structures for Technical Computing. Compositionality. https://doi.org/10.32408/compositionality-4-5
Vancouver
Patterson E, Lynch O, Fairbanks J. Categorical Data Structures for Technical Computing. Compositionality. 2022. doi:10.32408/compositionality-4-5
BibTeX
@article{Patterson2022,
author = {Patterson, Evan and Lynch, Owen and Fairbanks, James},
title = {Categorical Data Structures for Technical Computing},
journal = {Compositionality},
year = {2022},
doi = {10.32408/compositionality-4-5}
}
EUVIMED