2026-08-14T22:38:15Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23325 2025-06-25T13:20:37Z ddc:004 open_access

Mono Types - First-Class Containers for Datalog Xu, Runqing Klopp, David Erdweg, Sebastian Datalog compiler optimization We propose mono types, a new abstraction for programming Datalog. Mono types behave like first-class containers that can be stored in relations and to which elements can be added decentrally. But, mono types are more than just containers: They provide a read operation that can yield any result as long as it monotonically grows with each added element and is independent of the order in which elements are added to the container. This design permits a wide range of mono types (e.g., sets, maps, and aggregations), yet guarantees mono types can be integrated into Datalog without jeopardizing Datalog’s least fixed-point semantics. We develop a theory for mono types, which includes constructions for complex mono types, equivalence relation for mono types, and properties about semantics-preserving mono-type transformations. This theory ensures sound Datalog integration and justifies crucial compiler optimizations for mono types. Together, these techniques demonstrate that mono types provide abstraction without regret: We demonstrate in two case studies that programs become easier to write with mono types, while their performance also improves drastically. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Runqing Xu and David Klopp and Sebastian Erdweg 2025 Is Part Of LIPIcs, Volume 333, 39th European Conference on Object-Oriented Programming (ECOOP 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECOOP.2025.33 urn:nbn:de:0030-drops-233250 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2025.33 eng https://creativecommons.org/licenses/by/4.0/legalcode