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 SepDisplayed time zone: Guadalajara, Mexico City, Monterrey change
10:30 - 12:00 | |||
10:30 22mTalk | Partially-Static Data as Free Extension of Algebras Research Papers Jeremy Yallop University of Cambridge, UK, Tamara von Glehn University of Cambridge, Ohad Kammar University of Oxford Link to publication DOI Pre-print | ||
10:52 22mTalk | Relational Algebra by Way of AdjunctionsDistinguished Paper Research Papers Jeremy Gibbons Department of Computer Science, University of Oxford, Fritz Henglein Department of Computer Science, University of Copenhagen (DIKU), Ralf Hinze Radboud University Nijmegen, Nicolas Wu University of Bristol, UK DOI | ||
11:15 22mTalk | Strict and Lazy Semantics for Effects: Layering Monads and Comonads Research Papers DOI | ||
11:37 22mTalk | What's the Difference? A Functional Pearl on Subtracting Bijections Research Papers DOI | ||