Partially Static Data as Free Extension of Algebras (Short Paper)
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 that ensures 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.
Tue 9 Jan
|14:00 - 14:30|
Jeremy YallopUniversity of Cambridge, UK, Tamara von GlehnUniversity of Cambridge, Ohad KammarUniversity of OxfordPre-print
|14:30 - 15:00|
|15:00 - 15:30|
Barry JayUniversity of Technology SydneyDOI