Partially-static data structures are a well-known technique for improving binding times.
However, they are often defined in an ad-hoc manner, without a unifying framework to ensure full use of the equations associated with each operation.
We present a foundational view of partially-static data structures as free extensions of algebras for suitable equational theories, i.e. the coproduct of an algebra and a free algebra in the category of algebras and their homomorphisms.
By precalculating these free extensions, we construct a high-level library of partially static data representations for common algebraic structures.
We demonstrate our library with common use-cases from the literature: string and list manipulation, linear algebra, and numerical simplification.
Wed 26 Sep
|10:30 - 10:52|
Jeremy YallopUniversity of Cambridge, UK, Tamara von GlehnUniversity of Cambridge, Ohad KammarUniversity of OxfordLink to publication DOI Pre-print
|10:52 - 11:15|
Jeremy GibbonsDepartment of Computer Science, University of Oxford, Fritz HengleinDepartment of Computer Science, University of Copenhagen (DIKU), Ralf HinzeRadboud University Nijmegen, Nicolas WuUniversity of Bristol, UKDOI
|11:15 - 11:37|
|11:37 - 12:00|