Write a Blog >>
ICFP 2018
Sun 23 - Sat 29 September 2018 St. Louis, Missouri, United States
Wed 26 Sep 2018 10:30 - 10:52 at Stifel Theatre - Semantics Chair(s): Sam Lindley

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.

Conference Day
Wed 26 Sep

Displayed time zone: Guadalajara, Mexico City, Monterrey change

10:30 - 12:00
SemanticsResearch Papers at Stifel Theatre
Chair(s): Sam LindleyUniversity of Edinburgh, UK
10:30
22m
Talk
Partially-Static Data as Free Extension of Algebras
Research Papers
Jeremy YallopUniversity of Cambridge, UK, Tamara von GlehnUniversity of Cambridge, Ohad KammarUniversity of Oxford
Link to publication DOI Pre-print
10:52
22m
Talk
Relational Algebra by Way of AdjunctionsDistinguished Paper
Research Papers
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, UK
DOI
11:15
22m
Talk
Strict and Lazy Semantics for Effects: Layering Monads and Comonads
Research Papers
Andrew HirschCornell University, Ross TateCornell University
DOI
11:37
22m
Talk
What's the Difference? A Functional Pearl on Subtracting Bijections
Research Papers
Brent YorgeyHendrix College, Kenneth Foner
DOI