{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T18:45:51Z","timestamp":1776969951358,"version":"3.51.4"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2026,4,23]]},"abstract":"<jats:p>From the moment of their inception, languages for relational data have been described as sublanguages embedded in a host programming language. Rel is a new relational language that goes beyond this paradigm, with features that allow for programming in the large, making it possible to fully describe end to end application semantics. With the new approach we can model the semantics of entire enterprise applications relationally, which helps significantly reduce architecture complexity and avoid the well-known impedance mismatch problem. This paradigm shift is enabled by 50 years of database research, making it possible to revisit the sublanguage\/host language paradigm, starting from the fundamental principles. We present a gentle introduction to Rel and the principles behind its design philosophy.<\/jats:p>","DOI":"10.1145\/3810900.3810918","type":"journal-article","created":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T18:16:38Z","timestamp":1776968198000},"page":"97-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Relational Programming in Rel"],"prefix":"10.1145","volume":"55","author":[{"given":"Molham","family":"Aref","sequence":"first","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Guagliardo","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Kastrinis","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Libkin","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Marsault","sequence":"additional","affiliation":[{"name":"LIGM, Univ. Gustave Eiffel, CNRS, Champs-sur-Marne, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mary","family":"McGrath","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"Murlak","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warszawa, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathaniel","family":"Nystrom","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liat","family":"Peterfreund","sequence":"additional","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allison","family":"Rogers","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina","family":"Sirangelo","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domagoj","family":"Vrgo?c","sequence":"additional","affiliation":[{"name":"PUC Chile, Santiago, Regi\u00f3n Metropolitana, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Zhao","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Zreika","sequence":"additional","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,4,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3722212.3724450"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742796"},{"key":"e_1_2_1_3_1","volume-title":"Database Theory. Open source at https:\/\/github.com\/pdm-book\/community","author":"Arenas M.","year":"2022","unstructured":"M. Arenas, P. Barcel\u00b4o, L. Libkin, W. Martens, and A. Pieris. Database Theory. Open source at https:\/\/github.com\/pdm-book\/community, 2022."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359579"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086642.1086647"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2005.06.028"},{"key":"e_1_2_1_7_1","volume-title":"The top programming languages","author":"Cass S.","year":"2024","unstructured":"S. Cass. The top programming languages 2024. https: \/\/spectrum.ieee.org\/top-programming-languages-2024."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"e_1_2_1_9_1","first-page":"35","volume-title":"ACM-SIGFIDET Workshop on Data Description 1971","author":"Codd E. F.","year":"1971","unstructured":"E. F. Codd. A database sublanguage founded on the relational calculus. In ACM-SIGFIDET Workshop on Data Description 1971, pages 35--68. ACM, 1971."},{"key":"e_1_2_1_10_1","volume-title":"RJ987","author":"Codd E. F.","year":"1972","unstructured":"E. F. Codd. Relational completeness of data base sublanguages. IBM Research Report, RJ987, 1972."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320109"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/358396.358400"},{"key":"e_1_2_1_13_1","volume-title":"Database Technology: Nulls Considered Harmful","author":"Date C. J.","year":"2024","unstructured":"C. J. Date. Database Technology: Nulls Considered Harmful. Technics Publications, 2024."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/862872"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3725688.3725707"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-8265-9_979"},{"key":"e_1_2_1_17_1","first-page":"1","volume-title":"ICDT","author":"Guagliardo P.","year":"2025","unstructured":"P. Guagliardo, L. Libkin, V. Marsault, W. Martens, F. Murlak, L. Peterfreund, and C. Sirangelo. Queries with external predicates. In ICDT, pages 22:1--22:20, 2025."},{"key":"e_1_2_1_18_1","volume-title":"Morgan Kaufmann","author":"Halpin T. A.","year":"2008","unstructured":"T. A. Halpin and T. Morgan. Information modeling and relational databases. Morgan Kaufmann, 2008."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/211414.211419"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460833.1460872"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142363"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3584372.3588661"},{"issue":"5","key":"e_1_2_1_23_1","first-page":"1","article-title":"Bag semantics query containment: The CQ vs. UCQ case and other stories","volume":"3","author":"Marcinkowski J.","year":"2025","unstructured":"J. Marcinkowski and P. Ostropolski-Nalewaja. Bag semantics query containment: The CQ vs. UCQ case and other stories. PACMMOD, 3(5):1--24, 2025.","journal-title":"PACMMOD"},{"key":"e_1_2_1_24_1","volume-title":"Database Management Systems","author":"Ramakrishnan R.","year":"2003","unstructured":"R. Ramakrishnan and J. Gehrke. Database Management Systems. McGraw-Hill, 2003."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010085415024"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551818"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3810900.3810918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T18:16:58Z","timestamp":1776968218000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3810900.3810918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,23]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4,23]]}},"alternative-id":["10.1145\/3810900.3810918"],"URL":"https:\/\/doi.org\/10.1145\/3810900.3810918","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4,23]]},"assertion":[{"value":"2026-04-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}