Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2019

Scoping monadic relational database queries

Anton Ekblad

Cited by 0Abstract and details only

Abstract

We present a novel method for ensuring that relational database queries in monadic embedded languages are well-scoped, even in the presence of arbitrarily nested joins and aggregates. Demonstrating our method, we present a simplified version of Selda, a monadic relational database query language embedded in Haskell, with full support for nested inner queries. To our knowledge, Selda is the first relational database query language to support fully general inner queries using a monadic interface.

Cite this paper

APA 7

Ekblad, A. (2019). Scoping monadic relational database queries. https://doi.org/10.1145/3331545.3342598

MLA 9

Ekblad, Anton. “Scoping monadic relational database queries.” 2019, pp. 114–24, https://doi.org/10.1145/3331545.3342598.

Chicago

Ekblad, Anton. 2019. “Scoping monadic relational database queries.” https://doi.org/10.1145/3331545.3342598.

Harvard

Ekblad, A. (2019) ‘Scoping monadic relational database queries’. Available at: https://doi.org/10.1145/3331545.3342598.

BibTeX
@article{ekblad2019scoping,
  title = {{Scoping monadic relational database queries}},
  author = {Ekblad, Anton},
  pages = {114--124},
  year = {2019},
  doi = {10.1145/3331545.3342598}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers