Write a Blog >>
ICFP 2018
Sun 23 - Sat 29 September 2018 St. Louis, Missouri, United States
Thu 27 Sep 2018 09:15 - 09:35 at New York Central - Applications and Monoids Chair(s): Daan Leijen

The design of embedded database query languages has long relied on monadic comprehension (and specifically list comprehension), a natural foundation for expressing queries over collections of data. We argue that monoid comprehension is an interesting alternative foundation for such languages. We show that a generalized version of the monoid comprehension calculus can be naturally encoded in languages with support for type classes, and that this unlocks a new kind of expressive power — among other things, it gives us a grouping construct for free and it allows queries mixing heterogeneous data types (lists, sets, multisets, in nite streams, maps, etc.), while using the type system to statically verify some desirable properties about these queries. We believe that these new directions have the potential of making language-integrated queries more pleasant to use, more expressive, and eventually easier to optimize.

Compehending Monoids with Class (tyde-18_comprehend-monoids.pdf)375KiB

Thu 27 Sep
Times are displayed in time zone: Guadalajara, Mexico City, Monterrey change

08:45 - 10:00: Applications and MonoidsTyDe at New York Central
Chair(s): Daan LeijenMicrosoft Research, USA
08:45 - 08:55
Richard A. EisenbergBryn Mawr College, USA, Niki VazouUniversity of Maryland, USA
08:55 - 09:15
Extended Abstract: F# OpenCL Type Provider
Kirill SmirenkoSaint Petersburg State University, Semyon GrigorevSaint-Petersburg State University, JetBrains Research
File Attached
09:15 - 09:35
Extended Abstract: Comprehending Monoids with Class
Media Attached File Attached
09:35 - 10:00
Research paper
Authenticated Modular Maps in Haskell
Victor Cacciari MiraldoUtrecht University, Netherlands, Harold CarrOracle Labs, USA, Alex KoganOracle Labs, USA, Mark MoirOracle Labs, New Zealand, Maurice HerlihyBrown University, USA