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

Bulk types such as sets, bags, and lists are monads, and therefore support a notation for database queries based on comprehensions. This fact is the basis of much work on database query languages. The monadic structure easily explains most of standard relational algebra—specifically, selections and projections—allowing for an elegant mathematical foundation for those aspects of database query language design. Most, but not all: monads do not immediately offer an explanation of relational join or grouping, and hence important foundations for those crucial aspects of relational algebra are missing. The best they can offer is cartesian product followed by selection. Adjunctions come to the rescue: like any monad, bulk types also arise from certain adjunctions; we show that by paying due attention to other important adjunctions, we can elegantly explain the rest of standard relational algebra. In particular, this leads directly to an efficient implementation, even of joins.

Wed 26 Sep

10:30 - 12:00: Research Papers - Semantics at Stifel Theatre
Chair(s): Sam LindleyUniversity of Edinburgh, UK
icfp-2018-papers10:30 - 10:52
Jeremy YallopUniversity of Cambridge, UK, Tamara von GlehnUniversity of Cambridge, Ohad KammarUniversity of Oxford
Link to publication DOI Pre-print
icfp-2018-papers10: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, UK
icfp-2018-papers11:15 - 11:37
Andrew HirschCornell University, Ross TateCornell University
icfp-2018-papers11:37 - 12:00
Brent YorgeyHendrix College, Kenneth Foner