Positive Higher−Order Queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed Lambda-calculus. Our language allows one to succinctly define ordinary positive relational algebra queries (conjunctive queries and unions of conjunctive queries) and, in add...
Huvudupphovsmän: | Benedikt, M, Puppis, G, Vu, H |
---|---|
Materialtyp: | Journal article |
Publicerad: |
2010
|
Liknande verk
Liknande verk
-
Complexity of Higher−Order Queries
av: Vu, H, et al.
Publicerad: (2011) -
Higher-order queries and applications
av: Vu, Q
Publicerad: (2012) -
Querying visible and invisible information
av: Benedikt, M, et al.
Publicerad: (2016) -
Strongly-Normalizing Higher-Order Relational Queries
av: Wilmer Ricciotti, et al.
Publicerad: (2022-08-01) -
Higher−Order Functions and Structured Datatypes
av: Benedikt, M, et al.
Publicerad: (2012)