Extended Abstract: Comprehending Monoids with Class
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 SepDisplayed time zone: Guadalajara, Mexico City, Monterrey change
08:45 - 10:00 | |||
08:45 10mTalk | Welcome! TyDe | ||
08:55 20mTalk | Extended Abstract: F# OpenCL Type Provider TyDe Kirill Smirenko Saint Petersburg State University, Semyon Grigorev Saint-Petersburg State University, JetBrains Research File Attached | ||
09:15 20mTalk | Extended Abstract: Comprehending Monoids with Class TyDe Media Attached File Attached | ||
09:35 25mResearch paper | Authenticated Modular Maps in Haskell TyDe Victor Cacciari Miraldo Utrecht University, Netherlands, Harold Carr Oracle Labs, USA, Alex Kogan Oracle Labs, USA, Mark Moir Oracle Labs, New Zealand, Maurice Herlihy Brown University, USA DOI |