Tue 9 Jan 2018 14:00 - 14:30 at Crocker - Session 2-2 Chair(s): Kohei Suenaga

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.

Conference Day
Tue 9 Jan

Displayed time zone: Tijuana, Baja California change

14:00 - 15:30
Session 2-2PEPM at Crocker
Chair(s): Kohei SuenagaGraduate School of Informatics, Kyoto University
14:00
30m
Talk
Partially Static Data as Free Extension of Algebras (Short Paper)
PEPM
Jeremy YallopUniversity of Cambridge, UK, Tamara von GlehnUniversity of Cambridge, Ohad KammarUniversity of Oxford
Pre-print
14:30
30m
Talk
Program Generation for ML Modules (Short Paper)
PEPM
Takahisa WatanabeUniversity of Tsukuba, Japan, Yukiyoshi KameyamaUniversity of Tsukuba, Japan
DOI
15:00
30m
Talk
Recursive Programs in Normal Form (Short Paper)
PEPM
Barry JayUniversity of Technology Sydney
DOI